Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that is, a context-free grammar where each right-hand side of a prorfuction begins with a terminal symbol and the remainder of the right-hand side consists of nonterminal symbols. In this short paper we show that for a left-regular grammar G we can obtain a right-regular grammar G’ (which is by definition in Greibach normal form) which left-to-right covers G (in this case left parses of G’ can be mapped by a homomorphism on right parses of G. Moreover, it is possible to obtain a context-free grammar G” in Greibach normal form which right covers the left-regular grammar G (in this case right parses of G” are mapped on right parses of G)
A transformation is defined which is a modification of a classic transformation on context-free gram...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
An overview is given of cover results for normal forms of context-free grammars. The emphasis in thi...
Attention is paid to structure preserving properties of transformations from a non-leftrecursive con...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
AbstractA method is presented for the elimination of null productions from a context-free grammar in...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
AbstractTwo new proofs of the fact that proper left-recursive grammars can be covered by non-left-re...
This monograph develops a theory of grammatical covers, normal forms and parsing. Covers, formally d...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
A transformation is defined which is a modification of a classic transformation on context-free gram...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
An overview is given of cover results for normal forms of context-free grammars. The emphasis in thi...
Attention is paid to structure preserving properties of transformations from a non-leftrecursive con...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
AbstractA method is presented for the elimination of null productions from a context-free grammar in...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
AbstractTwo new proofs of the fact that proper left-recursive grammars can be covered by non-left-re...
This monograph develops a theory of grammatical covers, normal forms and parsing. Covers, formally d...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
A transformation is defined which is a modification of a classic transformation on context-free gram...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...