A generalised normal form theorem for context-free grammars
Reads0
Chats0
About:
This article is published in The Computer Journal.The article was published on 1970-01-01 and is currently open access. It has received 8 citations till now. The article focuses on the topics: Context-sensitive grammar & Indexed grammar.read more
Citations
More filters
Book
Context-Free Grammars: Covers, Normal Forms, and Parsing
TL;DR: This monograph develops a theory of grammatical covers, normal forms and parsing by introducing algorithms that describe a transformation of an input grammar into an output grammar which satisfies the requirements.
Journal ArticleDOI
Some remarks on the KH algorithm fors-grammars
TL;DR: Two alternative versions of the equivalence algorithm of Korenjak and Hopcroft (KH) fors-grammars, the KHC and KHS algorithms are presented, the first answers a question posed by Hopcroft and the second is formally and practically a faster algorithm.
Book ChapterDOI
Structure Preserving Transformations on Non-Left-Recursive Grammars (Preliminary Version)
TL;DR: In this paper, a general framework for covers is presented, and a transformation from non-left-recursive grammars to Greibach normal forms is introduced, which serves as an illustration of the structure preserving properties of this transformation.
Book ChapterDOI
Grammatical Inference in the Discovery of Generating Functions
TL;DR: An algorithm for the induction of a context-free grammar is proposed, and its application in obtaining a generating function for the number of certain combinatorial objects is demonstrated.