Simplified Parsing Expression Derivatives
Formal Languages and Automata Theory
2018-08-28 v1
Abstract
This paper presents a new derivative parsing algorithm for parsing expression grammars; this new algorithm is both simpler and faster than the existing parsing expression derivative algorithm presented by Moss. This new algorithm improves on the worst-case space and runtime bounds of the previous algorithm by a linear factor, as well as decreasing runtime by about half in practice. A proof of correctness for the new algorithm is included in this paper, a result not present in earlier work.
Cite
@article{arxiv.1808.08893,
title = {Simplified Parsing Expression Derivatives},
author = {Aaron Moss},
journal= {arXiv preprint arXiv:1808.08893},
year = {2018}
}
Comments
14 pages, 3 figures