Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6875197 | Science of Computer Programming | 2018 | 32 Pages |
Abstract
In this work we present a language-agnostic solution. We optimize the performance of parsing combinators with specializations of parsing strategies. For each combinator, we analyze the language parsed by the combinator and choose the most efficient parsing strategy. By adapting a parsing strategy for different parser combinators we achieve performance comparable to that of hand-written or optimized parsers while preserving the advantages of parsers combinators.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jan Kurš, Jan Vraný, Mohammad Ghafari, Mircea Lungu, Oscar Nierstrasz,