BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
LR parsing
Google LR parsing
Wikidata Q1756442
WikipediaGerman LL-Parser
WikipediaEnglish LR parser
WikipediaFrench Analyseur LR
WikipediaRussian LR-анализатор

Tag #lr

42 papers:

CoGCoG-2019-ZhangPFAJ #game studies #learning
1GBDT, LR & Deep Learning for Turn-based Strategy Game AI (LZ, HP, QF, CA, YJ), pp. 1–8.
OOPSLAOOPSLA-2019-YamazakiNIC #api #generative #syntax
Generating a fluent API with syntax checking from an LR grammar (TY, TN, KI, SC), p. 24.
CCCC-2016-Pottier #fault #parsing #reachability
Reachability and error diagnosis in LR(1) parsers (FP), pp. 88–98.
CCCC-2013-BertschNS #on the #parsing
On LR Parsing with Selective Delays (EB, MJN, SS), pp. 244–263.
ESOPESOP-2012-JourdanPL #parsing #validation
Validating LR(1) Parsers (JHJ, FP, XL), pp. 397–416.
ICALPICALP-v2-2010-Blum #on the #polynomial
On LR(k)-Parsers of Polynomial Size (NB), pp. 163–174.
SACSAC-PL-J-2008-DennyM10 #algorithm #generative #parsing
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 943–979.
ITiCSEITiCSE-2008-Garcia-OsorioGG #algorithm #education #ll #parsing
A tool for teaching LL and LR parsing algorithms (CGO, CGP, NGP), p. 317.
SACSAC-2008-DennyM #parsing
IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 240–245.
DLTDLT-2005-Okhotin #boolean grammar #parsing
LR Parsing for Boolean Grammars (AO), pp. 362–373.
FLOPSFLOPS-2004-GluckK #parsing #source code
Derivation of Deterministic Inverse Programs Based on LR Parsing (RG, MK), pp. 291–306.
LDTALDTA-2004-ThiemannN #parsing
Parameterized LR Parsing (PT, MN), pp. 115–132.
CIAACIAA-2003-Castano #parsing
LR Parsing for Global Index Languages (GILs) (JMC), pp. 269–281.
CIAAWIA-1998-Goeman #linear #on the #parsing #string
On Parsing and Condensing Substrings of LR Languages in Linear Time (HG), pp. 22–42.
PPDPPLILP-1997-JanousekM
Formal Translations Described by Translation Grammars with LR(k) Input Grammars (JJ, BM), pp. 421–422.
DLTDLT-1995-Galvez #parsing #stack
A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning (JFG), pp. 460–465.
PEPMPEPM-1995-SperberT #parsing
The Essence of LR Parsing (MS, PT), pp. 146–155.
SACSAC-1995-Hendrickson #algorithm #parallel #parsing
A new parallel LR parsing algorithm (KJH), pp. 277–281.
ICLPILPS-1994-RosenbluethP #logic programming #parsing #source code
LR Inference: Inference Systems for Fixed-Mode Logic Programs, Based on LR Parsing (DAR, JCP), pp. 439–453.
POPLPOPL-1992-BatesL #linear #string
Recognizing Substrings of LR(k) Languages in Linear Time (JB, AL), pp. 235–245.
CCCC-1992-Galvez #generative #parsing
Generating LR(1) Parsers of Small Size (JFG), pp. 16–29.
CCCC-1992-Melichar #parsing #syntax
Syntax Directed Translation with LR Parsing (BM), pp. 30–36.
CCCC-1990-Pfahler #execution #optimisation #parsing
Optimizing Directly Executable LR Parsers (PP), pp. 179–192.
PLDIPLDI-1989-Cormack #fault #parsing #string #syntax
An LR Substring Parser for Noncorrecting Syntax Error Recovery (GVC), pp. 161–169.
CCCCHSC-1988-Tarhio #compilation #evaluation #generative #parsing
A Compiler Generator for Attributive Evaluation During LR Parsing (JT), pp. 146–159.
POPLPOPL-1982-SippiS #fault #parsing
Practical Error Recovery in LR Parsing (SS, ESS), pp. 177–184.
PLDISCC-1982-MauneyF #algorithm #ll #parsing
A Forward Move Algorithm for LL and LR Parsers (JM, CNF), pp. 79–87.
CCSDCG-1980-JonesM #parsing
Attribute-influenced LR parsing (NDJ, CMM), pp. 393–407.
ICALPICALP-1979-Ukkonen #bottom-up #parsing
A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers (EU), pp. 646–658.
PLDISCC-1979-GrahamHJ #fault
Practical LR error recovery (SLG, CBH, WNJ), pp. 168–175.
POPLPOPL-1978-PennelloD #algorithm #fault
A Forward Move Algorithm for LR Error Recovery (TJP, FD), pp. 241–254.
ICALPICALP-1977-BensonJ #composition #parallel #parsing
Parallel Decomposition of LR(k) Parsers (DBB, RDJ), pp. 76–86.
POPLPOPL-1977-Soisalon-Soininen #parsing #reduction #using
Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions (ESS), pp. 183–193.
POPLPOPL-1976-LaLonde #on the #parsing #reduction
On Directly Constructing LR(k) Parsers Without Chain Reductions (WRL), pp. 127–133.
POPLPOPL-1975-HuntSU #complexity #on the #testing
On the Complexity of LR(k) Testing (HBHI, TGS, JDU), pp. 130–136.
ICALPICALP-1974-Pager #on the #parsing
On Eliminating Unit Productions from LR(k) Parsers (DP), pp. 242–254.
POPLPOPL-1973-GellerH #parsing #strict
Strict Deterministic Versus LR(0) Parsing (MMG, MAH), pp. 22–32.
STOCSTOC-1973-Pager #algorithm #parsing
The Lane Tracing Algorithm for Constructing LR(k) Parsers (DP), pp. 172–181.
ICALPICALP-1972-Kemp #estimation #set
An Estimation of the Set of States of the Minimal LR(0)-Acceptor (RK), pp. 563–574.
STOCSTOC-1972-AhoU #parsing
A Technique for Speeding Up LR(k) Parsers (AVA, JDU), pp. 251–263.
STOCSTOC-1971-AhoU
The Care and Feeding of LR(k) Grammars (AVA, JDU), pp. 159–170.
STOCSTOC-1969-Korenjak #performance
Efficient LR(1) Processor Construction (AJK), pp. 191–200.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.