Skip to main content

Partitioned LL(k) grammars

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1979)

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

Included in the following conference series:

  • 175 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing, Prentice Hall, Englewood Cliffs, New York, 1972.

    Google Scholar 

  2. Aho, A.V., Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vol. 2: Compiling, Prentice Hall, Englewood Cliffs, New York, 1973.

    Google Scholar 

  3. Friede, D., Über determistisch kontextfreie Sprachen und rekursiven Abstieg, Bericht Nr. 49 des Fachbereichs Informatik der Universität Hamburg, 1978.

    Google Scholar 

  4. Friede,D., Transition Diagrams and Strict Deterministic Grammars, Lecture Notes in Computer Science 67: Theoretical Computer Science 4th GI Conference, 1979.

    Google Scholar 

  5. Geller, M.M, Harrison, M.A., Strict Deterministic versus LR(0) Parsing, Conference Record of ACM Symposium on Principles of Programming Languages, 1973.

    Google Scholar 

  6. Harrison, M.A., Havel, I.M., Strict Deterministic Grammars, Journal of Computer and System Sciences, Vol. 7, Nr. 3, 1973.

    Google Scholar 

  7. Harrison, M.A., Havel, I.M., On the Parsing of Deterministic Languages, Journal of the ACM, Vol.21 Nr.4, 1974.

    Google Scholar 

  8. Lomet, D.B., A Formalisation of Transition Diagram Systems, Journal of the ACM, Vol. 20 Nr 2, 1973.

    Google Scholar 

  9. Lomet, D.B., Automatic generation of multiple exit parsing subroutines. Proc. of the 2nd Colloquium on Automata, Languages and Programming. Springer-Verlag, Lecture Notes in Computer Science 14, New York, 1974, 214–231.

    Google Scholar 

  10. Pittl, Jan, Exponential Optimization for the LLP(k) Parsing Method, Lecture Notes in Computer Science 53: Mathematical Foundations of Computer Science, 1977.

    Google Scholar 

  11. Rosenkrantz, D.J., Stearns, R.E., Properties of Deterministic Top-Down Grammars, ACM Symposium, Marina del Rey 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Friede, D. (1979). Partitioned LL(k) grammars. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics