Skip to main content
SpringerLink
Log in

Exponential optimization for the LLP(k) parsing method

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

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

Abstract

LLP(k) parsing was introduced by Lomet [9]. This paper presents an LLP(k) version of the LR(k) characteristic parsing method developed by Geller and Harrison [4]. The new construction allows an essential extension of the class of grammars admitting the optimization of parser size. While the till known application works for the class of strict deterministic grammars (see Harrison and Havel [6, 7]) the method presented here covers the whole class of LLP(k) grammars. The improvement in parser size can be even exponential.

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.

References

  1. Aho, A.V. and Ullman, J.D., The Theory of Parsing, Translation, and Compiling, Vols. I,II, Prentice Hall, Englewood Cliffs, N.J., 1972–3.

    Google Scholar 

  2. deRemer, F.L., Simple LR(k) Grammars, CACM, 14 (1971), 453–460

    Google Scholar 

  3. Geller, M.M., Graham, S.L., and Harrison, M.A., Production Prefix Parsing (extended abstract), in Automata, Languages, and Programming, 2nd Colloquium, University of Saarbrücken (J. Loeckx, ed.), 1974, 232–241.

    Google Scholar 

  4. Geller, M.M., Harrison, M.A., Strict Deterministic Versus LR(O) Parsing, Conference Record of ACM Symposium on Principles of Programming Languages, 1973, 22–32.

    Google Scholar 

  5. Geller, M.M., Harrison, M.A., Characteristic Parsing: A Framework for Producing Compact Deterministic Parsers, Parts I,II, unpublished

    Google Scholar 

  6. Harrison, M.A. and Havel, I.M., Strict Deterministic Grammars, Journal of Computer and System Sciences, 7 (1973), 237–277.

    Google Scholar 

  7. Harrison, M.A. and Havel, I.M., On the Parsing of Deterministic Languages, JACM, 21 (1974), 525–548.

    Article  Google Scholar 

  8. Král, J., Demner, J., Parsing As a Subtask of Compiling, MFCS '75, Lecture Notes in Computer Science 32, Springer-Verlag, Berlin, 1975, 61–73.

    Google Scholar 

  9. Lomet, D.B., The Construction of Efficient Deterministic Language Processors, Ph.d. diss., University of Pennsylvania, Philadelphia, 1969, and IBM Research Report RC 2738, 1970.

    Google Scholar 

  10. Lomet, D.B., Formal Construction of Multiple Exit Parsing Routines, Report IBM.

    Google Scholar 

  11. Lomet, D.B., Automatic Generation of Multiple Exit Parsing Subroutines, in Automata, Languages, and Programming, 2nd Colloquium, University of Saarbrücken (J. Loeckx, ed.), 1974, 214–231.

    Google Scholar 

  12. Pittl, J., Characteristic Parsing of LLP(k) Grammars, (in Czech), SVOČ Thesis, Prague, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fetrovská 31, 160 00, Praha 6, Czechoslovakia

    Jan Pittl

Authors
  1. Jan Pittl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pittl, J. (1977). Exponential optimization for the LLP(k) parsing method. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_165

Download citation

  • DOI: https://doi.org/10.1007/3-540-08353-7_165

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08353-5

  • Online ISBN: 978-3-540-37285-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation