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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
A parser called the embedded left LR(k) parser is defined. It is capable of (a) producing the prefix of the left parse of the… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We present a data-driven variant of the LR algorithm for dependency parsing, and extend it with a best-first search for… (More)
  • table 1
  • table 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular… (More)
  • table 1
Is this relevant?
2003
2003
This paper describes a purely functional implementation of LR parsing. We formally derive our parsers in a series of steps… (More)
  • figure 6
  • figure 9
  • figure 13
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The Generalized LR (GLR) parsing algorithm is attractive for use in parsing programming languages because it is asymptotically… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
1994
1994
1 INTRODUCTION This paper discusses the design of an LR parser for a speciic high-coverage English grammar. The design principles… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We describe work toward the construction of a very wide-coverage probabilistic parsing system for natural language (NL), based on… (More)
  • figure 1
  • figure 2
  • figure 6
  • table 1
  • table 2
Is this relevant?
1991
1991
Tomita's algorithm, also called the Generalized LR (GLR) parser, is a method for natural language parsing that extends standard… (More)
Is this relevant?
1983
1983
This paper describes the implementation of an extension to Celentano's [2] incremental LR Parsing Algorithm that allows epsilon… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1974
1974
The LR syntax analysis method is a useful and versatile technique for parsing deterministic context-free languages in compiling… (More)
Is this relevant?