Skip to main content
SpringerLink
Log in
Book cover

Theoretical Computer Science pp 243–255Cite as

A general scheme for some deterministically parsable grammars and their strong equivalents

extended abstract

  • Contributed Papers
  • Conference paper
  • First Online:

  • 114 Accesses

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

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

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, N.J., 1972 and 1973.

    Google Scholar 

  2. F.L. DeRemer. Simple LR(k) grammars. Comm. ACM 14 (1971), 453–460.

    Google Scholar 

  3. D. Friede. Partitioned LL(k) grammars. In: Automata, Languages and Programming. H.A. Maurer (ed.), Lect. Notes in Comp. Sci. 71, Springer, Berlin, 1979, 245–255.

    Google Scholar 

  4. D. Friede. Partitioned context-free grammars. TUM-I8115, December 1981, Institut fuer Informatik, Technische Universitaet Muenchen.

    Google Scholar 

  5. M.M. Geller and M.A. Harrison. On LR(k) grammars and languages. Theoret. Comput. Sci. 4 (1977), 245–276.

    Google Scholar 

  6. M. Hammer. A new grammatical transformation into deterministic top-down form. MAC TR-119, Mass. Inst. of Technology, 1974.

    Google Scholar 

  7. M.A. Harrison. Introduction to Formal Language Theory. Addison-Wesley, Reading, Mass., 1978.

    Google Scholar 

  8. M.A. Harrison and I.M. Havel. Strict deterministic grammars. J. Comput. System Sci. 7 (1973), 237–277.

    Google Scholar 

  9. M.A. Harrison and I.M. Havel. On the parsing of deterministic languages. J. Assoc. Comput. Mach. 21 (1974), 525–548.

    Google Scholar 

  10. D.B. Lomet. The construction of efficient deterministic language processors. Ph.D. Thesis, Univ. of Pennsylvania, 1969.

    Google Scholar 

  11. A. Moura. Syntactic equivalence of grammar classes. Ph.D. Thesis, Univ. of California at Berkeley, September 1980.

    Google Scholar 

  12. A. Nijholt. Context-Free Grammars: Covers, Normal Forms, and Parsing. Lect. Notes in Comp. Sci. 93, Springer, Berlin, 1980.

    Google Scholar 

  13. A. Nijholt. Parsing strategies: A concise survey. In: Mathematical Foundations of Computer Science. J. Gruska and M. Chytil (eds.), Lect. Notes in Comp. Sci. 118, Springer, Berlin, 1981.

    Google Scholar 

  14. A. Nijholt and E. Soisalon-Soininen. Ch(k) grammars — A characterization of LL(k) languages. In: Mathematical Foundations of Computer Science. J. Becvar (ed.), Lect. Notes in Comp. Sci. 74, Springer, Berlin, 1979, 390–397.

    Google Scholar 

  15. J. Pittl. On LLP(k) grammars and languages. Theoret. Comput. Sci. 16 (1981), 149–175.

    Google Scholar 

  16. J. Pittl. On LLP(k) parsers. J. Comput. System Sci. 24 (1982), 36–68.

    Google Scholar 

  17. D.J. Rosenkrantz and R.E. Stearns. Properties of deterministic top-down grammars. Information and Control 17 (1970), 226–256.

    Google Scholar 

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

    Google Scholar 

  19. E. Ukkonen. Transformations to produce certain covering grammars. In: Mathematical Foundations of Computer Science. J. Winkowski (ed.), Lect. Notes in Comput. Sci. 64, Springer, Berlin, 1978, 516–525.

    Google Scholar 

  20. E. Ukkonen. A modification of the LR(k) method for constructing compact bottom-up parsers. In: Automata, Languages and Programming. H.A. Maurer (ed.), Lect. Notes in Comput. Sci. 71, Springer, Berlin, 1979, 646–658.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Twente University of Technology, PO Box 217, 7500 AE, Enschede, The Netherlands

    Anton Nijholt

  2. Research Inst. Math. Machines, Loretanske Nam. 3, 11855, Prague 1, Czechoslovakia

    Jan Pittl

Authors
  1. Anton Nijholt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jan Pittl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Armin B. Cremers Hans-Peter Kriegel

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nijholt, A., Pittl, J. (1982). A general scheme for some deterministically parsable grammars and their strong equivalents. In: Cremers, A.B., Kriegel, HP. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036485

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11973-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation