A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
The equivalence problem for LL- and LR-regular grammars
[chapter]
1981
Lecture Notes in Computer Science
Preserved Fulltext
That is, we have the followingproposition: PROPOSITION 2.~ The equivalence problem for LR-regular grammars is decidable if and only if the equivalence problem for LR(O) grammars is decidable. 3. ...
If we were able to obtain from LL(~) grammar G an LL(1) grammar G', with L(G') = L(G ) then we should have reduced the equivalence problem for LL-regular grammars to the equivalence problem for LL(1) grammars ...
doi:10.1007/3-540-10854-8_32
fatcat:m6seti7gmzhvbmgt64iaofqntm
The equivalence problem for LL- and LR-regular grammars
1982
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our techniques can also be used to show that the equivalence problem for LR-regular grammars is decidable if and only if the equivalence problem for U?(O) grammars is decidable. ...
In this paper it is shown that the equivalence problem for U-regular grammars is decidable by reducing it to the equivalence problem for real-time strict deterministic grammars. ...
The equivalence problem for LR-regular grammars is decidable f and only if the equivalence problem for LR(0) grammars is decidable. ...
doi:10.1016/0022-0000(82)90044-7
fatcat:wh2ic6wcofel5ohovcdwno6cue
Tests for the LR-, LL-, and LC-regular conditions
1983
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The method can be applied to U-regular and K-regular parsing too. It yields tests and inclusion theorems for the various classes of grammars considered. ...
The original test for the U-regular property is not quite correct. Generalizing the item method which is well known from U(k) theory a decidable criterion and a parsing algorithm are obtained. ...
Culik and Cohen applied this idea to LR parsing and obtained the class of LR-regular grammars. Later, the idea was applied to strong LL parsing [7] and to LL parsing [8] . ...
doi:10.1016/0022-0000(83)90026-0
fatcat:retbdczjuva7rjj66uy6fkqfoi
A complexity theory of grammar problems
1976
Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages - POPL '76
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Thus
for example,
letting r denote the class
of strong LL, LL,
strong
LC,
LC,
SLR,
LALR,
LR,
LR regular,
or unambiguous
cfgs, a class
T of
grammatical
transformations,
and
an
arbitrary ...
these
conditions
include the classes
of strong
LL,
LL,
strong
LC,
LC,
SLR,
LALR, LR, and BRC
grammars. ...
doi:10.1145/800168.811536
dblp:conf/popl/Hunt76
fatcat:onk6fpwziraxnnek4k3bt5w6zu
Parsing strategies: A concise survey
[chapter]
1981
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The equivalence problems for LL(k) and real-time strict deterministic grammars with look-ahead are decidable (cf. Nijholt/44/). ...
about the equivalence problems for these classes of languages. ...
be generalized by using semantic information or by using "regular" instead of finite look-ahead. ...
doi:10.1007/3-540-10856-4_77
fatcat:ksjybm4s6ragbiltdvgzpcmrry
Page 3794 of Mathematical Reviews Vol. , Issue 84i
[page]
1984
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Since any LL(k)
grammar is an LL-regular grammar the results which are obtained are
valid for LL(k) grammars as well. ...
The relation between LL-regular and LL(1) grammars is expressed by means of a generalized version
of the well-known cover relation between two context-free grammars.” ...
Page 3420 of Mathematical Reviews Vol. , Issue 83h
[page]
1983
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Sh. _ 83h:68131 The equivalence problem for an extension of LL( k )-grammars. Programmirovanie 1981, no. 5, 3-10, 95 ( Russian); translated as Programming and Comput. ...
Author’s summary: “The solvability of the equivalence problem is
proved for grammars of the classes P* that are defined by combining
m LL(k)-grammars with constraints on derivations. ...
Using JFLAP to interact with theorems in automata theory
1999
The proceedings of the thirtieth SIGCSE technical symposium on Computer science education - SIGCSE '99
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In addition, our enhancements combined with other tools allow one to interactively study LL and LR parsing methods. ...
JFLAP is a tool for designing and running nondeterministic versions of finite automata, pushdown automata, and Turing machines. ...
Acknowledgement JFLAP is a project that began in 1990 as NPDA and later FLAP and would not be possible without the work of many students including Dan Caugherty, Mark Losacco, Madga Procopiuc, and Tavi ...
doi:10.1145/299649.299800
dblp:conf/sigcse/GramondR99
fatcat:mu24d42pijcgles7x7xihuxa34
Using JFLAP to interact with theorems in automata theory
1999
ACM SIGCSE Bulletin
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In addition, our enhancements combined with other tools allow one to interactively study LL and LR parsing methods. ...
JFLAP is a tool for designing and running nondeterministic versions of finite automata, pushdown automata, and Turing machines. ...
Acknowledgement JFLAP is a project that began in 1990 as NPDA and later FLAP and would not be possible without the work of many students including Dan Caugherty, Mark Losacco, Madga Procopiuc, and Tavi ...
doi:10.1145/384266.299800
fatcat:n4wvy5ohgzb5zjmebzyfhzqa74
Page 3876 of Mathematical Reviews Vol. , Issue 83i
[page]
1983
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Nijholt, Anton 831:68114 The equivalence problem for LL- and LR-regular grammars. J. Comput. System Sci. 24 (1982), no. 2, 149-161. ...
Moreover, he gives the result that the equivalence problem for LR-regular grammars is decidable if and only if the equivalence problem for LR(O) grammars is decidable. ...
Page 3209 of Mathematical Reviews Vol. , Issue 98E
[page]
1998
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Previous approaches have been limited to single LR grammar classes: LR(k) and LALR(k), for example. ...
We introduce two versions of such extensions and determine the oracle languages L for which both approaches are equivalent. ...
On the complexities of linear LL(1) and LR(1) grammars
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Deterministic linear languages turn out to be special cases of languages generated by linear grammars restricted to LL(1) conditions, which have a membership problem solvable in N C 1 . ...
Moreover, they coincide with languages generated by linear grammars subject to LR(1) conditions. ...
Conclusions We introduced the notion of a deterministic linear language via LR(1) restrictions of linear grammars. The adequacy of this concept is re ected by its equivalence with DPDA 1-turn . ...
doi:10.1007/3-540-57163-9_25
fatcat:wuacgcrb2veq5ablq4zy74he2a
Page 2885 of Mathematical Reviews Vol. , Issue 84g
[page]
1984
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
In doing so he exhibits some non-LR-regular and non-LL-regular languages with the help of iteration theorems for LL- and LR-regular grammars. ...
The author demonstrates the power of the metatheorem by giving simple proofs for some well-known results and by deriving new results relating LR-regular, LL-regular, LR(k) and LL(k) grammars and languages ...
Page 4080 of Mathematical Reviews Vol. , Issue 80J
[page]
1980
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
the LL(k) and LR(k) properties of grammars. ...
It is shown that for any LL(p)-grammar from C, U C, there exists a natural number k determined by p such that the equivalence prob- lem of LL(p)-grammar can be reduced to the equivalence problem of LL( ...
Page 1592 of Mathematical Reviews Vol. , Issue 84d
[page]
1984
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
DeRemer’s and Pager’s parsing methods turn out to be special cases. LL and LC tests, as well as inclusion theorems for the classes of LL, LC, and LR grammars are also based on parsing automata.” ...
The classes of languages
representable by these kinds of automata are characterized in terms of
Turing machines. The equivalence problem for such machines is
considered. ...
« Previous
Showing results 1 — 15 out of 1,056 results