Skip to main content
SpringerLink
Log in

Translations on a subclass of LR(k) grammars

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

A large subclass of LR(k) grammars, called predictive LR(k) or PLR(k) grammars, is considered in terms of the compilation activities a PLR(k) parser can drive. These properties are measured by defining for PLR(k) grammars a class of syntax-directed translations definable by a deterministic pushdown transducer.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1972.

    Google Scholar 

  2. A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation, and Compiling, Vol. II: Compiling, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1973.

    Google Scholar 

  3. M. Hammer,A new grammatical transformation into deterministic top-down form, Project MAC Technical Report TR-119, Massachusetts Institute of Technology, Mass., 1974.

    Google Scholar 

  4. M. Hammer,A new grammatical transformation into LL(k) form, in:Conference Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 266–275, 1974.

  5. P. M. Lewis II and R. E. Stearns,Syntax directed transduction, J. Assoc. Comput. Mach.15 (1968), 464–488.

    Google Scholar 

  6. A. Nijholt,Context-Free Grammars: Covers, Normal Forms, and Parsing, Lecture Notes in Computer Science93, Springer-Verlag, Berlin-Heidelberg-New York, 1980.

    Google Scholar 

  7. A. Nijholt,Parsing strategies: A concise survey, in:Mathematical Foundations of Computer Science 1981 (edited by J. Gruska and M. Chytil), pp. 103–120, Lecture Notes in Computer Science118, Springer-Verlag, Berlin-Heidelberg-New York, 1981.

    Google Scholar 

  8. D. J. Rosenkrantz and P. M. Lewis II,Deterministic left corner parsing, in:IEEE Conference Record of the 11th Annual Symposium on Switching and Automata Theory, pp. 139–152, 1970.

  9. E. Soisalon-Soininen and E. Ukkonen,A method for transforming grammars into LL(k) form, Acta Informatica19(1979), 339–369.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, Tukholmankatu 2, SF-00250, Helsinki 25, Finland

    Eljas Soisalon-Soininen

Authors
  1. Eljas Soisalon-Soininen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the Academy of Finland.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Soisalon-Soininen, E. Translations on a subclass of LR(k) grammars. BIT 22, 303–312 (1982). https://doi.org/10.1007/BF01934444

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01934444

Categories and Subject Descriptors

General Terms

Additional Keywords and Phrases

Search

Navigation