Stem parser$ (all stems)

108 papers:

PLDI-2015-LeungSL #interactive #parsing #synthesis

Interactive parser synthesis by example (AL, JS, SL), pp. 565–574.

BX-2015-ZhuKMSH #named #parsing

BiYacc: Roll Your Parser and Reflective Printer into One (ZZ, HSK, PM, JS, ZH), pp. 43–50.

Onward-2015-AfroozehI #parsing

One parser to rule them all (AA, AI), pp. 151–170.

VMCAI-2015-ChristakisG #composition #image #memory management #parsing #proving #safety #testing #using

Proving Memory Safety of the ANI Windows Image Parser Using Compositional Exhaustive Testing (MC, PG), pp. 373–392.

LATA-2014-BreveglieriCM #network #parsing

Shift-Reduce Parsers for Transition Networks (LB, SCR, AM), pp. 222–235.

ILC-2014-KeishiS #generative #lalr #named #parsing

PaGe: Portable LALR(1) Parser Generator (SK, AS), p. 8.

OOPSLA-2014-JonnalageddaCSRO #combinator #parsing #performance #staged

Staged parser combinators for efficient data processing (MJ, TC, SS, TR, MO), pp. 637–653.

CC-2014-BarenghiCMPP #generative

The PAPAGENO Parallel-Parser Generator (AB, SCR, DM, FP, MP), pp. 192–196.

SAC-2013-SolankiRBGB #embedded #parsing #performance

Improving the performance of message parsers for embedded systems (JS, LR, YDB, BLG, TFB), pp. 1505–1510.

ASE-2012-Quesada #generative #modelling #parsing

A model-driven parser generator with reference resolution support (LQ), pp. 394–397.

ESOP-2012-JourdanPL #lr #parsing #validation

Validating LR(1) Parsers (JHJ, FP, XL), pp. 397–416.

FM-2012-MinamideM #analysis #html #parsing #reachability #specification #testing

Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing (YM, SM), pp. 293–307.

SAC-PL-J-2009-J-CervelleFLR12 #implementation #parsing #using

Banzai+Tatoo: Using cutting-edge parsers for implementing high-performance servers (JC, RF, GL, GR), pp. 990–1005.

ICSE-2012-IwamaNT #industrial #natural language #parsing #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 #parsing #precedence

PAPAGENO: A Parallel Parser Generator for Operator Precedence Grammars (AB, EV, SCR, DM, MP), pp. 264–274.

PLDI-2011-ParrF #generative #ll #parsing

LL(*): the foundation of the ANTLR parser generator (TP, KF), pp. 425–436.

AGTIVE-2011-FurstMM #graph grammar #heuristic #induction #process

Graph Grammar Induction as a Parser-Controlled Heuristic Search Process (LF, MM, VM), pp. 121–136.

PADL-2011-DevrieseP #combinator #domain-specific language #recursion #semiparsing

Explicitly Recursive Grammar Combinators — A Better Model for Shallow Parser DSLs (DD, FP), pp. 84–98.

ITiCSE-2010-Almeida-MartinezURV #design #parsing #student #visualisation

Student-centered design of a parser visualization tool (FJAM, JUF, MRS, JÁVI), p. 326.

ESOP-2010-KoprowskiB #interpreter #named #parsing

TRX: A Formally Verified Parser Interpreter (AK, HB), pp. 345–365.

PASTE-2010-MizushimaMY #constant #parsing

Packrat parsers can handle practical grammars in mostly constant space (KM, AM, YY), pp. 29–36.

SCAM-2010-Pise #generative #parsing

The Fika Parser Generator (MP), pp. 99–100.

ICALP-v2-2010-Blum #lr #on the #polynomial

On LR(k)-Parsers of Polynomial Size (NB), pp. 163–174.

ICFP-2010-Danielsson #combinator #parsing

Total parser combinators (NAD), pp. 285–296.

KDIR-2010-BallesterosHFG #dependence #parsing #using

Giving Shape to an N-version Dependency Parser — Improving Dependency Parsing Accuracy for Spanish using Maltparser (MB, JH, VF, PG), pp. 336–341.

GPCE-2010-PorkolabS #domain-specific language #generative #integration #library #parsing

Domain-specific language integration with compile-time parser generator library (ZP, ÁS), pp. 137–146.

SAC-PL-J-2008-DennyM10 #algorithm #generative #lr #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.

LDTA-2009-BoylandS10 #generative #parsing #recursion

TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator (JB, DS), pp. 65–74.

SLE-2010-ErdwegO #correctness #parsing #tex

Featherweight TeX and Parser Correctness (STE, KO), pp. 397–416.

SLE-2010-JohnstoneS #gll #implementation #modelling #parsing

Modelling GLL Parser Implementations (AJ, ES), pp. 42–61.

SLE-2009-JongeNKV #fault #flexibility #parsing

Natural and Flexible Error Recovery for Generated Parsers (MdJ, ENN, LCLK, EV), pp. 204–223.

PEPM-2008-WarthDM #parsing #recursion

Packrat parsers can support left recursion (AW, JRD, TDM), pp. 103–110.

GT-VMT-2008-MazanekM #combinator #graph #parsing

Parsing of Hyperedge Replacement Grammars with Graph Parser Combinators (SM, MM).

PADL-2008-FrostHC #ambiguity #combinator #parsing #recursion

Parser Combinators for Ambiguous Left-Recursive Grammars (RAF, RH, PC), pp. 167–181.

SAC-2008-DennyM #lr #parsing

IELR(1): practical LR(1) parser tables for non-LR(1) grammars with conflict resolution (JED, BAM), pp. 240–245.

RTA-2008-MazanekM #combinator #functional #graph #parsing

Functional-Logic Graph Parser Combinators (SM, MM), pp. 261–275.

IFL-2007-MazanekM #combinator #graph #parsing

Graph Parser Combinators (SM, MM), pp. 1–18.

LDTA-J-2005-JohnstoneS #automation #parsing #recursion #reduction

Automatic recursion engineering of reduction incorporated parsers (AJ, ES), pp. 95–110.

SIGAda-2006-Carlisle #ada #automation #generative #object-oriented #parsing #using

Automatic OO parser generation using visitors for Ada 2005 (MCC), pp. 3–8.

ICLP-2006-Aguilar-Solis #approach #constraints #learning #parsing #semantics

Learning Semantic Parsers: A Constraint Handling Rule Approach (DAS), pp. 447–448.

IJCAR-2006-GelderS #automation #generative #higher-order #logic #parsing

Extending the TPTP Language to Higher-Order Logic with Automated Parser Generation (AVG, GS), pp. 156–161.

LDTA-2005-JohnstoneS #parsing #recursion #reduction

Recursion Engineering for Reduction Incorporated Parsers (AJ, ES), pp. 143–160.

FATES-2005-ZelenovZ #automation #generative #parsing #testing

Automated Generation of Positive and Negative Tests for Parsers (SVZ, SAZ), pp. 187–202.

CC-2004-McPeakN #generative #glr #named #parsing #performance

Elkhound: A Fast, Practical GLR Parser Generator (SM, GCN), pp. 73–88.

WCRE-2003-Latendresse #generative #lightweight #named #regular expression #robust #semiparsing

RegReg: a Lightweight Generator of Robust Parsers for Irregular Languages (ML), pp. 206–215.

CIAA-2003-BravoN #parsing

Building Context-Sensitive Parsers from CF Grammars with Regular Control Language (CB, JJN), pp. 306–308.

ICFP-2003-HughesS #parsing

Polish parsers, step by step (RJMH, SDS), pp. 239–248.

SAC-2003-MernikGZB #parsing #question

Can a Parser be Generated from Examples? (MM, GG, VZ, BRB), pp. 1063–1067.

CC-2003-JohnstoneS #generalised parsing #parsing

Generalised Regular Parsers (AJ, ES), pp. 232–246.

CIAA-2002-Okhotin02a #boolean grammar #generative #parsing

Whale Calf, a Parser Generator for Conjunctive Grammars (AO), pp. 213–220.

ECOOP-2002-NeumannZ #case study #design #implementation #interpreter #parsing #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 #parsing #programming #xml

A Better XML Parser through Functional Programming (OK), pp. 209–224.

CC-2002-BrandSVV #ambiguity #glr #parsing

Disambiguation Filters for Scannerless Generalized LR Parsers (MvdB, JS, JJV, EV), pp. 143–158.

WCRE-2001-Moonen #generative #robust #semiparsing #using

Generating Robust Parsers Using Island Grammars (LM), p. 13–?.

CIAA-2001-FarreG #bound #parsing

Bounded-Graph Construction for Noncanonical Discriminating-Reverse Parsers (JF, JFG), pp. 101–114.

CC-2001-FarreG #bound #parsing

A Bounded Graph-Connect Construction for LR-regular Parsers (JF, JFG), pp. 244–258.

ICPR-v2-2000-SopenaA #named #network #parsing

ANNP: A Neural Network Parser for Real World Texts (JMS, MAA), pp. 2969–2972.

TOOLS-PACIFIC-2000-ButlerM #attribute grammar #generative #named #parsing

YooccLa: A Parser Generator for L-Attributed Grammars (GB, CM), pp. 214–227.

CL-2000-Liang #generative #logic programming #parsing #programming language

A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language (CL), pp. 1315–1329.

IFL-1998-KoopmanP #combinator #parsing #performance

Efficient Combinator Parsers (PWMK, MJP), pp. 120–136.

WIA-1997-AlonsoCF #glr #parsing #performance

Construction of Efficient Generalized LR Parsers (MAA, DC, MVF), pp. 7–24.

AFP-1996-SwierstraD96 #combinator #parsing

Deterministic, Error-Correcting Combinator Parsers (SDS, LD), pp. 184–207.

SAC-1996-Turner #generative #named #parsing

SNACC: a parser generator for use with Miranda (DAT), pp. 401–407.

CC-1996-McLeanH #earley #parsing #performance

A Faster Earley Parser (PM, RNH), pp. 281–293.

ICDAR-v1-1995-BunkeL #classification #documentation #parsing #using

Classification and postprocessing of documents using an error-correcting parser (HB, RL), pp. 222–226.

DLT-1995-Galvez #lr #parsing #stack

A Practical Small LR Parser with Action Decision Through Minimal Stack Suffix Scanning (JFG), pp. 460–465.

DLT-1995-Gramatovici #parsing

Introducing the Operational Parser (RG), pp. 466–471.

AFP-1995-Fokker95 #functional #parsing

Functional Parsers (JF), pp. 1–23.

ECOOP-1995-Florijn #functional #parsing #protocol

Object Protocols as Functional Parsers (GF), pp. 351–373.

SAC-1995-AllenB #adaptation #parsing

A unification-based adaptive parser (CSA, BRB), pp. 282–287.

SAC-1994-Lutsky #documentation #parsing #testing #using

Using a document parser to automate software testing (PL), pp. 59–63.

ICDAR-1993-HongH #parsing #probability #recognition

Text recognition enhancement with a probabilistic lattice chart parser (TH, JJH), pp. 222–225.

PEPM-1993-Mossin #parsing #partial evaluation

Partial Evaluation of General Parsers (CM), pp. 13–21.

LFP-1992-RauglaudreM #ml #parsing

Parsers in ML (DdR, MM), pp. 76–85.

CC-1992-Galvez #generative #lr #parsing

Generating LR(1) Parsers of Small Size (JFG), pp. 16–29.

JICSLP-1992-Hodas #dependence #logic programming #programming language #semiparsing #specification

Specifying Filler-Gap Dependency Parsers in a Linear-Logic Programming Language (JSH), pp. 622–636.

CHI-1991-HelmMO #parsing #visual notation

Building visual language parsers (RH, KM, MO), pp. 105–112.

CC-1990-AlblasS #generative

An Attributed ELL(1)-Parser Generator (Abstract) (HA, JSK), pp. 208–209.

CC-1990-Horspool #parsing #recursion

Recursive Ascent-Descent Parsers (RNH), pp. 1–10.

CC-1990-Larcheveque #compilation #incremental #lalr #parsing #using

Using an LALR Compiler Compiler to Generate Incremental Parsers (JML), pp. 147–164.

CC-1990-Pfahler #execution #lr #optimisation #parsing

Optimizing Directly Executable LR Parsers (PP), pp. 179–192.

DAC-1989-BamjiA #grammarware #named #parsing

GRASP: A Grammar-based Schematic Parser (CB, JA), pp. 448–453.

PLDI-1989-Cormack #fault #lr #parsing #string #syntax

An LR Substring Parser for Noncorrecting Syntax Error Recovery (GVC), pp. 161–169.

PLDI-1989-HeeringKR #generative #incremental #parsing

Incremental Generation of Parsers (JH, PK, JR), pp. 179–191.

FPCA-1989-Mauny #embedded #functional #parsing

Parsers and Printers as Stream Destructors and Constructors Embedded in Functional Languages (MM), pp. 360–370.

SIGIR-1989-MetzlerH #information retrieval #parsing

The Constituent Object Parser: Syntactic Structure Matching for Information Retrieval (DPM, SWH), pp. 117–126.

CCHSC-1988-Horspool #generative #incremental #lalr #named #parsing

ILALR: An Incremental Generator of LALR(1) Parsers (RNH), pp. 128–136.

JICSCP-1988-TrehanW88 #commit #logic #nondeterminism #parallel #parsing

A Parallel Chart Parser for the Committed Choice Non-Deterministic Logic Languages (RT, PFW), pp. 212–232.

SIGIR-1986-BerrutP #automation #parsing

Solving Grammatical Ambiguities within a Surface Syntactical Parser for Automatic Indexing (CB, PP), pp. 123–130.

SLP-1984-UeharaOKT84 #bibliography #bottom-up #implementation #logic #parsing

A Bottom-Up Parser Based on Predicate Logic: A Survey of the Formalism and its Implementation Technique (KU, RO, OK, JT), pp. 220–227.

SCC-1982-MauneyF #algorithm #ll #lr #parsing

A Forward Move Algorithm for LL and LR Parsers (JM, CNF), pp. 79–87.

POPL-1982-JaliliG #parsing

Building Friendly Parsers (FJ, JHG), pp. 196–206.

ICALP-1981-Ukkonen #bound #on the #parsing

On Size Bounds for Deterministic Parsers (EU), pp. 218–228.

CADE-1980-Gloess #correctness #empirical #parsing #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.

SCC-1979-PaiK #fault #parsing #syntax

Global context recovery: A new strategy for parser recovery from syntax errors (ABP, RBK), pp. 158–167.

ICALP-1979-Deussen #algorithm #parsing

One Abstract Accepting Algorithm for all Kinds of Parsers (PD), pp. 203–217.

ICALP-1979-SippuS #ll #on the #parsing

On Constructing LL(k) Parsers (SS, ESS), pp. 585–595.

ICALP-1979-Ukkonen #bottom-up #lr #parsing

A Modification of the LR(k) Method for Constructing Compact Bottom-Up Parsers (EU), pp. 646–658.

ICALP-1977-BensonJ #composition #lr #parallel #parsing

Parallel Decomposition of LR(k) Parsers (Extended Abstract) (DBB, RDJ), pp. 76–86.

POPL-1977-FischerMQ #ll #parsing #performance

An Efficient Insertion-Only Error-Corrector for LL(1) Parsers (CNF, DRM, SBQ), pp. 97–103.

POPL-1977-Soisalon-Soininen #lr #parsing #reduction

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 #parsing #reduction

On Directly Constructing LR(k) Parsers Without Chain Reductions (WRL), pp. 127–133.

ICALP-1974-Lang #nondeterminism #parsing #performance

Deterministic Techniques for Efficient Non-Deterministic Parsers (BL), pp. 255–269.

ICALP-1974-Pager #lr #on the #parsing

On Eliminating Unit Productions from LR(k) Parsers (DP), pp. 242–254.

STOC-1973-Pager #algorithm #lr #parsing

The Lane Tracing Algorithm for Constructing LR(k) Parsers (DP), pp. 172–181.

STOC-1972-AhoU #lr #parsing

A Technique for Speeding Up LR(k) Parsers (AVA, JDU), pp. 251–263.

STOC-1971-Terrine #algorithm #bottom-up #context-free grammar #generative #parsing #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 #parsing

The Design of Parsers for Incremental Language Processors (GL), pp. 81–91.