Advertisement

Cover results and normal forms

  • Anton Nijholt
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)

Abstract

The purpose of this paper was to sketch an area of problems for the concept of cover. We showed that in spite of some remarks in the literature the problem of covering (unambiguous and ɛ-free) cfg's with cfg's in GNF is open. Moreover we gave some properties of covers and we showed a relation between covers and parsability.

Keywords

Normal Form Pair Production Computing Machinery Fine Cover Conference Record 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aho A.V. and Ullman J.D., The Theory of Parsing, Translation and Compiling, Vols. I and II, Prentice Hall, Englewood Cliffs, New Jersey, 1972 and 1973.Google Scholar
  2. 2.
    Geller M.M., Harrison M.A. and Havel I.M., Normal forms of deterministic languages, Discrete Mathematics, Vol. 16, pp. 313–322, 1976.CrossRefGoogle Scholar
  3. 3.
    Graham S.L., On bounded right context languages and grammars, SIAM Journal on Computing, Vol. 3, pp. 224–254, 1974.CrossRefGoogle Scholar
  4. 4.
    Gray J.N. and Harrison M.A., On the covering and reduction problems for context-free grammars, Journal of the Association for Computing Machinery, Vol. 19, pp. 675–698, 1972.Google Scholar
  5. 5.
    Hammer M, A new grammatical transformation into LL(k) form, Conference Record of the 6th annual ACM Symposium on Theory of Computing, pp. 266–275, 1974.Google Scholar
  6. 6.
    Harrison M.A. and Havel I.M., Strict deterministic grammars, Journal of Computer and System Sciences, Vol. 7, pp. 237–277, 1973.Google Scholar
  7. 7.
    Harrison M.A., On covers and precedence analysis, Lecture Notes in Computer Science 1, G.I. 3. Jahrestagung, pp. 2–17, 1973.Google Scholar
  8. 8.
    Hunt III H.B., A complexity theory of grammar problems, Conference Record of the 3rd ACM Symposium on Principles of Programming Languages, pp. 12–18, 1976.Google Scholar
  9. 9.
    Hunt III H.B., Rosenkrantz D.J. and Szymanski T.G., The covering problem for linear context-free grammars, Theoretical Computer Science, Vol. 2, pp. 361–382, 1976.CrossRefGoogle Scholar
  10. 10.
    Hunt III H.B., Rosenkrantz D.J. and Szymanski T.G., On the equivalence, containment, and covering problems for the regular and context-free languages, Journal of Computer and System Sciences, Vol. 12, pp. 222–268, 1976.Google Scholar
  11. 11.
    Hunt III H.B., Szymanski T.G., Lower bounds and reductions between grammar problems, Technical Report 216, Princeton University, 1976.Google Scholar
  12. 12.
    Lomet D.B., A formalization of transition diagram systems, Journal of the Association for Computing Machinery, Vol. 20, pp. 235–257, 1973.Google Scholar
  13. 13.
    McAfee J. and Presser L., An algorithm for the design of simple precedence grammars, Journal of the Association for Computing Machinery, Vol. 19, pp. 385–395, 1972.Google Scholar
  14. 14.
    Mickunas M.D., On the complete covering problem for LR(k) grammars, Journal of the Association for Computing Machinery, Vol. 23, pp. 17–30, 1976.Google Scholar
  15. 15.
    Mickunas M.D., Lancaster R.L. and Schneider V.B., Transforming LR(k) grammars to LR(1), SLR(1) and (1,1) Bounded Right Context grammars, Journal of the Association for Computing Machinery, Vol. 23, pp. 511–533, 1976.Google Scholar
  16. 16.
    Nijholt A., On the covering of left-recursive grammars, Conference Record of the 4th ACM Symposium on Principles of Programming Languages, pp. 86–96, 1977.Google Scholar
  17. 17.
    Nijholt A., On the covering of parsable grammars, to appear in Journal of Computer and System Sciences.Google Scholar
  18. 18.
    Nijholt A., On the parsing of LL-Regular grammars, Lecture Notes in Computer Science 45, Proc. 5th Int. Symposium on Mathematical Foundations of Computer Science, pp. 446–452, 1976.Google Scholar
  19. 19.
    Nijholt A., Simple Chain Grammars, Proc. 4th Int. Conference on Automata, Languages and Programming, 1977 (to appear).Google Scholar
  20. 20.
    Nijholt A., Simple Chain Languages, manuscript, march 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

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

Personalised recommendations