Advertisement

BIT Numerical Mathematics

, Volume 19, Issue 1, pp 73–78 | Cite as

Grammar functors and covers: From non-left-recursive to greibach normal form grammars

  • Anton Nijholt
Article

Abstract

Attention is paid to structure preserving properties of transformations from a non-left-recursive context-free grammar to a Greibach normal form grammar. It is demonstrated that such a transformation cannot only be ambiguity preserving, but also both cover and functor relations between grammars or their associated syntax-categories can be obtained from such a transformation.

Keywords

context-free grammar cover syntax-category grammar functor Greibach normal form 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. V. Aho and J. D. Ullman,The theory of parsing, translation and compiling, Vol. 1 and 2., Prentice-Hall, Englewood Cliffs, N.J. 1972 and 1973.Google Scholar
  2. 2.
    D. B. Benson,Some preservation properties of normal form grammars, Siam J. of Comput. 6 (1977), 381–402.CrossRefGoogle Scholar
  3. 3.
    J. N. Gray and M. A. Harrison,On the covering and reduction problems for context-free grammars, J. Assoc. Comput. Mach. 19 (1972), 675–698.Google Scholar

Copyright information

© BIT Foundations 1979

Authors and Affiliations

  • Anton Nijholt
    • 1
  1. 1.Department of MathematicsVrije UniversiteitAmsterdamThe Netherlands

Personalised recommendations