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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
Geller M.M., Harrison M.A. and Havel I.M., Normal forms of deterministic languages, Discrete Mathematics, Vol. 16, pp. 313–322, 1976.
Graham S.L., On bounded right context languages and grammars, SIAM Journal on Computing, Vol. 3, pp. 224–254, 1974.
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.
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.
Harrison M.A. and Havel I.M., Strict deterministic grammars, Journal of Computer and System Sciences, Vol. 7, pp. 237–277, 1973.
Harrison M.A., On covers and precedence analysis, Lecture Notes in Computer Science 1, G.I. 3. Jahrestagung, pp. 2–17, 1973.
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.
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.
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.
Hunt III H.B., Szymanski T.G., Lower bounds and reductions between grammar problems, Technical Report 216, Princeton University, 1976.
Lomet D.B., A formalization of transition diagram systems, Journal of the Association for Computing Machinery, Vol. 20, pp. 235–257, 1973.
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.
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.
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.
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.
Nijholt A., On the covering of parsable grammars, to appear in Journal of Computer and System Sciences.
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.
Nijholt A., Simple Chain Grammars, Proc. 4th Int. Conference on Automata, Languages and Programming, 1977 (to appear).
Nijholt A., Simple Chain Languages, manuscript, march 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nijholt, A. (1977). Cover results and normal forms. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_163
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_163
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive