In the literature various proofs of the inclusion of the class of LL(k) grammars into the class of LR(k) grammars can be found. Some of these proofs are not correct, others are informal, semi-formal or contain flaws. Some of them are correct but the proof is less straightforward than demonstrated here
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...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
Culik II and Cogen introduced the class of LR-regular grammars, an extension of the LR(k) grammars. ...
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...
AbstractSeveral definitions of the LR(k) grammars can be found in the literature. Since the left-cor...
Several definitions of the LR(k) grammars can be found in the literature. Since the left-corner gram...
AbstractThe paper studies the family of LLP(k) grammars introduced by Lomet. Two new grammatical cha...
AbstractThe structure of derivation trees over an LL(k) grammar is explored and a property of these ...
It will be shown that the equivalence problem for LL-regular grammars is decidable. Apart from exten...
The theory of LL(k) parsing of context-free grammars is developed as a dual of the theory of LR(k) p...
AbstractMany different definitions for LR(k) grammars exist in the literature. One of these definiti...
AbstractSeveral definitions of the LR(k) grammars can be found in the literature. Since the left-cor...
AbstractWe deal with the problem of testing equivalence of two LL(k) grammars. The problem had been ...
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...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
Culik II and Cogen introduced the class of LR-regular grammars, an extension of the LR(k) grammars. ...
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...
AbstractSeveral definitions of the LR(k) grammars can be found in the literature. Since the left-cor...
Several definitions of the LR(k) grammars can be found in the literature. Since the left-corner gram...
AbstractThe paper studies the family of LLP(k) grammars introduced by Lomet. Two new grammatical cha...
AbstractThe structure of derivation trees over an LL(k) grammar is explored and a property of these ...
It will be shown that the equivalence problem for LL-regular grammars is decidable. Apart from exten...
The theory of LL(k) parsing of context-free grammars is developed as a dual of the theory of LR(k) p...
AbstractMany different definitions for LR(k) grammars exist in the literature. One of these definiti...
AbstractSeveral definitions of the LR(k) grammars can be found in the literature. Since the left-cor...
AbstractWe deal with the problem of testing equivalence of two LL(k) grammars. The problem had been ...
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...
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper ...
DOI
Add to ORKG