BibSLEIGH — parsing tag

parsing

parsing

Tag #parsing

329 papers:

CC-2020-ChidaKITS #algorithm #linear: Is stateful packrat parsing really linear in practice? a counter-example, an improved grammar, and its parsing algorithms (NC, YK, DI, KT, KS), pp. 155–166.
FDG-2019-LuoGR #network #using #video: Making CNNs for video parsing accessible: event extraction from DOTA2 gameplay video using transfer, zero-shot, and network pruning (ZL, MG, MR), p. 10.
OOPSLA-2019-HenriksenBP #approach: Derivative grammars: a symbolic approach to parsing with derivatives (IH, GB, KP), p. 28.
PEPM-2019-Radanne #regular expression: Typed parsing and unparsing for untyped regular expression engines (GR), pp. 35–46.
PLDI-2019-CampagnaXMSL #generative #named #natural language #semantics: Genie: a generator of natural language semantic parsers for virtual assistant commands (GC, SX, MM, RS, MSL), pp. 394–410.
PLDI-2019-KrishnaswamiY #algebra #approach: A typed, algebraic approach to parsing (NRK, JY), pp. 379–393.
PLDI-2019-TonderG #combinator #lightweight #multi #syntax: Lightweight multi-language syntax transformation with parser parser combinators (RvT, CLG), pp. 363–378.
SLE-2019-DiekmannT #ambiguity #online: Default disambiguation for online parsers (LD, LT), pp. 88–99.
SLE-2019-RaselimoTF #fault #generative #source code #syntax: Breaking parsers: mutation-based generation of programs with guaranteed syntax errors (MR, JT, BF0), pp. 83–87.
JCDL-2018-TkaczykCSB #evaluation #machine learning #open source: Machine Learning vs. Rules and Out-of-the-Box vs. Retrained: An Evaluation of Open-Source Bibliographic Reference and Citation Parsers (DT, AC, PS, JB), pp. 99–108.
CIAA-2018-Sakharov #approximate #automaton: One-Counter Automata for Parsing and Language Approximation (AS), pp. 299–311.
ICML-2018-QiJZ #earley #predict #sequence: Generalized Earley Parser: Bridging Symbolic Grammars and Sequence Data for Future Prediction (SQ, BJ, SCZ), pp. 4168–4176.
KDD-2018-SachanX #framework #source code: Parsing to Programs: A Framework for Situated QA (MS, EPX), pp. 2140–2149.
SLE-2018-AmorimSEV #declarative #pretty-printing #specification: Declarative specification of indentation rules: a tooling perspective on parsing and pretty-printing layout-sensitive languages (LEdSA, MJS, SE, EV), pp. 3–15.
SLE-2018-BinsbergenSJ #combinator #flexibility #gll: GLL parsing with flexible combinators (LTvB, ES, AJ), pp. 16–28.
SLE-2018-Regis-GianasJT #named: Morbig: a static parser for POSIX shell (YRG, NJ, RT), pp. 29–41.
ICPC-2017-AlexandruPG #behaviour #using: Replicating parser behavior using neural machine translation (CVA, SP, HCG), pp. 316–319.
ASE-2017-LeungL #ide #named #synthesis: Parsimony: an IDE for example-guided synthesis of lexers and parsers (AL, SL), pp. 815–825.
GPCE-2017-Zaytsev #generative #legacy #pattern matching: Parser generation by example for legacy pattern languages (VZ), pp. 212–218.
SLE-2017-DubroyW #incremental: Incremental packrat parsing (PD, AW), pp. 14–25.
SLE-2017-Laurent: Red Shift: procedural shift-reduce parsing (NL), pp. 38–42.
SLE-2017-ZhangLO #composition #type safety: Type-safe modular parsing (HZ, HL, BCdSO), pp. 2–13.
CIAA-2016-WaszczukSP #performance: Enhancing Practical TAG Parsing Efficiency by Capturing Redundancy (JW, AS, YP0), pp. 310–321.
ICMT-2016-MooijJEJR #industrial #open source #using: Industrial Software Rejuvenation Using Open-Source Parsers (AJM, MMJ, GE, PJ, AR), pp. 157–172.
OOPSLA-2016-BrachthauserRO: Parsing with first-class derivatives (JIB, TR, KO), pp. 588–606.
PEPM-2016-IzmaylovaAS #combinator: Practical, general parser combinators (AI, AA, TvdS), pp. 1–12.
PLDI-2016-0001HM #complexity #on the #performance: On the complexity and performance of parsing with derivatives (MDA0, CH, MM), pp. 224–236.
SLE-2016-LaurentM #context-sensitive grammar: Taming context-sensitive languages with principled stateful parsing (NL, KM), pp. 15–27.
SLE-2016-ZhuZK0SH #bidirectional: Parsing and reflective printing, bidirectionally (ZZ, YZ, HSK, PM, JS, ZH), pp. 2–14.
CC-2016-AfroozehI #framework #named: Iguana: a practical data-dependent parsing framework (AA, AI), pp. 267–268.
CC-2016-Pottier #fault #lr #reachability: Reachability and error diagnosis in LR(1) parsers (FP), pp. 88–98.
ITiCSE-2015-KarpovaDHP #algebra #named #relational #tool support: RAPT: Relational Algebra Parsing Tools (OK, ND, DH, AP), p. 334.
CIAA-2015-BerglundM #on the #regular expression #semantics: On the Semantics of Regular Expression Parsing in the Wild (MB, BvdM), pp. 292–304.
CIAA-2015-BorsottiBCM #ambiguity #automaton #regular expression: From Ambiguous Regular Expressions to Deterministic Parsing Automata (AB, LB, SCR, AM), pp. 35–48.
CIAA-2015-BorsottiBCM15a #ambiguity #named #regular expression: BSP: A Parsing Tool for Ambiguous Regular Expressions (AB, LB, SCR, AM), pp. 313–316.
ICGT-2015-DrewesHM #predict #top-down: Predictive Top-Down Parsing for Hyperedge Replacement Grammars (FD, BH, MM), pp. 19–34.
BX-2015-ZhuKMSH #named: BiYacc: Roll Your Parser and Reflective Printer into One (ZZ, HSK, PM, JS, ZH), pp. 43–50.
Onward-2015-AfroozehI: One parser to rule them all (AA, AI), pp. 151–170.
PLDI-2015-IsradisaikulM: Finding counterexamples from parsing conflicts (CI, ACM), pp. 555–564.
PLDI-2015-LeungSL #interactive #synthesis: Interactive parser synthesis by example (AL, JS, SL), pp. 565–574.
CC-2015-AfroozehI #gll #performance: Faster, Practical GLL Parsing (AA, AI), pp. 89–108.
CC-2015-PingaliB #context-free grammar #visual notation: A Graphical Model for Context-Free Grammar Parsing (KP, GB), pp. 3–27.
VMCAI-2015-ChristakisG #composition #image #memory management #proving #safety #testing #using: Proving Memory Safety of the ANI Windows Image Parser Using Compositional Exhaustive Testing (MC, PG), pp. 373–392.
JCDL-2014-MajidiC #analysis #dependence #fault: Human and machine error analysis on dependency parsing of ancient Greek texts (SM, GRC), pp. 221–224.
LATA-2014-BreveglieriCM #network: Shift-Reduce Parsers for Transition Networks (LB, SCR, AM), pp. 222–235.
FLOPS-2014-SulzmannL #regular expression: POSIX Regular Expression Parsing with Derivatives (MS, KZML), pp. 203–220.
Haskell-2014-AdamsA: Indentation-sensitive parsing for Parsec (MDA0, ÖSA), pp. 121–132.
ILC-2014-KeishiS #generative #lalr #named: PaGe: Portable LALR(1) Parser Generator (SK, AS), p. 8.
ICPR-2014-ZhangHWZ #multi: Enhanced Human Parsing with Multiple Feature Fusion and Augmented Pose Model (ZZ, JH, YW, YZ), pp. 369–374.
KDD-2014-Melli #automation #semantics: Shallow semantic parsing of product offering titles (for better automatic hyperlink insertion) (GM), pp. 1670–1678.
KDIR-2014-MaWQ: Time Phrase Parsing for Chinese Text with HowNet Temporal Information Structure (HmM, XyW, LQ), pp. 294–299.
KEOD-2014-MartinB #information management #ontology #specification: An Ontology for Specifying and Parsing Knowledge Representations Structures and Notations (PM, JB), pp. 96–107.
MoDELS-2014-ZaytsevB #in a broad sense: Parsing in a Broad Sense (VZ, AHB), pp. 50–67.
OOPSLA-2014-JonnalageddaCSRO #combinator #performance #staged: Staged parser combinators for efficient data processing (MJ, TC, SS, TR, MO), pp. 637–653.
OOPSLA-2014-ParrHF #adaptation #dynamic analysis #ll #power of: Adaptive LL(*) parsing: the power of dynamic analysis (TP, SH, KF), pp. 579–598.
PPDP-J-2012-Thielecke14 #on the #semantics: On the semantics of parsing actions (HT), pp. 52–76.
SLE-2014-Ridge #combinator #context-free grammar #performance #using: Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle (TR), pp. 261–281.
OSDI-2014-BangertZ #generative #named: Nail: A Practical Tool for Parsing and Generating Data Formats (JB, NZ), pp. 615–628.
TPDL-2013-MajidiC #dependence #learning: Committee-Based Active Learning for Dependency Parsing (SM, GRC), pp. 442–445.
CIAA-2013-GrathwohlHNR #regular expression: Two-Pass Greedy Regular Expression Parsing (NBBG, FH, LN, UTR), pp. 60–71.
ICFP-2013-BernardyC #context-free grammar #divide and conquer #performance: Efficient divide-and-conquer parsing of practical context-free languages (JPB, KC), pp. 111–122.
ICML-c1-2013-WulsinFL #correlation #markov #process #using: Parsing epileptic events using a Markov switching process model for correlated time series (DW, EBF, BL), pp. 356–364.
KDIR-KMIS-2013-Lindner #constraints #random #using: Using Conditional Random Fields with Constraints to Train Support Vector Machines — Locating and Parsing Bibliographic References (SL), pp. 28–36.
POPL-2013-Adams: Principled parsing for indentation-sensitive languages: revisiting landin’s offside rule (MDA), pp. 511–522.
SAS-2013-KimDS #documentation #html #semantics #validation: Static Validation of Dynamically Generated HTML Documents Based on Abstract Parsing and Semantic Processing (HK, KGD, DAS), pp. 194–214.
SAC-2013-Slivnik: LLLR parsing (BS), pp. 1698–1699.
SAC-2013-SolankiRBGB #embedded #performance: Improving the performance of message parsers for embedded systems (JS, LR, YDB, BLG, TFB), pp. 1505–1510.
CC-2013-BertschNS #lr #on the: On LR Parsing with Selective Delays (EB, MJN, SS), pp. 244–263.
DocEng-2012-KimBTFD #comparison #evaluation #tool support: Evaluation of BILBO reference parsing in digital humanities via a comparison of different tools (YMK, PB, JT, EF, MD), pp. 209–212.
JCDL-2012-GaoQTLL: Web-based citation parsing, correction and augmentation (LG, XQ, ZT, XL, YL), pp. 295–304.
TPDL-2012-SautterB: Improved Bibliographic Reference Parsing Based on Repeated Patterns (GS, KB), pp. 370–382.
FM-2012-MinamideM #analysis #html #reachability #specification #testing: Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing (YM, SM), pp. 293–307.
ICML-2012-FarabetCNL #learning #multi: Scene parsing with Multiscale Feature Learning, Purity Trees, and Optimal Covers (CF, CC, LN, YL), p. 241.
ICPR-2012-HuHPZ: Baseline extraction-driven Parsing of handwritten mathematical expressions (LH, KH, RP, RZ), pp. 326–330.
ICPR-2012-MacriniWLG #probability #recognition: Probabilistic shape parsing for view-based object recognition (DM, CW, RL, MG), pp. 2303–2305.
KDIR-2012-LindnerH #constraints #learning #maintenance #random: Parsing and Maintaining Bibliographic References — Semi-supervised Learning of Conditional Random Fields with Constraints (SL, WH), pp. 233–238.
PLDI-2012-GazzilloG #c #named #preprocessor: SuperC: parsing all of C by taming the preprocessor (PG, RG), pp. 323–334.
PPDP-2012-Thielecke #continuation #functional #recursion #semantics: Functional semantics of parsing actions, and left recursion elimination as continuation passing (HT), pp. 91–102.
SAC-PL-J-2009-J-CervelleFLR12 #implementation #using: Banzai+Tatoo: Using cutting-edge parsers for implementing high-performance servers (JC, RF, GL, GR), pp. 990–1005.
ASE-2012-Quesada #generative #modelling: A model-driven parser generator with reference resolution support (LQ), pp. 394–397.
ICSE-2012-IwamaNT #industrial #natural language #specification: Constructing parser for industrial software specifications containing formal and natural language description (FI, TN, HT), pp. 1012–1021.
SLE-2012-BarenghiVCMP #generative #named #parallel #precedence: PAPAGENO: A Parallel Parser Generator for Operator Precedence Grammars (AB, EV, SCR, DM, MP), pp. 264–274.
SLE-2012-ErdwegRKO #generalised parsing: Layout-Sensitive Generalized Parsing (SE, TR, CK, KO), pp. 244–263.
ESOP-2012-JourdanPL #lr #validation: Validating LR(1) Parsers (JHJ, FP, XL), pp. 397–416.
LICS-2012-Atkey #semantics: The Semantics of Parsing with Semantic Actions (RA), pp. 75–84.
LATA-2011-NielsenH #regular expression: Bit-coded Regular Expression Parsing (LN, FH), pp. 402–413.
Haskell-2011-DuregardJ #embedded #generative: Embedded parser generators (JD, PJ), pp. 107–117.
ICFP-2011-MightDS #functional: Parsing with derivatives: a functional pearl (MM, DD, DS), pp. 189–195.
ICML-2011-SocherLNM #natural language #network #recursion: Parsing Natural Scenes and Natural Language with Recursive Neural Networks (RS, CCYL, AYN, CDM), pp. 129–136.
OOPSLA-2011-KastnerGREOB #compilation #metaprogramming #variability: Variability-aware parsing in the presence of lexical macros and conditional compilation (CK, PGG, TR, SE, KO, TB), pp. 805–824.
PLDI-2011-ParrF #generative #ll: LL(*): the foundation of the ANTLR parser generator (TP, KF), pp. 425–436.
LDTA-2011-StansiferW: Parsing reflective grammars (PS, MW), p. 10.
SLE-2011-FischerLZ #comparison #context-free grammar #testing: Comparison of Context-Free Grammars Based on Parsing Generated Test Data (BF, RL, VZ), pp. 324–343.
ESOP-2011-JimM: A New Method for Dependent Parsing (TJ, YM), pp. 378–397.
ECDL-2010-AutayeuGA #classification #lightweight #ontology: Lightweight Parsing of Classifications into Lightweight Ontologies (AA, FG, PA), pp. 327–339.
ITiCSE-2010-Almeida-MartinezURV #design #student #visualisation: Student-centered design of a parser visualization tool (FJAM, JUF, MRS, JÁVI), p. 326.
ICPC-2010-AbebeT #concept #natural language: Natural Language Parsing of Program Element Names for Concept Extraction (SLA, PT), pp. 156–159.
PASTE-2010-MizushimaMY #constant: Packrat parsers can handle practical grammars in mostly constant space (KM, AM, YY), pp. 29–36.
SCAM-2010-Pise #generative: The Fika Parser Generator (MP), pp. 99–100.
DLT-2010-Okhotin #algorithm #boolean grammar #performance: Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm (AO), pp. 340–351.
Haskell-2010-RendelO #pretty-printing #syntax: Invertible syntax descriptions: unifying parsing and pretty printing (TR, KO), pp. 1–12.
ICFP-2010-Danielsson #combinator: Total parser combinators (NAD), pp. 285–296.
ICPR-2010-CoutinhoFF #identification #using: One-Lead ECG-based Personal Identification Using Ziv-Merhav Cross Parsing (DPC, ALNF, MATF), pp. 3858–3861.
ICPR-2010-SeyedhosseiniPT #classification #image #network: Image Parsing with a Three-State Series Neural Network Classifier (MS, ARCP, TT), pp. 4508–4511.
KDIR-2010-BallesterosBG #dependence #using: Text Simplification using Dependency Parsing for Spanish (MB, SB, PG), pp. 330–335.
KDIR-2010-BallesterosHFG #dependence #using: Giving Shape to an N-version Dependency Parser — Improving Dependency Parsing Accuracy for Spanish using Maltparser (MB, JH, VF, PG), pp. 336–341.
SIGIR-2010-ParkC #dependence #query #ranking: Query term ranking based on dependency parsing of verbose queries (JHP, WBC), pp. 829–830.
SAC-PL-J-2008-DennyM10 #algorithm #generative #lr: The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 943–979.
LDTA-J-2007-ScottJ #polynomial #recognition: Recognition is not parsing — SPPF-style parsing from cubic recognisers (ES, AJ), pp. 55–70.
LDTA-2009-BoylandS10 #generative #recursion: TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator (JB, DS), pp. 65–74.
LDTA-2009-JimM10 #earley #performance: Efficient Earley Parsing with Regular Right-hand Sides (TJ, YM), pp. 135–148.
LDTA-2009-ScottJ10 #gll: GLL Parsing (ES, AJ), pp. 177–189.
GPCE-2010-PorkolabS #domain-specific language #generative #integration #library: Domain-specific language integration with compile-time parser generator library (ZP, ÁS), pp. 137–146.
SLE-2010-ErdwegO #correctness #tex: Featherweight TeX and Parser Correctness (STE, KO), pp. 397–416.
SLE-2010-JohnstoneS #gll #implementation #modelling: Modelling GLL Parser Implementations (AJ, ES), pp. 42–61.
ESOP-2010-KoprowskiB #interpreter #named: TRX: A Formally Verified Parser Interpreter (AK, HB), pp. 345–365.
DRR-2009-ZouLT #html: Locating and parsing references in HTML medical articles (JZ, DXL, GRT), pp. 1–10.
HT-2009-RomanelloBBC #information management: When printed hypertexts go digital: information extraction from the parsing of indices (MR, MB, AB, GRC), pp. 357–358.
JCDL-2009-GaoTL #named: CEBBIP: a parser of bibliographic information in chinese electronic books (LG, ZT, XL), pp. 73–76.
CSMR-2009-LuciaDGR #behaviour #identification #visual notation: Behavioral Pattern Identification through Visual Language Parsing and Code Instrumentation (ADL, VD, CG, MR), pp. 99–108.
ICPC-2009-NilssonLHN #fact extraction #natural language #source code: Natural language parsing for fact extraction from source code (JN, WL, JH, JN), pp. 223–227.
CIAA-2009-Sastre-Martinez #network #performance #recursion #using: Efficient Parsing Using Filtered-Popping Recursive Transition Networks (JMSM), pp. 241–244.
LATA-2009-Hemerik #taxonomy #towards: Towards a Taxonomy for ECFG and RRPG Parsing (KH), pp. 410–421.
Haskell-2009-Bernardy #functional #incremental #lazy evaluation: Lazy functional incremental parsing (JPB), pp. 49–60.
GT-VMT-2009-MazanekM09a #diagrams #using: Contraction of Unconnected Diagrams using Least Cost Parsing (SM, MM), pp. 189–201.
ICML-2009-MartinsSX #approximate #natural language: Polyhedral outer approximations with application to natural language parsing (AFTM, NAS, EPX), pp. 713–720.
SIGIR-2009-ZhangWLOJH #dependence #mining: Mining product reviews based on shallow dependency parsing (QZ, YW, TL, MO, JJ, XH), pp. 726–727.
MoDELS-2009-KleinerAB: Parsing SBVR-Based Controlled Languages (MK, PA, JB), pp. 122–136.
MoDELS-2009-KleinerAB: Parsing SBVR-Based Controlled Languages (MK, PA, JB), pp. 122–136.
OOPSLA-2009-KatsJNV #agile #composition #fault #feedback: Providing rapid feedback in generated modular language environments: adding error recovery to scannerless generalized-LR parsing (LCLK, MdJ, ENN, EV), pp. 445–464.
SAS-2009-DohKS #static analysis #string #using: Abstract Parsing: Static Analysis of Dynamically Generated String Output Using LR-Parsing Technology (KGD, HK, DAS), pp. 256–272.
SAC-2009-DemailleLS #abstract syntax tree #effectiveness #named #using: TWEAST: a simple and effective technique to implement concrete-syntax AST rewriting using partial parsing (AD, RL, BS), pp. 1924–1929.
GPCE-2009-KongCY: Abstract parsing for two-staged languages with concatenation (SK, WC, KY), pp. 109–116.
SLE-2009-JongeNKV #fault #flexibility: Natural and Flexible Error Recovery for Generated Parsers (MdJ, ENN, LCLK, EV), pp. 204–223.
SLE-2009-SchwerdfegerW #composition: Verifiable Parse Table Composition for Deterministic Parsing (AS, EVW), pp. 184–203.
CC-2009-EconomopoulosKV #glr #performance: Faster Scannerless GLR Parsing (GRE, PK, JJV), pp. 126–141.
CC-2009-Padioleau #c #c++ #preprocessor: Parsing C/C++ Code without Pre-processing (YP), pp. 109–125.
ESOP-2009-BarthwalN #execution: Verified, Executable Parsing (AB, MN), pp. 160–174.
ITiCSE-2008-Garcia-OsorioGG #algorithm #education #ll #lr: A tool for teaching LL and LR parsing algorithms (CGO, CGP, NGP), p. 317.
RTA-2008-MazanekM #combinator #functional #graph: Functional-Logic Graph Parser Combinators (SM, MM), pp. 261–275.
Haskell-2008-VieraSL #haskell #performance #runtime #top-down: Haskell, do you read me?: constructing and composing efficient top-down parsers at runtime (MV, SDS, EL), pp. 63–74.
IFL-2008-DanielssonN: Parsing Mixfix Operators (NAD, UN), pp. 80–99.
GT-VMT-2008-MazanekM #combinator #graph: Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators (SM, MM).
PADL-2008-BecketS #definite clause grammar #question: DCGs + Memoing = Packrat Parsing but Is It Worth It? (RB, ZS), pp. 182–196.
PADL-2008-FrostHC #ambiguity #combinator #recursion: Parser Combinators for Ambiguous Left-Recursive Grammars (RAF, RH, PC), pp. 167–181.
PEPM-2008-WarthDM #recursion: Packrat parsers can support left recursion (AW, JRD, TDM), pp. 103–110.
SAC-2008-DennyM #lr: IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 240–245.
LDTA-2007-Scott08 #earley: SPPF-Style Parsing From Earley Recognisers (ES), pp. 53–67.
ICDAR-2007-Mace #constraints #documentation #incremental #multi #online: Context-Driven Constraint Multiset Grammars with Incremental Parsing for On-line Structured Document Interpretation (SM), pp. 442–446.
ICDAR-2007-MasSLL #algorithm #diagrams #incremental #online #sketching: An Incremental On-line Parsing Algorithm for Recognizing Sketching Diagrams (JM, GS, JL, BL), pp. 452–456.
ICDAR-2007-YoshidaN #approach #documentation #modelling #web: Web Document Parsing: A New Approach to Modeling Layout-Language Relations (MY, HN), pp. 203–207.
IFL-2007-MazanekM #combinator #graph: Graph Parser Combinators (SM, MM), pp. 1–18.
IFL-2007-Wallace: Partial Parsing: Combining Choice with Commitment (MW), pp. 93–110.
HCI-MIE-2007-KopparapuSR #concept: Minimal Parsing Key Concept Based Question Answering System (SKK, AS, PVSR), pp. 104–113.
LDTA-J-2003-BrabrandS: The metafront system: Safe and extensible parsing and transformation (CB, MIS), pp. 2–20.
LDTA-J-2005-JohnstoneS #automation #recursion #reduction: Automatic recursion engineering of reduction incorporated parsers (AJ, ES), pp. 95–110.
GPCE-2007-WykS: Context-aware scanning for parsing extensible languages (EVW, AS), pp. 63–72.
PDP-2007-CampanileCCR #adaptation #data type #realtime: Adaptable Parsing of Real-Time Data Streams (FC, AC, LC, LR), pp. 412–418.
DLT-J-2005-Okhotin06 #algorithm #boolean grammar #glr: Generalized Lr Parsing Algorithm for Boolean Grammars (AO), pp. 629–664.
CIAA-2006-GalvezSF #bound #linear #lookahead: Shift-Resolve Parsing: Simple, Unbounded Lookahead, Linear Time (JFG, SS, JF), pp. 253–264.
CIAA-2006-Thurston #automaton #regular expression: Parsing Computer Languages with an Automaton Compiled from a Single Regular Expression (ADT), pp. 285–286.
DLT-2006-Schmitz #lalr: Noncanonical LALR(1) Parsing (SS), pp. 95–107.
SIGAda-2006-Carlisle #ada #automation #generative #object-oriented #using: Automatic OO parser generation using visitors for Ada 2005 (MCC), pp. 3–8.
LDTA-J-2004-JohnstoneSE #algorithm #glr: Evaluating GLR parsing algorithms (AJ, ES, GRE), pp. 228–244.
LDTA-2006-Megacz: Scannerless Boolean Parsing (AM), pp. 97–102.
ICLP-2006-Aguilar-Solis #approach #constraints #learning #semantics: Learning Semantic Parsers: A Constraint Handling Rule Approach (DAS), pp. 447–448.
IJCAR-2006-GelderS #automation #generative #higher-order #logic: Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (AVG, GS), pp. 156–161.
DocEng-2005-ManakaS #lazy evaluation #optimisation #xml: Static optimization of XSLT stylesheets: template instantiation optimization and lazy XML parsing (KM, HS), pp. 55–57.
DocEng-2005-WhitingCCGHST #documentation #semantics #web: Enabling massive scale document transformation for the semantic web: the universal parsing agent™ (MAW, WC, NC, AG, RH, RS, ST), pp. 23–25.
HT-2005-Francisco-RevillaS #ambiguity #hypermedia: Parsing and interpreting ambiguous structures in spatial hypermedia (LFR, FMSI), pp. 107–116.
ICDAR-2005-LiangNSV #2d #algorithm #geometry #performance: Efficient Geometric Algorithms for Parsing in Two Dimensions (PL, MN, MS, PAV), pp. 1172–1177.
CSMR-2005-CostagliolaLDGR #design pattern #visual notation: Design Pattern Recovery by Visual Language Parsing (GC, ADL, VD, CG, MR), pp. 102–111.
DLT-2005-BatuS #approximate #consistency #string: Locally Consistent Parsing and Applications to Approximate String Comparisons (TB, SCS), pp. 22–35.
DLT-2005-Okhotin #boolean grammar #lr: LR Parsing for Boolean Grammars (AO), pp. 362–373.
LDTA-2005-JohnstoneS #recursion #reduction: Recursion Engineering for Reduction Incorporated Parsers (AJ, ES), pp. 143–160.
FATES-2005-ZelenovZ #automation #generative #testing: Automated Generation of Positive and Negative Tests for Parsers (SVZ, SAZ), pp. 187–202.
SIGMOD-2004-ZhangHC #comprehension #interface #query #syntax #web: Understanding Web Query Interfaces: Best-Effort Parsing with Hidden Syntax (ZZ, BH, KCCC), pp. 107–118.
FLOPS-2004-GluckK #lr #source code: Derivation of Deterministic Inverse Programs Based on LR Parsing (RG, MK), pp. 291–306.
ICGT-2004-SeifertF #generative #graph grammar #string: Parsing String Generating Hypergraph Grammars (SS, IF), pp. 352–367.
SEKE-2004-CookZ #generalised parsing #named: GOLD: A Generalized Parsing System (DC, DZ), pp. 179–184.
LDTA-2004-JohnstoneSE #algorithm #case study #glr: The Grammar Tool Box: A Case Study Comparing GLR Parsing Algorithms (AJ, ES, GRE), pp. 97–113.
LDTA-2004-ThiemannN #lr: Parameterized LR Parsing (PT, MN), pp. 115–132.
CC-2004-JohnstoneSE #generalised parsing: Generalised Parsing: Some Costs (AJ, ES, GRE), pp. 89–103.
CC-2004-McPeakN #generative #glr #named #performance: Elkhound: A Fast, Practical GLR Parser Generator (SM, GCN), pp. 73–88.
ICDAR-2003-ZimmermannCB: Parsing N-Best Lists of Handwritten Sentences (MZ, JCC, HB), pp. 572–576.
CIAA-2003-BravoN: Building Context-Sensitive Parsers from CF Grammars with Regular Control Language (CB, JJN), pp. 306–308.
CIAA-2003-Castano #lr: LR Parsing for Global Index Languages (GILs) (JMC), pp. 269–281.
ICFP-2003-HughesS: Polish parsers, step by step (RJMH, SDS), pp. 239–248.
CIKM-2003-Holmes #information retrieval #sql: SQL text parsing for information retrieval (DH), pp. 496–499.
CIKM-2003-NicolaJ #database #performance #xml: XML parsing: a threat to database performance (MN, JJ), pp. 175–178.
SAC-2003-MernikGZB #question: Can a Parser be Generated from Examples? (MM, GG, VZ, BRB), pp. 1063–1067.
LDTA-2003-BrabrandSV: The metafront System: Extensible Parsing and Transformation (CB, MIS, MV), pp. 592–611.
LDTA-2003-BrandKMV #ambiguity #generalised parsing #semantics #term rewriting: Generalized Parsing and Term Rewriting: Semantics Driven Disambiguation (MvdB, SK, LM, JJV), pp. 575–591.
CC-2003-JohnstoneS #generalised parsing: Generalised Regular Parsers (AJ, ES), pp. 232–246.
CIAA-2002-Bruggemann-KleinW #context-free grammar #on the #predict: On Predictive Parsing and Extended Context-Free Grammars (ABK, DW), pp. 239–247.
CIAA-2002-Melichar #string: Deterministic Parsing of Cyclic Strings (BM), pp. 301–306.
CIAA-2002-Okhotin02a #boolean grammar #generative: Whale Calf, a Parser Generator for Conjunctive Grammars (AO), pp. 213–220.
ICFP-2002-Ford #functional #lazy evaluation #linear: Packrat parsing: : simple, powerful, lazy, linear time, functional pearl (BF), pp. 36–47.
ECOOP-2002-NeumannZ #case study #design #implementation #interpreter #rdf #xml: Pattern-Based Design and Implementation of an XML and RDF Parser and Interpreter: A Case Study (GN, UZ), pp. 392–414.
PADL-2002-Kiselyov #functional #programming #xml: A Better XML Parser through Functional Programming (OK), pp. 209–224.
CC-2002-BrandSVV #ambiguity #glr: Disambiguation Filters for Scannerless Generalized LR Parsers (MvdB, JS, JJV, EV), pp. 143–158.
ICDAR-2001-KogaMSF #2d #bottom-up #recognition #segmentation: A Recognition Method of Machine-Printed Monetary Amounts Based on the Two-Dimensional Segmentation and the Bottom-up Parsing (MK, RM, HS, HF), pp. 968–971.
WCRE-2001-Blasband: Parsing in a Hostile World (DB), pp. 291–300.
CIAA-2001-FarreG #bound: Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers (JF, JFG), pp. 101–114.
GT-VMT-2001-BardohlST #visual notation: Visual Language Parsing in GenGEd (RB, TS, GT), pp. 289–294.
CC-2001-AycockH #earley: Directly-Executable Earley Parsing (JA, RNH), pp. 229–243.
CC-2001-FarreG #bound: A Bounded Graph-Connect Construction for LR-regular Parsers (JF, JFG), pp. 244–258.
ICLP-2001-Clergerie #natural language: Natural Language Tabular Parsing (EVdlC), p. 8.
CIAA-2000-FarreG: A Basis for Looping Extensions to Discriminating-Reverse Parsing (JF, JFG), pp. 122–134.
WLC-2000-DomosiI #context-sensitive grammar #problem: A Parsing Problem for Context-Sensitive Languages (PD, MI), pp. 183–184.
ICML-2000-Collins #natural language #ranking: Discriminative Reranking for Natural Language Parsing (MC), pp. 175–182.
ICPR-v2-2000-SopenaA #named #network: ANNP: A Neural Network Parser for Real World Texts (JMS, MAA), pp. 2969–2972.
ICPR-v4-2000-Perez-CortesAAL #probability: Stochastic Error-Correcting Parsing for OCR Post-Processing (JCPC, JCA, JA, RL), pp. 4405–4408.
TOOLS-PACIFIC-2000-ButlerM #attribute grammar #generative #named: YooccLa: A Parser Generator for L-Attributed Grammars (GB, CM), pp. 214–227.
WRLA-2000-BrandR #asf+sdf #tool support: ASF+SDF parsing tools applied to ELAN (MvdB, CR), pp. 138–157.
CL-2000-Liang #generative #logic programming #programming language: A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language (CL), pp. 1315–1329.
ADL-1999-KleinA #analysis #comprehension #distributed #documentation #knowledge-based: Distributed Knowledge-Based Parsing for Document Analysis and Understanding (BK, AA), pp. 6–15.
DL-1999-TolleLSFRSC #information management #personalisation #semantics: Medical Information Access for the New Millenium: UMLS-enhanced Semantic Parsing and Personalized Medical Agent (KMT, GL, RRS, YF, DR, PZS, HC), pp. 252–253.
HT-1999-ReinertBPN #collaboration #component #incremental #named: CAOS: A Collaborative and Open Spatial Structure Service Component with Incremental Spatial Parsing (OR, DBL, CAP, PJN), pp. 49–50.
ICDAR-1999-MahadevanS #recognition: Parsing and Recognition of City, State, and ZIP Codes in Handwritten Addresses (UM, SNS), pp. 325–328.
IWPC-1999-KnapenLDM #c++: Parsing C++ Despite Missing Declarations (GK, BL, MD, EM), pp. 114–125.
DLT-1999-AndreiK #bidirectional #linear: Bidirectional parsing for linear languages (SA, MK), pp. 257–269.
DLT-1999-KlarlundDS #constraints #logic #named: Yakyak: parsing with logical side constraints (NK, ND, MIS), pp. 286–301.
FLOPS-1999-CaballeroL #functional: A Functional-Logic Perspective on Parsing (RC, FJLF), pp. 85–99.
ICML-1999-CardieMP #classification: Combining Error-Driven Pruning and Classification for Partial Parsing (CC, SM, DRP), pp. 87–96.
ICML-1999-ThompsonCM #information management #learning #natural language: Active Learning for Natural Language Parsing and Information Extraction (CAT, MEC, RJM), pp. 406–414.
CC-1999-AycockH #glr #performance: Faster Generalized LR Parsing (JA, RNH), pp. 32–46.
ESOP-1999-JanssonJ: Polytypic Compact Printing and Parsing (PJ, JJ), pp. 273–287.
IWPC-1998-BrandSV #harmful #legacy: Current Parsing Techniques in Software Renovation Considered Harmful (MvdB, MPAS, CV), pp. 108–117.
IWPC-1998-SomeL #compilation: Parsing Minimization when Extracting Information from Code in the Presence of Conditional Compilation (SSS, TCL), pp. 118–125.
WIA-1998-Blum #on the: On Parsing LL-Languages (NB), pp. 13–21.
WIA-1998-Goeman #linear #lr #on the #string: On Parsing and Condensing Substrings of LR Languages in Linear Time (HG), pp. 22–42.
IFL-1998-KoopmanP #combinator #performance: Efficient Combinator Parsers (PWMK, MJP), pp. 120–136.
CIKM-1998-JacksonAKG #generative #information management #query #retrieval: Information Extraction from Case Low and Retrieval of Prior Cases by Partial Parsing and Query Generation (PJ, KAK, CK, BG), pp. 60–67.
ICPR-1998-LeeHSL #analysis #automation #bound #detection #using #video: Automatic video parsing using shot boundary detection and camera operation analysis (MSL, BWH, SS, SWL), pp. 1481–1483.
CC-1998-JohnstoneS #generalised parsing #recursion: Generalised Recursive Descent parsing and Fellow-Determinism (AJ, ES), pp. 16–30.
WIA-1997-AlonsoCF #glr #performance: Construction of Efficient Generalized LR Parsers (MAA, DC, MVF), pp. 7–24.
HCI-SEC-1997-ShinYY #authoring #documentation #multi #using: Presentation Jockey: Multimedia Authoring System Using Structured Document Parsing (HSS, WJY, KJY), pp. 659–662.
AFP-1996-SwierstraD96 #combinator: Deterministic, Error-Correcting Combinator Parsers (SDS, LD), pp. 184–207.
SAC-1996-Turner #generative #named: SNACC: a parser generator for use with Miranda (DAT), pp. 401–407.
CC-1996-McLeanH #earley #performance: A Faster Earley Parser (PM, RNH), pp. 281–293.
CC-1996-ProebstingW: One-Pass, Optimal Tree Parsing — With Or Without Trees (TAP, BRW), pp. 294–308.
ICDAR-v1-1995-BunkeL #classification #documentation #using: Classification and postprocessing of documents using an error-correcting parser (HB, RL), pp. 222–226.
ICDAR-v2-1995-FutrelleN #analysis #constraints #diagrams #performance #using: Efficient analysis of complex diagrams using constraint-based parsing (RPF, NN), pp. 782–790.
DLT-1995-Asveld #context-free grammar #recognition #robust #towards: Towards Robustness in Parsing — Fuzzifying Context-Free Language Recognition (PRJA), pp. 443–453.
DLT-1995-Galvez #lr #stack: A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning (JFG), pp. 460–465.
DLT-1995-Gramatovici: Introducing the Operational Parser (RG), pp. 466–471.
DLT-1995-Nederhof #automaton #bidirectional: Reversible Pushdown Automata and Bidirectional Parsing (MJN), pp. 472–481.
AFP-1995-Fokker95 #functional: Functional Parsers (JF), pp. 1–23.
SEKE-1995-CostagliolaLOT #data flow #graph #performance: Efficient Parsing of Data-Flow Graphs (GC, ADL, SO, GT), pp. 226–233.
ECOOP-1995-Florijn #functional #protocol: Object Protocols as Functional Parsers (GF), pp. 351–373.
PEPM-1995-SperberT #lr: The Essence of LR Parsing (MS, PT), pp. 146–155.
PLILP-1995-Marriott #constraints #multi #visual notation: Parsing Visual Languages with Constraint Multiset Grammars (KM), pp. 24–25.
SAC-1995-AllenB #adaptation: A unification-based adaptive parser (CSA, BRB), pp. 282–287.
SAC-1995-Hendrickson #algorithm #lr #parallel: A new parallel LR parsing algorithm (KJH), pp. 277–281.
TAGT-1994-Wills #graph #source code #using: Using Attributed Flow Graph Parsing to Recognize Clichés in Programs (LMW), pp. 170–184.
SAC-1994-LiB #object-oriented #unification: An integrated parsing scheme for unification categorial grammar with object-oriented lexicon (LL, BRB), pp. 524–528.
SAC-1994-Lutsky #documentation #testing #using: Using a document parser to automate software testing (PL), pp. 59–63.
ICLP-1994-Barthelemy #approach #definite clause grammar: A Grammatical Approach to DCG Parsing (FB), pp. 632–646.
ILPS-1994-DavisonH: Parsing with PTN (AD, EH), p. 676.
ILPS-1994-RosenbluethP #logic programming #lr #source code: LR Inference: Inference Systems for Fixed-Mode Logic Programs, Based on LR Parsing (DAR, JCP), pp. 439–453.
ICDAR-1993-Conway #approach #documentation #layout #recognition: Page grammars and page parsing. A syntactic approach to document layout recognition (AC), pp. 761–764.
ICDAR-1993-HongH #probability #recognition: Text recognition enhancement with a probabilistic lattice chart parser (TH, JJH), pp. 222–225.
WCRE-1993-ReubensteinPR #analysis #reverse engineering #tool support: Separating Parsing and Analysis in Reverse Engineering Tools (HBR, RLP, SNR), pp. 117–125.
PEPM-1993-Mossin #partial evaluation: Partial Evaluation of General Parsers (CM), pp. 13–21.
PLILP-1993-Nederhof #algorithm #definite clause grammar #recursion #top-down: A New Top-Down Parsing Algorithm for Left-Recursive DCGs (MJN), pp. 108–122.
ILPS-1993-Felty #definite clause grammar #higher-order #syntax: Definite Clause Grammars for Parsing Higher-Order Syntax (APF), p. 668.
ILPS-1993-PostGK: Deterministic Parsing of Languages with Dynamic Operators (KP, AVG, JK), pp. 456–472.
LFP-1992-RauglaudreM #ml: Parsers in ML (DdR, MM), pp. 76–85.
CC-1992-Galvez #generative #lr: Generating LR(1) Parsers of Small Size (JFG), pp. 16–29.
CC-1992-Melichar #lr #syntax: Syntax Directed Translation with LR Parsing (BM), pp. 30–36.
CC-1992-Muller #top-down: Attribute-Directed Top-Down Parsing (KM), pp. 37–43.
CHI-1991-HelmMO #visual notation: Building visual language parsers (RH, KM, MO), pp. 105–112.
CC-1990-Dobler #hybrid #top-down: A Hybrid Top-Down Parsing Technique (HD), pp. 210–211.
CC-1990-Horspool #recursion: Recursive Ascent-Descent Parsers (RNH), pp. 1–10.
CC-1990-Larcheveque #compilation #incremental #lalr #using: Using an LALR Compiler Compiler to Generate Incremental Parsers (JML), pp. 147–164.
CC-1990-Pfahler #execution #lr #optimisation: Optimizing Directly Executable LR Parsers (PP), pp. 179–192.
FPCA-1989-Mauny #embedded #functional: Parsers and Printers as Stream Destructors and Constructors Embedded in Functional Languages (MM), pp. 360–370.
SIGIR-1989-MetzlerH #information retrieval: The Constituent Object Parser: Syntactic Structure Matching for Information Retrieval (DPM, SWH), pp. 117–126.
PLDI-1989-Cormack #fault #lr #string #syntax: An LR Substring Parser for Noncorrecting Syntax Error Recovery (GVC), pp. 161–169.
PLDI-1989-HeeringKR #generative #incremental: Incremental Generation of Parsers (JH, PK, JR), pp. 179–191.
PLDI-1989-SalomonC #programming language: Scannerless NSLR(1) Parsing of Programming Languages (DJS, GVC), pp. 170–178.
DAC-1989-BamjiA #grammarware #named: GRASP: A Grammar-based Schematic Parser (CB, JA), pp. 448–453.
PLILP-1988-Voisin #adaptation #algorithm #bottom-up #earley: A Bottom-Up Adaption of Earley’s Parsing Algorithm (FV), pp. 146–160.
CCHSC-1988-Horspool #generative #incremental #lalr #named: ILALR: An Incremental Generator of LALR(1) Parsers (RNH), pp. 128–136.
CCHSC-1988-Tarhio #compilation #evaluation #generative #lr: A Compiler Generator for Attributive Evaluation During LR Parsing (JT), pp. 146–159.
ESOP-1988-GiegerichS #pattern matching: Code Selection Techniques: Pattern Matching, Tree Parsing, and Inversion of Derivors (RG, KS), pp. 247–268.
JICSCP-1988-TrehanW88 #commit #logic #nondeterminism #parallel: A Parallel Chart Parser for the Committed Choice Non-Deterministic Logic Languages (RT, PFW), pp. 212–232.
SIGIR-1986-BerrutP #automation: Solving Grammatical Ambiguities within a Surface Syntactical Parser for Automatic Indexing (CB, PP), pp. 123–130.
ICLP-1986-Matsumoto86 #analysis #natural language #parallel: A Parallel Parsing System for Natural Language Analysis (YM), pp. 396–409.
SIGIR-1984-MetzlerNRH #dependence #information retrieval: Dependency Parsing for Information Retrieval (DPM, TN, LR, PBH), pp. 313–324.
SLP-1984-UeharaOKT84 #bottom-up #implementation #logic #overview: A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and its Implementation Technique (KU, RO, OK, JT), pp. 220–227.
GG-1982-Kaul #graph #linear: Parsing of graphs in linear time (MK), pp. 206–218.
POPL-1982-JaliliG: Building Friendly Parsers (FJ, JHG), pp. 196–206.
POPL-1982-SippiS #fault #lr: Practical Error Recovery in LR Parsing (SS, ESS), pp. 177–184.
SCC-1982-MauneyF #algorithm #ll #lr: A Forward Move Algorithm for LL and LR Parsers (JM, CNF), pp. 79–87.
ICALP-1981-Ukkonen #bound #on the: On Size Bounds for Deterministic Parsers (EU), pp. 218–228.
POPL-1980-Tarjan: Prime Subprogram Parsing of a Program (RET), pp. 95–105.
SDCG-1980-JonesM #lr: Attribute-influenced LR parsing (NDJ, CMM), pp. 393–407.
SDCG-1980-Watt: Rule splitting and attribute-directed parsing (DAW), pp. 363–392.
CADE-1980-Gloess #correctness #empirical #proving #theorem proving: An Experiment with the Boyer-Moore Theorem Prover: A Proof of the Correctness of a Simple Parser of Expressions (PYG), pp. 154–169.
ICALP-1979-Deussen #algorithm: One Abstract Accepting Algorithm for all Kinds of Parsers (PD), pp. 203–217.
ICALP-1979-MiltonF #attribute grammar #ll: LL(k) Parsing for Attributed Grammars (DRM, CNF), pp. 422–430.
ICALP-1979-Ruzzo #complexity #context-free grammar #on the #recognition: On the Complexity of General Context-Free Language Parsing and Recognition (WLR), pp. 489–497.
ICALP-1979-SippuS #ll #on the: On Constructing LL(k) Parsers (SS, ESS), pp. 585–595.
ICALP-1979-Ukkonen #bottom-up #lr: A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers (EU), pp. 646–658.
SCC-1979-PaiK #fault #syntax: Global context recovery: A new strategy for parser recovery from syntax errors (ABP, RBK), pp. 158–167.
ICALP-1978-Nijholt #on the: On the Parsing and Covering of Simple Chain Grammars (AN), pp. 330–344.
ICSE-1978-Lindstrom #top-down #using: Control Structure Aptness: A Cast Study Using Top-Down Parsing (GL), pp. 5–12.
ICALP-1977-BensonJ #composition #lr #parallel: Parallel Decomposition of LR(k) Parsers (DBB, RDJ), pp. 76–86.
ICALP-1977-Dieterich #context-free grammar #fault: Parsing and Syntactic Error Recovery for Context-Free Grammars by Means of Coarse Structures (EWD), pp. 180–192.
ICALP-1977-SippuS #fault #on the: On Defining Error Recovery in Context-Free Parsing (SS, ESS), pp. 492–503.
POPL-1977-Demers: Generalized Left Corner Parsing (AJD), pp. 170–182.
POPL-1977-FischerMQ #ll #performance: An Efficient Insertion-Only Error-Corrector for LL(1) Parsers (CNF, DRM, SBQ), pp. 97–103.
POPL-1977-Soisalon-Soininen #lr #reduction #using: Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions (ESS), pp. 183–193.
POPL-1976-LaLonde #lr #on the #reduction: On Directly Constructing LR(k) Parsers Without Chain Reductions (WRL), pp. 127–133.
POPL-1976-LeongW: The Influence of Productions on Derivations and Parsing (BLL, DW), pp. 1–11.
ICALP-1974-GellerGH: Production Prefix Parsing (MMG, SLG, MAH), pp. 232–241.
ICALP-1974-Lang #nondeterminism #performance: Deterministic Techniques for Efficient Non-Deterministic Parsers (BL), pp. 255–269.
ICALP-1974-Lomet #automation #generative #multi: Automatic Generation of Multiple Exit Parsing Subroutines (DBL), pp. 214–231.
ICALP-1974-Pager #lr #on the: On Eliminating Unit Productions from LR(k) Parsers (DP), pp. 242–254.
POPL-1973-AhoJU #ambiguity: Deterministic Parsing of Ambiguous Grammars (AVA, SCJ, JDU), pp. 1–21.
POPL-1973-GellerH #lr #strict: Strict Deterministic Versus LR(0) Parsing (MMG, MAH), pp. 22–32.
POPL-1973-Schkolnick #precedence: Labelled Precedence Parsing (MS), pp. 33–40.
STOC-1973-Pager #algorithm #lr: The Lane Tracing Algorithm for Constructing LR(k) Parsers (DP), pp. 172–181.
ICALP-1972-WeissMS #algebra #context-free grammar: Algebraic Parsing Techniques for Context-Free Languages (SFW, GM, DFS), pp. 493–498.
STOC-1972-AhoU #lr: A Technique for Speeding Up LR(k) Parsers (AVA, JDU), pp. 251–263.
STOC-1971-Terrine #algorithm #bottom-up #context-free grammar #generative #set: An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars (GT), pp. 185–205.
STOC-1970-Lindstrom #design #incremental: The Design of Parsers for Incremental Language Processors (GL), pp. 81–91.