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