Abstract
A transformation based on an algorithm for the conversion of an arbitrary context-free grammar to Greibach normal form was found that it appears could be modified to target any normal form. The original algorithm and a modification of the algorithm that targets an operator normal form with terminal head and tail are presented. These transformations suggest how a meta-normal form algorithm for context-free grammars could be designed.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Büchi: Regular canonical systems. Arch. Math. Logik Grundlagenforsch. 6 (1964), 91–111.
A. Ehrenfeucht, G. Rozenberg: An easy proof of Greibach normal form. Inform. and Control 63 (1984), 190–199.
S. Greibach: A new normal form theorem for context-free phrase structure grammars. J. Assoc. Comput. Mach. 12(1) (January 1965), 42–52.
S. Greibach: A simple proof of the standard-form theorem for context-free grammars. Technical Report NSF-18, Mathematical Lingistics and Automatic Translation, Aiken Computation Laboratory, Harvard University, II-1-II-4, August 1967.
S. Greibach: Erasable context-free languages. Inform. and Control 29 (1975), 301–326.
M. Harrison: Introduction to formal language theory, ch. 4. Addison-Wesley Publishing Co., 1978.
J. Hopcroft, J. Ullman: Formal languages and their relation to automata, ch. 4. Addison-Wesley Publishing Co., 1969.
G. Hotz: Normal-form transformations of context-free grammars. Acta Cybernet. 5 (1980), 65–84.
R. Koch, N. Blum:Greibach normal form transformation, revisited.In Reischuk, Morvan (editors): STACS'97 Proceedings. Lecture Notes in Computer Science 1200, 47-54. Springer-Verlag, 1997.
C. Miller: Ph.D. Thesis, in preparation.
D. Rosenkrantz: Matrix equations and normal forms for context-free grammars. J. Assoc. Comput. Mach. 14(3) (July 1967), 501–507.
R. Ross, G. Hotz, D. Benson: A general Greibach normal form transformation. Technical Report CS-78-048, Department of Computer Science, Washington State University, Pullman, Washington, 99164, U. S. A., 1978.
A. Salomaa, M. Soittola: Automata-Theoretic Aspects of Formal Power Series. Springer-Verlag, Berlin, Heidelberg, New York, 1978.
D. Wood: Grammar and L forms: an introduction. Lecture Notes in Computer Science 91. Springer-Verlag, 1980.
D. Wood: A draft of chapter 4, Context-Free Grammars, from Theory of Computation, second edition. July 1996. Generously provided by the author.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, C.L. (1998). Towards a meta-normal form algorithm for context-free grammars. In: Wood, D., Yu, S. (eds) Automata Implementation. WIA 1997. Lecture Notes in Computer Science, vol 1436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031387
Download citation
DOI: https://doi.org/10.1007/BFb0031387
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64694-5
Online ISBN: 978-3-540-69104-4
eBook Packages: Springer Book Archive