Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,397,760 papers from all fields of science
Search
Sign In
Create Free Account
LALR parser
Known as:
Look-Ahead left-to-right
, Lookahead LR parser
, Look-ahead LR parser
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
35 relations
Adaptive grammar
Ambiguous grammar
Backtracking
Bottom-up parsing
Expand
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
J. Denny
,
B. Malloy
Science of Computer Programming
2010
Corpus ID: 29806359
2009
2009
Security of Linguistic Threshold Schemes in Multimedia Systems
M. Ogiela
,
Urszula Ogiela
KES IIMSS
2009
Corpus ID: 3416022
This publication will present a new approach how to extend well-known algorithms of secret sharing, towards another stage of…
Expand
2006
2006
Noncanonical LALR(1) Parsing
S. Schmitz
International Conference on Developments in…
2006
Corpus ID: 5569799
This paper addresses the longstanding problem of the recognition limitations of classical LALR(1) parser generators by proposing…
Expand
2001
2001
Yet another generation of LALR parsers for regular right part grammars
Shin-ichi Morimoto
,
Masataka Sassa
Acta Informatica
2001
Corpus ID: 16404610
Abstract. In this paper we introduce two methods for building LALR parsers for regular right part grammars (RRPGs). Both methods…
Expand
1998
1998
Very fast YACC‐compatible parsers (for very little effort)
Achyutram Bhamidipaty
,
Todd A. Proebsting
Software, Practice & Experience
1998
Corpus ID: 5973919
We have developed a yacc‐compatible parser generator that creates parsers that are 2.0 to 6.0 times faster than those generated…
Expand
1997
1997
A New Formalization of Probabilistic GLR Parsing
Kentaro Inui
,
Virach Sornlertlamvanich
,
Hozumi Tanaka
,
T. Tokunaga
International Workshop/Conference on Parsing…
1997
Corpus ID: 10918665
This paper presents a new formalization of probabilistic GLR language modeling for statistical parsing. Our model inherits its…
Expand
1992
1992
Probabilistic Normalisation and Unpacking of Packed Parse Forests for Unification-based Grammars
John A. Carroll
,
Ted Briscoe
1992
Corpus ID: 1816604
The research described below forms part of a wider programme to develop a practical parser for naturally-occurring natural…
Expand
1990
1990
Lalr - A Generator for Efficient Parsers
Josef Grosch
Software, Practice & Experience
1990
Corpus ID: 9210575
1 SUMMARY Lalr is a parser generator that generates very fast and powerful parsers. The design goals have been to generate…
Expand
1984
1984
LALR(1, 1) parser generation for regular right part grammars
N. Chapman
Acta Informatica
1984
Corpus ID: 20111763
SummaryCommonly used extensions to BNF can be modelled by the formalism of regular right part grammars. A method for building LR…
Expand
1981
1981
Extending Lookahead for LR Parsers
T. Baker
Journal of computer and system sciences (Print)
1981
Corpus ID: 205007998
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)
ACCEPT & CONTINUE