Geodesic
Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time
Kybernetika, Tome 17 (1981) no. 5, pp. 368-379

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

Classification : 68F25, 68N20 
@article{KYB_1981__17_5_a2,
     author = {R\r{u}\v{z}i\v{c}ka, Peter},
     title = {Validity test for {Floyd's} operator-precedence parsing algorithms is polynomial in time},
     journal = {Kybernetika},
     pages = {368--379},
     publisher = {mathdoc},
     volume = {17},
     number = {5},
     year = {1981},
     mrnumber = {648209},
     zbl = {0482.68082},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/KYB_1981__17_5_a2/}
}
TY  - JOUR
AU  - Růžička, Peter
TI  - Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time
JO  - Kybernetika
PY  - 1981
SP  - 368
EP  - 379
VL  - 17
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/KYB_1981__17_5_a2/
LA  - en
ID  - KYB_1981__17_5_a2
ER  - 
%0 Journal Article
%A Růžička, Peter
%T Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time
%J Kybernetika
%D 1981
%P 368-379
%V 17
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/KYB_1981__17_5_a2/
%G en
%F KYB_1981__17_5_a2
Růžička, Peter. Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time. Kybernetika, Tome 17 (1981) no. 5, pp. 368-379. http://geodesic.mathdoc.fr/item/KYB_1981__17_5_a2/