AbstractA method is presented for the elimination of null productions from a context-free grammar in such a way that the resulting grammar covers the original one, that is, the languages generated are the same and parses in the original grammar are homomorphic images of equivalent parses in the covering grammar. We show that in a natural subclass of covers, called the class of compatible covers, the method is best possible in the sense that a compatible cover with no null productions can be produced by the method if and only if such a cover exists. The use of the method in transformations for obtaining a cover in Greibach normal form is finally analyzed
The notion of a parsable grammar is introduced. A definition of cover is provided which is a general...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around ...
This monograph develops a theory of grammatical covers, normal forms and parsing. Covers, formally d...
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...
AbstractLanguage equivalence, grammatical covering and structural equivalence are all notions of sim...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
A transformation is defined which is a modification of a classic transformation on context-free gram...
The notion of a parsable grammar is introduced. A definition of cover is provided which is a general...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
AbstractTwo new proofs of the fact that proper left-recursive grammars can be covered by non-left-re...
The notion of a parsable grammar is introduced. A definition of cover is provided which is a general...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around ...
This monograph develops a theory of grammatical covers, normal forms and parsing. Covers, formally d...
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...
AbstractLanguage equivalence, grammatical covering and structural equivalence are all notions of sim...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
A transformation is defined which is a modification of a classic transformation on context-free gram...
The notion of a parsable grammar is introduced. A definition of cover is provided which is a general...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
AbstractTwo new proofs of the fact that proper left-recursive grammars can be covered by non-left-re...
The notion of a parsable grammar is introduced. A definition of cover is provided which is a general...
We investigate context-free grammars the rules of which can be used in a productive and in a reducti...
AbstractA bracketed grammar is a context-free grammar in which indexed brackets are inserted around ...