AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, that satisfies both double Greibach form and operator form. Examination of the expressive power of various well-known subclasses of context-free grammars in double Greibach and/or operator form yields an extended hierarchy of language classes. Basic decision properties such as equivalence can be stated in stronger forms via new classes of languages in this hierarchy
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
AbstractThis paper deals with the question of canonical types for grammar forms and grammars. A gram...
Rounds has defined the class of context-free tree languages and proved its closure properties under ...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
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...
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...
AbstractWe develop a new method for placing a given context-free grammar into Greibach normal form w...
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...
This document deals with optimalization and reduction of number of new nonterminals and their rules,...
AbstractThis paper begins a systematic investigation of context-free grammar forms using the mechani...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
AbstractThis paper deals with the question of canonical types for grammar forms and grammars. A gram...
Rounds has defined the class of context-free tree languages and proved its closure properties under ...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
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...
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...
AbstractWe develop a new method for placing a given context-free grammar into Greibach normal form w...
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...
This document deals with optimalization and reduction of number of new nonterminals and their rules,...
AbstractThis paper begins a systematic investigation of context-free grammar forms using the mechani...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
AbstractThis paper deals with the question of canonical types for grammar forms and grammars. A gram...
Rounds has defined the class of context-free tree languages and proved its closure properties under ...