Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1978: Mathematical Foundations of Computer Science 1978 pp 516–525Cite as

Transformations to produce certain covering grammars

  • Communications
  • Conference paper
  • First Online:

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

Abstract

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.

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. 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. Geller, M.M. and M.A. Harrison: On LR(k) grammars and languages. Theoretical Computer Science 4 (1977), 245–276.

    Article  Google Scholar 

  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. Harrison, M.A. and I.M. Havel: Strict deterministic grammars. J. Comput. System Sci. 7 (1973), 237–277.

    Google Scholar 

  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. 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. Nijholt, A.: On the covering of parsable grammars. J. Comput. System Sci. 15 (1977), 99–110.

    Google Scholar 

  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. Soisalon-Soininen, E.: On the covering problem for left-recursive grammars. Theoretical Computer Science (to appear).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, Töölönkatu 11, SF-00100, Helsinki 10, Finland

    Esko Ukkonen

Authors
  1. Esko Ukkonen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Winkowski

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ukkonen, E. (1978). Transformations to produce certain covering grammars. In: Winkowski, J. (eds) Mathematical Foundations of Computer Science 1978. MFCS 1978. Lecture Notes in Computer Science, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08921-7_100

Download citation

  • DOI: https://doi.org/10.1007/3-540-08921-7_100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08921-6

  • Online ISBN: 978-3-540-35757-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation