zbMATH — the first resource for mathematics

Validity test for Floyd’s operator-precedence parsing algorithms is polynomial in time. (English) Zbl 0482.68082

68N20 Theory of compilers and interpreters
Full Text: EuDML
[1] A. V. Aho J. D. Ullman: The Theory of Parsing, Translation, and Compiling. Vol. I: Parsing. Prentice-Hall, 1972.
[2] A. J. Demers: Skeletal LR parsing. 15th Annual Symposium on Switching and Automata Theory 1974, 185-198.
[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. · Zbl 1282.68148
[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. · Zbl 0329.68073
[7] D. Knuth: Top down syntax analysis. Acta Informatica I (1971), 2, 79-110. · Zbl 0233.68022
[8] M. R. Levy: Complete operator precedence. Information Processing Lett. 4 (1975), 2, 38-40. · Zbl 0322.68055
[9] R. Mc Naughton: Paranthesis grammars. J. Assoc. Comput. Mach. 14 (1967), 3, 490-500.
[10] M. C. Paull S. H. Unger: Structural equivalence of context-free grammars. J. Comput. System Sci. 2 (1968), 1, 427-463. · Zbl 0179.02301
[11] P. Růžička: Validity test for Floyd’s operator-precedence parsing algorithms. Mathematical Foundations of Computer Science (J. Bečvář, Lecture Notes in Computer Science 74. Springer-Verlag, Berlin 1979, 415-424. · Zbl 0412.68082
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.