Skip to main content
Springer Nature Link
Log in

Deterministic grammars and grammar morphisms

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

The present categorial approach to bottom-up parsing context free grammars treats two aspects of determinism. One is an abstraction of grammatical determinism from actual parsing strategies. The other is the transfer of determinism under grammar transformations. The approach is based on the characterization of a parse step as categorial limit, which on the one hand yields a convenient pattern for grammar type definition, and leads on the other hand in a transparent way to invariance results on deterministic grammars under homomorphic transformations.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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. Aho, A.V., Ullman, J.D.: Principles of Compiler Design. Reading: Addison-Wesley (1978)

    Google Scholar 

  2. Benson, D.: Some Preservation Properties of Normal Form Grammars. SIAM J. Comput. Syst. Sci. 6, 2 (1977), p. 381–402

    Google Scholar 

  3. Gray, J.N., Harrison, M.A.: On the covering and reduction problems for context free grammars. J. ACM 12, 675–698 (1972)

    Google Scholar 

  4. Hotz, G.: Eindeutigkeit und Mehrdeutigkeit formaler Sprachen. EIK 2, 235–246 (1966)

    Google Scholar 

  5. Hotz, G., Ross, R.: LL(k)- und LR(k)-Invarianz von kontextfreien Grammatiken unter einer Transformation auf Greibach-Normalform. EIK 15, 1–2 (1979)

    Google Scholar 

  6. Knuth, D.E.: On the translation of languages from left to right. Inf. Control 8, 607–639 (1965)

    Google Scholar 

  7. Lomet, D.B.: A formalization of transition diagram systems. J. ACM 20, 235–257 (1973)

    Google Scholar 

  8. Nijholt, A.: Context-free Grammars: Covers. Normal Forms, and Parsing. Academisch Proefschrift, Vrije Universiteit te Amsterdam (1980)

  9. Nijholt, A.: Parsing strategies: A concise survey. In: Math. Found. of Comp. Sci. Lect. Notes Compu. Sci. 118. Berlin, Heidelberg, New York: Springer (1981)

    Google Scholar 

  10. Reichardt, J.: Die Invarianz der Parsingeigenschaft unter Grammatikmorphismen. (Dissertation), Darmstadt (1985)

  11. Szymanski, T.G., Williams, J.H.: Noncanonical extensions of bottom-up parsing techniques. SIAM J. Comput. 5, 122–129 (1976)

    Google Scholar 

  12. Walter, H.K.-G.: Grammatik- und Sprachfamilien IV. Technical Report AFS 75-22, TH Darmstadt, FB Informatik (1975)

    Google Scholar 

Download references

Author information

Author notes

  1. Johannes Reichardt

    Present address: Danet GmbH, Otto Röhm Str. 71, D-6100, Darmstadt, Federal Republic of Germany

Authors and Affiliations

  1. Technische Hochschule Darmstadt, Institut für Theoretische Informatik, FB Informatik, Alexanderstraße 24, D-6100, Darmstadt, Federal Republic of Germany

    Johannes Reichardt

Authors
  1. Johannes Reichardt
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reichardt, J. Deterministic grammars and grammar morphisms. Acta Informatica 23, 567–583 (1986). https://doi.org/10.1007/BF00288470

Download citation

  • Received:

  • Issue Date:

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

Keywords