Skip to main content
SpringerLink
Log in

Ch(k) grammars: A characterization of LL(k) languages

  • 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))

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. A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation and Compiling, Vols 1 and 2, Prentice Hall, Englewood Cliffs, N.J., 1972 and 1973.

    Google Scholar 

  2. B.M. Brosgol, Deterministic translation grammars, Proc. 8th Princeton Conf. on Information Sciences and Systems 1974, pp. 300–306.

    Google Scholar 

  3. A.J. Demers, Generalized left corner parsing, Conf. Record of the 4th ACM Sympos. on Principles of Programming Languages 1977, pp. 170–182.

    Google Scholar 

  4. M. Hammer, A new grammatical transformation into LL(k) form, Conf. Record of the 6th Annual ACM Sympos. on Theory of Computing 1974, pp. 266–275.

    Google Scholar 

  5. A. Nijholt, A left part theorem for grammatical trees, Discrete Mathematics 25 (1979), pp. 51–63.

    Article  Google Scholar 

  6. A. Nijholt, Simple chain grammars and languages, to appear in Theoretical Computer Science.

    Google Scholar 

  7. D.J. Rosenkrantz and P.M. Lewis, Deterministic left-corner parsing, IEEE Conf. Record of the 11th Annual Sympos. on Switching and Automata Theory 1970, pp. 139–152.

    Google Scholar 

  8. E. Soisalon-Soininen, Characterization of LL(k) languages by restricted LR(k) grammars, Ph.D. Thesis, Report A-1977-3, Department of Computer Science, University of Helsinki.

    Google Scholar 

  9. E. Soisalon-Soininen and E. Ukkonen, A characterization of LL(k) languages, in: Automata, Languages and Programming (eds. S. Michaelson and R. Milner), Third Colloquim, Edinburgh University Press, Edinburgh, 1976, pp. 20–30.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Vrije Universiteit, Amsterdam, The Netherlands

    Anton Nijholt

  2. Department of Computer Science, University of Helsinki, Finland

    Eljas Soisalon-Soininen

Authors
  1. Anton Nijholt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eljas Soisalon-Soininen
    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

Nijholt, A., Soisalon-Soininen, E. (1979). Ch(k) grammars: A characterization of LL(k) languages. 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_38

Download citation

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

  • 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