Add to ORKGThis document deals with optimalization and reduction of number of new nonterminals and their rules, which are produced during several types of transformation fro
An overview is given of cover results for normal forms of context-free grammars. The emphasis in thi...
For each alphabet $\Sigma_n=\{a_1,a_2,\ldots,a_n\}$, linearly ordered by $a_1<a_2<\cdots<a_n$, let $...
We investigate the complexity of a variety of normal-form transformations for extended context-free ...
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...
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...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
Abstract:- In this paper we survey several aspects related to normal forms of hyperedge replacement ...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
A new method is presented to transform non-left-recursive grammars to grammars in Greibach normal fo...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
AbstractWe consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach ...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
An overview is given of cover results for normal forms of context-free grammars. The emphasis in thi...
For each alphabet $\Sigma_n=\{a_1,a_2,\ldots,a_n\}$, linearly ordered by $a_1<a_2<\cdots<a_n$, let $...
We investigate the complexity of a variety of normal-form transformations for extended context-free ...
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...
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...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
Abstract:- In this paper we survey several aspects related to normal forms of hyperedge replacement ...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
A new method is presented to transform non-left-recursive grammars to grammars in Greibach normal fo...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
AbstractWe consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach ...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
An overview is given of cover results for normal forms of context-free grammars. The emphasis in thi...
For each alphabet $\Sigma_n=\{a_1,a_2,\ldots,a_n\}$, linearly ordered by $a_1<a_2<\cdots<a_n$, let $...
We investigate the complexity of a variety of normal-form transformations for extended context-free ...