Abstract
This paper deals with the question of canonical forms, or canonical types, for both grammar forms and context-free grammars. Certain canonical types are position restricted if they depend only upon the positions of terminals and nonterminals. We show that with a few very minor restrictions every possible production-type may be specified as a canonical type for arbitrary context free grammars. The result does not hold for grammar forms where a certain restriction must be made.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Cremers, A. and S. Ginsburg, "Context-free grammar forms." JCSS 11:1, 86–115.
Greibach, S., "A new normal form theorem for context-free phase structure grammars." JACM 12:1, 42–52.
Greibach, S.A., "Chains of full AFL's." Math. Systems Theory 4:3, 231–242.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blattner, M. (1977). Canonical forms of context-free grammars and position restricted grammar forms. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_69
Download citation
DOI: https://doi.org/10.1007/3-540-08442-8_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08442-6
Online ISBN: 978-3-540-37084-0
eBook Packages: Springer Book Archive