Transformations to produce certain covering grammars

  • Esko Ukkonen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)


Two grammatical transformations are presented for producing a context-free grammar which left-to-right covers the original grammar. The first transformation can be used to transform grammars in an extensive subclass of the non-right-recursive grammars into covering grammars which are in Greibach normal form. The second transformation converts a subclass of LR(0) grammars into covering grammars which are strict deterministic. This transformation is further extended to produce a covering strict deterministic grammar for all LR(0) grammars.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aho, A.V. and J.D. Ullman: The Theory of Parsing, Translation, and Compiling, Vol. I: Parsing. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1972.Google Scholar
  2. 2.
    Geller, M.M. and M.A. Harrison: On LR(k) grammars and languages. Theoretical Computer Science 4 (1977), 245–276.CrossRefGoogle Scholar
  3. 3.
    Gray, J.N. and M.A. Harrison: On the covering and reduction problems for context-free grammars. J. Assoc. Comput. Mach. 19 (1972), 675–698.Google Scholar
  4. 4.
    Harrison, M.A. and I.M. Havel: Strict deterministic grammars. J. Comput. System Sci. 7 (1973), 237–277.Google Scholar
  5. 5.
    Nijholt,A.: Cover results and normal forms. In: Proc. 6th Int. Symp. on Mathematical Foundations of Computer Science (ed. J.Gruska), Lecture Notes in Computer Science 53, pp. 420–429, Springer-Verlag, 1977.Google Scholar
  6. 6.
    Nijholt,A.: On the covering of left recursive grammars. Conf. Record of the Fourth ACM Symp. on Principles of Programming Languages (1977), 86–96.Google Scholar
  7. 7.
    Nijholt, A.: On the covering of parsable grammars. J. Comput. System Sci. 15 (1977), 99–110.Google Scholar
  8. 8.
    Soisalon-Soininen,E.: Characterization of LL(k) languages by restricted LR(k) grammars. Report A-1977-3, Department of Computer Science, University of Helsinki, 1977.Google Scholar
  9. 9.
    Soisalon-Soininen, E.: On the covering problem for left-recursive grammars. Theoretical Computer Science (to appear).Google Scholar
  10. 10.
    Soisalon-Soininen, E. and E. Ukkonen: A characterization of LL(k) languages. In: Automata, Languages and Programming, Third Colloquium (eds. S. Michaelson and R. Milner), pp. 20–30, Edinburgh University Press, Edinburgh, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Esko Ukkonen
    • 1
  1. 1.Department of Computer ScienceUniversity of HelsinkiHelsinki 10Finland

Personalised recommendations