Validity test for Floyd's operator-precedence parsing algorithms
The classes of languages definable by operator-precedence grammars and by Floyd's operator-precedence algorithms are studied. Operator-precedence languages are shown to be a proper superclass of languages accepted by Floyd's operator-precedence parsing algorithms. An algorithm is developed to decide equivalence of an operator-precedence grammar and the underlying Floyd's operator-precedence parsing algorithm, a result of possible practical significance. As a consequence a necessary and sufficient condition for an operator-precedence grammar to be valid grammatical characterization for the underlying Floyd's operator-precedence parsing algorithm is obtained.
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., and J.D. Ullman, The Theory of Parsing, Translation and Compiling, Vol. I: Parsing. Englewood Cliffs, N.J., Prentice-Hall, 1972.Google Scholar
- 2.Demers, A.J., Skeletal LR Parsing. IEEE Conference Record of 15th Annual Symposium on Switching and Automata Theory, 185–198, 1974.Google Scholar
- 3.El Djabri, N., Extending the LR Parsing Techniques to Some Non-LR Grammars. TR — 121, Department of AACS, Princeton University, Princeton, New Jersey, 1973.Google Scholar
- 4.Fischer, M.J., Some Properties of Precedence Languages. Proc. ACM Symposium on Theory of Computing, 181–190, 1969.Google Scholar
- 5.Gray, J.N., Precedence Parsers for Programming Languages. Ph. D. Thesis, Department of Computer Science, University of California, Berkeley, 1969.Google Scholar
- 8.Levy, M.R., Complete Operator Precedence. IPL 4: 2, 38–40, 1975.Google Scholar