Geodesic
Validity test for Floyd's operator-precedence parsing algorithms is polynomial in time
Kybernetika, Tome 17 (1981) no. 5, pp. 368-379 Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

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},
     year = {1981},
     volume = {17},
     number = {5},
     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
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
%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/

[1] A. V. Aho J. D. Ullman: The Theory of Parsing, Translation, and Compiling. Vol. I: Parsing. Prentice-Hall, 1972. | MR

[2] A. J. Demers: Skeletal LR parsing. 15th Annual Symposium on Switching and Automata Theory 1974, 185-198. | MR

[3] N. El Djabri: Extending the LR Parsing Techniques to Some Non-LR Grammars. TR-121, Princeton University, New Jersey 1973.

[4] M. J. Fischer: Some properties of precedence languages. 1st Annual ACM Symposium on Theory of Computing 1969, 181-190.

[5] J. N. Gray: Precedence Parsers for Programming Languages. Ph. D. Thesis, Department of Computer Science, University of California, Berkeley 1969.

[6] D. S. Henderson M. R. Levy: An extended operator-precedence parsing algorithm. Comput. J. 19 (1976), 3, 229-233. | MR

[7] D. Knuth: Top down syntax analysis. Acta Informatica I (1971), 2, 79-110.

[8] M. R. Levy: Complete operator precedence. Information Processing Lett. 4 (1975), 2, 38-40. | MR | Zbl

[9] R. Mc Naughton: Paranthesis grammars. J. Assoc. Comput. Mach. 14 (1967), 3, 490-500. | MR

[10] M. C. Paull S. H. Unger: Structural equivalence of context-free grammars. J. Comput. System Sci. 2 (1968), 1, 427-463. | MR

[11] P. Růžička: Validity test for Floyd's operator-precedence parsing algorithms. In: Mathematical Foundations of Computer Science (J. Bečvář, ed.), Lecture Notes in Computer Science 74. Springer-Verlag, Berlin 1979, 415-424. | Zbl