Skip to search formSkip to main contentSkip to account menu

LR parser

Known as: LR(k), Shift-reduce conflict, LR(1) grammar 
In computer science, LR parsers are a type of bottom-up parsers that efficiently handle deterministic context-free languages in guaranteed linear… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
ASF+SDF Meta-EnvironmentAlphabet (formal languages)Ambiguous grammarBacktracking

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
An MRAS Observer for Sensorless DFIM Drives With Direct Estimation of the Torque and Flux Rotor Current Components
This paper proposes a model reference adjustable system observer for the sensorless control of doubly fed induction machines. The… 
Highly Cited
2006
Highly Cited
2006
Compact Bragg gratings for long-range surface plasmon polaritons
By introducing periodic thickness modulation of thin metal stripes embedded in a dielectric, compact and efficient Bragg gratings… 
Highly Cited
2006
Highly Cited
2006
How to erase surface plasmon fringes
The authors report on the imaging of surface plasmon polaritons (SPPs) by leakage radiation microscopy in both direct and Fourier… 
2004
2004
Derivation of Deterministic Inverse Programs Based on LR Parsing
We present a method for automatic program inversion of functional programs based on methods of LR parsing. We formalize the… 
Highly Cited
2003
Highly Cited
2003
Multi-objective super resolution: concepts and examples
Described methods for simultaneously generating the super-resolved depth map and the image from LR observations. Structural… 
Review
1992
Review
1992
Book Reviews: Generalized LR Parsing
Tomita's algorithm, also called the Generalized LR (GLR) parser, is a method for natural language parsing that extends standard… 
1990
1990
DR parsers: a generalization of LR parsers
A method is presented to construct a parser for a visual language whose specification can be done by a context-free grammar. The… 
1989
1989
An LR substring parser for noncorrecting syntax error recovery
For a context-free grammar <italic>G</italic>, a construction is given to produce an LR parser that recognizes any substring of… 
Highly Cited
1983
Highly Cited
1983
Planning Routes Through Uncertain Territory
1980
1980
Attribute-influenced LR parsing
Methods are described which make it possible, when given an arbitrary attribute grammar (or AG), 1. to analyze the AG to… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)