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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
We combine LR(k)-parsing technology and data-flow analysis to analyze, in advance of execution, the documents generated… 
Highly Cited
2006
Highly Cited
2006
By introducing periodic thickness modulation of thin metal stripes embedded in a dielectric, compact and efficient Bragg gratings… 
Highly Cited
2006
Highly Cited
2006
The authors report on the imaging of surface plasmon polaritons (SPPs) by leakage radiation microscopy in both direct and Fourier… 
Highly Cited
2003
Highly Cited
2003
Described methods for simultaneously generating the super-resolved depth map and the image from LR observations. Structural… 
Highly Cited
1997
Highly Cited
1997
The rapid destruction of microcystin, a cyanobacterial toxin, using a titanium dioxide photocatalyst is observed; the process is… 
Highly Cited
1996
Highly Cited
1996
A 0-1 integer programming model is considered to determine the most appropriate dynamic location registration (LR) area of each… 
Review
1992
Review
1992
Tomita's algorithm, also called the Generalized LR (GLR) parser, is a method for natural language parsing that extends standard… 
1990
1990
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
For a context-free grammar <italic>G</italic>, a construction is given to produce an LR parser that recognizes any substring of… 
1980
1980
Methods are described which make it possible, when given an arbitrary attribute grammar (or AG), 1. to analyze the AG to…