Efficient divide-and-conquer parsing of practical context-free languages
From MaRDI portal
Publication:5244794
DOI10.1145/2500365.2500576zbMath1323.68329OpenAlexW1970760500MaRDI QIDQ5244794
Jean-Philippe Bernardy, Koen Claessen
Publication date: 30 March 2015
Published in: Proceedings of the 18th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2500365.2500576
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)
Related Items (2)
Algebraic dynamic programming for multiple context-free grammars ⋮ Efficient parallel and incremental parsing of practical context-free languages
This page was built for publication: Efficient divide-and-conquer parsing of practical context-free languages
