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.
2014
2014
The sandy sediments that blanket the inner shelf are situated in a zone where nutrient input from land and strong mixing produce… 
2006
2006
The IEEE 802.15.4 Low-Rate Wireless Personal Area Network (LR-WPAN) [1] working group defines physical layer (PHY) and medium… 
2005
2005
We report error-free transmission at 10 Gbit/s over a 110 km, amplified PON using XFP and 300-pin MSA transceivers, super FEC and… 
2004
2004
Carbon/gold composite nanotubes as well as gold nanorods were synthesized by the impregnation of porous alumina with diluted… 
2001
2001
N Jimenez-Redondo comments on the paper by C.P. Cheng et al. (see ibid, vol.15, no.2, p.707-14, 2000). The original authors reply… 
1998
1998
Two-body charmless nonleptonic decays of the Bs meson are studied within the framework of generalized factorization in which… 
Review
1992
Review
1992
Tomita's algorithm, also called the Generalized LR (GLR) parser, is a method for natural language parsing that extends standard… 
1976
1976
A procedure is described for augmenting a Simple LR(k) parser with new states which enable the extended parser to continue… 
Review
1974
Review
1974
Recent work [AJU, E1, E2] has shown that substantial improvements in both the size and the running time of a bottom-up parser…