Skip to search formSkip to main contentSkip to account menu

LALR parser

Known as: Look-Ahead left-to-right, Lookahead LR parser, Look-ahead LR parser 
In computer science, an LALR parser or Look-Ahead LR parser is a simplified version of a canonical LR parser, to parse (separate and analyze) a text… 
Wikipedia (opens in a new tab)

Related topics

Related topics

35 relations
Adaptive grammarAmbiguous grammarBacktrackingBottom-up parsing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
2009
2009
Security of Linguistic Threshold Schemes in Multimedia Systems
This publication will present a new approach how to extend well-known algorithms of secret sharing, towards another stage of… 
2006
2006
Noncanonical LALR(1) Parsing
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing… 
1998
1998
Very fast YACC‐compatible parsers (for very little effort)
We have developed a yacc‐compatible parser generator that creates parsers that are 2.0 to 6.0 times faster than those generated… 
1997
1997
A New Formalization of Probabilistic GLR Parsing
This paper presents a new formalization of probabilistic GLR language modeling for statistical parsing. Our model inherits its… 
1991
1991
Almost Boolean algebraic computation of LALR (1) look-ahead sets
1990
1990
Lalr - A Generator for Efficient Parsers
1 SUMMARY Lalr is a parser generator that generates very fast and powerful parsers. The design goals have been to generate… 
1986
1986
Unifying view of recent LALR(1) lookahead set algorithms
Since the introduction of LALR parsing, several algorithms have been presented for the computation of the lookahead sets needed… 
1984
1984
LALR(1, 1) parser generation for regular right part grammars
SummaryCommonly used extensions to BNF can be modelled by the formalism of regular right part grammars. A method for building LR… 
1974
1974
The size of LALR (1) parsers
Simple statistical formulas are given for the size of an LALR(1) parser. For practical grammars the number of states of an LALR(1… 
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)