Results 51 to 60 of about 1,597 (177)
, 1994 this paper we present an incremental LR parsing technique. The technique is applicable to all grammars in the LR, SLR, and LALR families. We present the technique in terms of the LR(1) grammars in this paper.
Wuu Yang
core
Advanced Science, Volume 13, Issue 36, 29 June 2026.We propose the Full‐Body AI Agent, a multi‐scale collaborative framework with 7 biological‐layer agents. It unifies multi‐omics/clinical data via standardized protocols, enabling phenotype‐guided closed‐loop reasoning, quantitative evaluation, and LLM safeguards, with promising applications in tumor metastasis modeling and precision drug development ...
Aoqi Wang +11 more
wiley +1 more source
Unifying LL and LR parsing [PDF]
In parsing theory, LL parsing and LR parsing are regarded to be two distinct methods. In this paper the relation between these methods is clarified. As shown in literature on parsing theory, for every context-free grammar, a so-called non-deterministic ...
Pijls, Wim
core
Advanced Intelligent Systems, Volume 8, Issue 6, June 2026.This paper presents a high‐speed object pose estimation method that deconstructs objects into geometric components. Inspired by human cognitive generalization, it detects these primitives and infers the 6D pose from their stable spatial configuration.
Xuyang Li +6 more
wiley +1 more source
LR Parsing of Permutation Phrases [PDF]
CoRRThis paper presents an efficient method for LR parsing of permutation phrases. In practical cases, the proposed algorithm constructs an LR(0) automaton that requires significantly fewer states to process a permutation phrase compared to the standard construction. For most real-world grammars, the number of states is typically reduced from $Ω(n!)$ to $O(
openaire +2 more sources
Solving difficult LR parsing conflicts by postponing them [PDF]
, 2011 Though yacc-like LR parser generators provide ways to solve shift-reduce conflicts using token precedences, no mechanisms are provided for the resolution of difficult shift-reduce or reduce-reduce conflicts.
L. Garcia-Forte, C. Rodriguez-Leon
core +1 more source
Practical arbitrary lookahead LR parsing
Journal of Computer and System Sciences, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
University of Florida, Gainesville, Florida 32611, USA ( host institution ) +2 more
openaire +2 more sources
A Backtracking LR Algorithm for Parsing Ambiguous Context-Dependent Languages [PDF]
, 2006 Parsing context-dependent computer languages requires an ability to maintain and query data structures while parsing for the purpose of influencing the parse.
James R. Cordy, Adrian D. Thurston
core +1 more source
Noncanonical Extensions of LR Parsing Methods [PDF]
, 2007 Bottom up LR-parsing is the most powerful, practical method of linear time parsing known. Various attempts have been made to enhance the power and flexibility of the LR method, without losing the property of linear time parsing, or introducing ...
Michael Hutton
core
Some observations on LR-like parsing with delayed reduction [PDF]
, 2007 We discuss a bottom-up parsing technique based on delayed reductions, and investigate its capabilities and limitations. Some non LR(k) grammars, for any k, are handled deterministically by this method.
Nederhof, M.-J., Bertsch, E.
core +1 more source