CfPBoK
by
Vadim Zaytsev
sle2014/paper13
SLE 2014
paper:
Simple, Efficient, Sound and Complete Combinator Parsing for All Context-Free Grammars, Using an Oracle
Tom Ridge
DOI:
10.1007/978-3-319-11245-9_15
T5B: Language Description Analysis
The paper advances parsing technology for context-free grammars via parser combinators.
T5F: Performance
It focuses on improving the efficiency/performance of sound-and-complete combinator parsing.
T5D: Formal Methods
It builds on prior formal soundness/completeness results (e.g., mechanised in a theorem prover).
T3A: Meta-languages
Parser combinators are a metalanguage/embedded formalism for specifying parsers from grammars.
The page is maintained by
Dr. Vadim Zaytsev
a.k.a. @
grammarware
. Last updated: June 2026.