1081 search results - page 1 / 217 » Working with the LR Degrees |
64
Voted
TAMC
2007
Springer
15 years 4 months ago
2007
Springer
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on ...
80
Voted
JSYML
2008
14 years 10 months ago
2008
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
71
Voted
CC
1999
Springer
15 years 2 months ago
1999
Springer
Tomita devised a method of generalized LR GLR parsing to parse ambiguous grammars e ciently. A GLR parser uses linear-time LR parsing techniques as long as possible, falling back...
122
Voted
SAC
2008
ACM
14 years 9 months ago
2008
ACM
There has been a recent effort in the literature to reconsider grammar-dependent software development from an engineering point of view. As part of that effort, we examine a defic...
107
Voted
IJFCS
2006
14 years 10 months ago
2006
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...