AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greibach normal form (GNF). This procedure yields the same grammar as the well-known procedure of Rosenkrantz, but is based on pure derivation-oriented reasoning and not on systems of equations
For each alphabet $\Sigma_n=\{a_1,a_2,\ldots,a_n\}$, linearly ordered by $a_1<a_2<\cdots<a_n$, let $...
This document deals with optimalization and reduction of number of new nonterminals and their rules,...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
AbstractWe develop a new method for placing a given context-free grammar into Greibach normal form w...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
AbstractWe consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach ...
Attention is paid to structure preserving properties of transformations from a non-leftrecursive con...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...
We consider context-free grammars $G_n$ in Greibach normal form and, particularly, in Greibach $m$-f...
For each alphabet $\Sigma_n=\{a_1,a_2,\ldots,a_n\}$, linearly ordered by $a_1<a_2<\cdots<a_n$, let $...
This document deals with optimalization and reduction of number of new nonterminals and their rules,...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
AbstractIn this note we present a procedure to rewrite a given Chomsky normal form grammar in Greiba...
AbstractWe present an algorithm which, given an arbitrary ε-free and chain-free context-free grammar...
We present an algorithm which given an arbitrary A-free context-free grammar produces an equivalent ...
We develop a new method for placing a given context-free grammar into Greibach normal form with onl...
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that...
AbstractWe develop a new method for placing a given context-free grammar into Greibach normal form w...
AbstractEvery context-free grammar can be transformed into one in double Greibach operator form, tha...
AbstractVarious types of grammars can be used to describe context-free languages. Such are context-f...
AbstractWe consider context-free grammars Gn in Greibach normal form and, particularly, in Greibach ...
Attention is paid to structure preserving properties of transformations from a non-leftrecursive con...
Context-free grammar transformations have been explored over the past 30 years or so - before the bi...
We consider context-free grammars $G_n$ in Greibach normal form and, particularly, in Greibach $m$-f...
For each alphabet $\Sigma_n=\{a_1,a_2,\ldots,a_n\}$, linearly ordered by $a_1<a_2<\cdots<a_n$, let $...
This document deals with optimalization and reduction of number of new nonterminals and their rules,...
We give inequational and equational axioms for semirings with a fixed-point operator and formally de...
DOI
Add to ORKG