A parsing machine for PEGs

Abstract

Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEGs is based on a recursive-descent parser, or uses a memoization algorithm. We present a new approach for implementing PEGs, based on a virtual parsing machine, which is more… (More)
DOI: 10.1145/1408681.1408683

Topics

5 Figures and Tables

Statistics

02040201520162017
Citations per Year

Citation Velocity: 9

Averaging 9 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@inproceedings{Medeiros2008APM, title={A parsing machine for PEGs}, author={S{\'e}rgio Medeiros and Roberto Ierusalimschy}, booktitle={DLS}, year={2008} }