Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that is, a con text-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 righ
A new method is presented to transform non-left-recursive grammars to grammars in Greibach normal fo...
AbstractWe investigate the complexity of a variety of normal-form transformations for extended conte...
This document deals with optimalization and reduction of number of new nonterminals and their rules,...
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...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
This monograph develops a theory of grammatical covers, normal forms and parsing. Covers, formally d...
AbstractWe develop a new method for placing a given context-free grammar into Greibach normal form w...
A transformation is defined which is a modification of a classic transformation on context-free gram...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
We investigate the complexity of a variety of normal-form transformations for extended context-free ...
A new method is presented to transform non-left-recursive grammars to grammars in Greibach normal fo...
AbstractWe investigate the complexity of a variety of normal-form transformations for extended conte...
This document deals with optimalization and reduction of number of new nonterminals and their rules,...
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...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
This monograph develops a theory of grammatical covers, normal forms and parsing. Covers, formally d...
AbstractWe develop a new method for placing a given context-free grammar into Greibach normal form w...
A transformation is defined which is a modification of a classic transformation on context-free gram...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
We investigate the complexity of a variety of normal-form transformations for extended context-free ...
A new method is presented to transform non-left-recursive grammars to grammars in Greibach normal fo...
AbstractWe investigate the complexity of a variety of normal-form transformations for extended conte...
This document deals with optimalization and reduction of number of new nonterminals and their rules,...