Attention is paid to structure preserving properties of transformations from a non-leftrecursive context-free grammar to a Greibach normal form grammar. It is demonstrated that such a transformation cannot only be ambiguity preserving, but also both cover and functor relations between grammars or their associated syntax-categories can be obtained from such a transformation
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...
Attention is paid to structure preserving properties of transformations from a non-leftrecursive con...
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...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
AbstractA method is presented for the elimination of null productions from a context-free grammar in...
This monograph develops a theory of grammatical covers, normal forms and parsing. Covers, formally d...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
AbstractTwo new proofs of the fact that proper left-recursive grammars can be covered by non-left-re...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
A transformation is defined which is a modification of a classic transformation on context-free gram...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...
Attention is paid to structure preserving properties of transformations from a non-leftrecursive con...
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...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
AbstractA method is presented for the elimination of null productions from a context-free grammar in...
This monograph develops a theory of grammatical covers, normal forms and parsing. Covers, formally d...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
AbstractTwo new proofs of the fact that proper left-recursive grammars can be covered by non-left-re...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
A transformation is defined which is a modification of a classic transformation on context-free gram...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...