An overview is given of cover results for normal forms of context-free grammars. The emphasis in this paper is on the possibility of constructing ɛ-free grammars, non-left-recursive grammars and grammars in Greibach normal form. Among others it is proved that any ɛ-free context-free grammar can be right covered with a context-free grammar in Greibach normal form. All the cover results concerning the ɛ-free grammars, the non-left-recursive grammars and the grammars in Greibach normal form are listed, with respect to several types of covers, in a cover-table
Abstract:- In this paper we survey several aspects related to normal forms of hyperedge replacement ...
In this report we show that some prevailing ideas on the elimination of left recursion in a context-...
We investigate the complexity of a variety of normal-form transformations for extended context-free ...
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...
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...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
Abstract. We describe the formalisation of the Chomsky and Greibach normal forms for context-free gr...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
AbstractWe develop a new method for placing a given context-free grammar into Greibach normal form w...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
Abstract:- In this paper we survey several aspects related to normal forms of hyperedge replacement ...
In this report we show that some prevailing ideas on the elimination of left recursion in a context-...
We investigate the complexity of a variety of normal-form transformations for extended context-free ...
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...
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...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
Abstract. We describe the formalisation of the Chomsky and Greibach normal forms for context-free gr...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
AbstractWe develop a new method for placing a given context-free grammar into Greibach normal form w...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
Abstract:- In this paper we survey several aspects related to normal forms of hyperedge replacement ...
In this report we show that some prevailing ideas on the elimination of left recursion in a context-...
We investigate the complexity of a variety of normal-form transformations for extended context-free ...