Structure preserving transformations on non-left-recursive grammars

Preliminary version
  • Anton Nijholt
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)


Normal Form Attribute Grammar Nonterminal Symbol Compiler Construction Identity Homomorphism 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    AHO, A.V. and ULLMAN, J.D., The Theory of Parsing, Translation and Compiling, Vol. 1 and 2, Prentice Hall, Englewood Cliffs, N.J. 1972 and 1973.Google Scholar
  2. [2]
    BENSON, D.B. Some preservation properties of normal form grammars, SIAM J. Comput. 6 (1977), pp. 381–402.Google Scholar
  3. [3]
    BERTSCH, E., An observation on relative parsing time, J.Assoc.Comput. Mach. 22 (1975), pp. 493–498.Google Scholar
  4. [4]
    BOCHMAN, G.V., Semantic equivalence of covering attribute grammars, Publication #218, december 1975, Université de Montreal.Google Scholar
  5. [5]
    BOCHMAN, G.V., Semantic attributes for grammars with regular expressions, Publication #195, Université de Montreal.Google Scholar
  6. [6]
    BROSGOL, B.M., Deterministic translation grammars, Proc.Eight Princeton Conference on Information Sciences and Systems, 1974, pp. 300–306.Google Scholar
  7. [7]
    DEMERS, A.J., Generalized left corner parsing, Conf. Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977, pp. 170–182.Google Scholar
  8. [8]
    FOSTER, J.M., A syntax improving program, Computer Journal 11 (1968), pp.31–34.Google Scholar
  9. [9]
    GELLER, M.M., HARRISON, M.A. and HAVEL, I.M., Normal forms of deterministic grammars, Discrete Mathematics 16 (1976), pp.313–322.Google Scholar
  10. [10]
    GINSBURG, S. and HARRISON, M.A., Bracketed context-free languages, J.Comput. System Sci. 1 (1967), pp. 1–23.Google Scholar
  11. [11]
    GRAY, J.N. and HARRISON, M.A., Single pass precedence analysis, IEEE Conf.Record of the 10 th Annual Symposium on Switching and Automata Theory, 1969, pp. 106–117.Google Scholar
  12. [12]
    GRAY, J.N. and HARRISON, M.A., On the covering and reduction problems for contextfree grammars, J. Assoc.Comput.Mach. 19 (1972), pp. 385–395.Google Scholar
  13. [13]
    GREIBACH, S.A., A new normal-form theorem for context-free phrase structure grammars, J. Assoc.Comput.Mach. 12 (1965), pp. 42–52.Google Scholar
  14. [14]
    GREIBACH, S.A. Erasable context-free languages, Information and Control 29 (1975), pp. 301–326.Google Scholar
  15. [15]
    GRIFFITHS, T.V., and PETRICK, S.R., On the relative efficiencies of contextfree grammar recognizers, Comm. ACM 8 (1965), pp. 289–300.Google Scholar
  16. [16]
    HARRISON, M.A., and HAVEL, I.M., Strict deterministic grammars, J.Comput. System Sci. 7 (1973), pp. 237–277.Google Scholar
  17. [17]
    HARRISON, M.A., and HAVEL, I.M., Real-time strict deterministic languages, SIAM J. of Comput. 4 (1972), pp. 333–349.Google Scholar
  18. [18]
    HOPCROFT, J.E., and ULLMAN, J.D. Formal Languages and Their Relation to Automata, Addison Wesley Publishing Co., Reading, Mass., 1969.Google Scholar
  19. [19]
    HOTZ, G., Normal-form transformations of context-free grammars, to appear in Acta Kybernetica.Google Scholar
  20. [20]
    HOTZ, G., Eine Algebraisierung des Syntheseproblem von Schaltkreisen, I und II, Elektr. Inform. und Kybernetik 1 (1965), pp. 185–231.Google Scholar
  21. [21]
    HOTZ, G., Eindeutigkeit und mehrdeutigkeit formaler Sprachen, Elektr. Inform. und Kybernetik 2 (1966), pp. 235–246.Google Scholar
  22. [22]
    HOTZ, G., LL(k)-und LR(k) Invarianz von kontextfreien Grammatiken unter einer Transformation auf Greibachnormalform, manuscript, 1978.Google Scholar
  23. [23]
    HOTZ, G., and CLAUS, V., Automaten-Theorie und Formale Sprachen III, Bibliographisches Institut Mannheim, West Germany 1971.Google Scholar
  24. [24]
    HUNT, H.B., and ROSENKRANTZ, D.J., Complexity of grammatical similarity relations, Proc. of the Conference on Theoretical Computer Science, Waterloo 1977, pp. 139–145.Google Scholar
  25. [25]
    KNUTH, D.E., Semantics of context-free languages, Math. Systems Theory 2 (1968) pp. 127–145.Google Scholar
  26. [26]
    KUNO, S., The augmented predictive analyzer for context-free languages-Its relative efficiency, Comm. ACM 9 (1966), pp. 810–823.Google Scholar
  27. [27]
    KURKI-SUONIO, R., On the top-to-bottom recognition and left recursion, Comm. ACM 9 (1966), pp. 527–528.Google Scholar
  28. [28]
    McNAUGHTON, R., Parenthesis grammars, J. Assoc.Comput.Mach. 14 (1967), pp.490–500.Google Scholar
  29. [29]
    NIJHOLT, A., On the parsing and covering of simple chain grammars, in: Automata, Languages and Programming, G. Ausiello and C. Böhm (eds.), Lect.Notes in Comp.Sci.62 (Springer, Berlin, 1978), pp.330–344.Google Scholar
  30. [30]
    NIJHOLT, A., Grammar functors and covers: From non-left-recursive to Greibach normal form grammars, to appear in BIT 19 (1979).Google Scholar
  31. [31]
    NIJHOLT, A., A left part theorem for grammatical trees, Discrete Mathematics 25 (1979), pp. 51–64.Google Scholar
  32. [32]
    NIJHOLT, A., From left regular to Greibach normal form grammars, unpublished manuscript.Google Scholar
  33. [33]
    NIJHOLT, A., A survey of normal form covers for context-free grammars, IR-49, February 1979, Vrije Universiteit, Amsterdam.Google Scholar
  34. [34]
    REYNOLDS, J.C., Grammatical covering, Argonne National Laboratory, T.M. No. 96, 1968.Google Scholar
  35. [35]
    REYNOLDS, J.C. and HASKELL, R., Grammatical coverings, unpublished manuscript, Syracuse University, 1970.Google Scholar
  36. [36]
    ROSENKRANTZ, D.J., Matrix equations and normal forms for context-free grammars, J.Assoc.Comput.Mach. 14 (1967), pp. 501–507.Google Scholar
  37. [37]
    ROSENKRANTZ, D.J. and LEWIS, P.M. Deterministic left-corner parsing, IEEE Conf. Record of the 11th Annual Symposium on Switching and Automata Theory, 1970, pp. 139–152.Google Scholar
  38. [38]
    ROSENKRANTZ, D.J. and STEARNS, R.E., Properties of deterministic top-down grammars, Information and Control 17 (1970), pp. 226–256.Google Scholar
  39. [39]
    SOISALON-SOININEN, E., On the covering problem for left-recursive grammars, to appear in Theor.Comput.Science.Google Scholar
  40. [40]
    UKKONEN, E., Transformations to produce certain covering grammars, in: Mathematical Foundations of Computer Science, J. Winkowski (ed.), Lect. Notes in Comp.Sci.64 (Springer, Berlin, 1978), pp. 516–525.Google Scholar
  41. [41]
    UKKONEN, E., Remarks on the nonexistence of some covering grammars, to appear in Proc. 4th G.I.Conference on Theoretical Computer Science, 1979.Google Scholar
  42. [42]
    WALTER, H.K.G. KEKLIKOGLOU, J. and KERN, W., The behaviour of parsing time under grammar morphisms, RAIRO-Theor.Comput.Science 12 (1978), pp.83–97.Google Scholar
  43. [43]
    WOOD, D., The normal form theorem — another proof, Computer Journal 12 (1969), pp. 139–147.Google Scholar
  44. [44]
    WOOD, D., A generalized normal form theorem for context-free grammars, Computer Journal 13 (1970), pp. 272–277.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

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

Personalised recommendations