If G is a grammar such that in each non-context-free rule of G, the right side contains a string of terminals longer than any terminal string appearing between two nonterminals in the left side, then the language generated by G is context free. Six previous results follow as corollaries of this theorem
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one p...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
The concept of SVMT-bounded grammars is introduced. It is shown that SVMT-bounded grammars generate ...
A context free grammar G = (V,Σ, P, S) is a four tuple where 1. V is a set of non-terminal character...
A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a s...
The concept of SVMT-bounded grammars is introduced. It is shown that SVMT-bounded grammars generate ...
This paper connects between notions of pure formal language theory and nondeterministic programming....
AbstractContext-free grammars are widely used for the simple form of their rules. A derivation step ...
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 ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one p...
If G is a grammar such that in each non-context-free rule of G, the right side contains a string of ...
The concept of SVMT-bounded grammars is introduced. It is shown that SVMT-bounded grammars generate ...
A context free grammar G = (V,Σ, P, S) is a four tuple where 1. V is a set of non-terminal character...
A binary grammar is a relational grammar with two nonterminal alphabets, two terminal alphabets, a s...
The concept of SVMT-bounded grammars is introduced. It is shown that SVMT-bounded grammars generate ...
This paper connects between notions of pure formal language theory and nondeterministic programming....
AbstractContext-free grammars are widely used for the simple form of their rules. A derivation step ...
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 ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
Parallel context-free languages are generated by context-free grammars in which every occurrence of ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
We consider the problem of parsing non-recursive context-free grammars, i.e., context-free grammars ...
A context-free grammar is a single-tree grammar (STG) if every nonterminal symbol has at most one p...
DOI
Add to ORKG