AbstractSeveral definitions of the LR(k) grammars can be found in the literature. Since the left-corner grammars can be defined as a restricted class of LR(k) grammars, there are also several definitions are not equivalent. A characterization of the LC(0) languages is given in terms of the simple deterministic languages and these classes of languages are compared with other classes of languages, such as the LL(1) languages and the LR(0) languages
A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there e...
Several notions of deterministic linear languages are considered and compared with respect to their ...
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: a...
Several definitions of the LR(k) grammars can be found in the literature. Since the left-corner gram...
AbstractSeveral definitions of the LR(k) grammars can be found in the literature. Since the left-cor...
AbstractThe paper studies the family of LLP(k) grammars introduced by Lomet. Two new grammatical cha...
AbstractMany different definitions for LR(k) grammars exist in the literature. One of these definiti...
In the literature various proofs of the inclusion of the class of LL(k) grammars into the class of L...
In this paper we introduce the class of so called Ch(k) grammars [pronounced "chain k grammars"]. Th...
From the point of view of parsing the LL(K] grammars constitute a very attractive class of context-f...
Culik II and Cogen introduced the class of LR-regular grammars, an extension of the LR(k) grammars. ...
A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there e...
AbstractA subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although...
AbstractThe structure of derivation trees over an LL(k) grammar is explored and a property of these ...
In the past years there have been many attempts to fill in the gap between the classes of LL(k) and ...
A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there e...
Several notions of deterministic linear languages are considered and compared with respect to their ...
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: a...
Several definitions of the LR(k) grammars can be found in the literature. Since the left-corner gram...
AbstractSeveral definitions of the LR(k) grammars can be found in the literature. Since the left-cor...
AbstractThe paper studies the family of LLP(k) grammars introduced by Lomet. Two new grammatical cha...
AbstractMany different definitions for LR(k) grammars exist in the literature. One of these definiti...
In the literature various proofs of the inclusion of the class of LL(k) grammars into the class of L...
In this paper we introduce the class of so called Ch(k) grammars [pronounced "chain k grammars"]. Th...
From the point of view of parsing the LL(K] grammars constitute a very attractive class of context-f...
Culik II and Cogen introduced the class of LR-regular grammars, an extension of the LR(k) grammars. ...
A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there e...
AbstractA subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although...
AbstractThe structure of derivation trees over an LL(k) grammar is explored and a property of these ...
In the past years there have been many attempts to fill in the gap between the classes of LL(k) and ...
A subclass of the LR(0)-grammars, the class of simple chain grammars is introduced. Although there e...
Several notions of deterministic linear languages are considered and compared with respect to their ...
LR-regular grammars are defined similarly to Knuth's LR(k) grammars, with the following exception: a...
DOI
Add to ORKG