Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Validity test for Floyd's operator-precedence parsing algorithms

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 74))

  • 146 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  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 

  6. Henderson, D.S., and M.R. Levy, An Extended Operator-Precedence Parsing Algorithm. Computing Journal 19: 3, 229–233, 1976.

    Article  Google Scholar 

  7. Knuth, D., Top Down Syntax Analysis. Acta Informatica 1: 2, 79–110, 1971.

    Article  Google Scholar 

  8. Levy, M.R., Complete Operator Precedence. IPL 4: 2, 38–40, 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computing Research Center, Dúbravská 3, 885 31, Bratislava, Czechoslovakia

    Peter Ružička

Authors
  1. Peter Ružička
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ružička, P. (1979). Validity test for Floyd's operator-precedence parsing algorithms. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation