Error Reporting in Parsing Expression Grammars
Preprint
Abstract
Parsing Expression Grammars (PEGs) describe top-down parsers. Unfortunately, the error-reporting techniques used in conventional top-down parsers do not directly apply to parsers based on Parsing Expression Grammars (PEGs), so they have to be somehow simulated. While the PEG formalism has no account of semantic actions, actual PEG implementations add them, and we show how to simulate an error-reporting heuristic through these semantic actions. We also propose a complementary error reporting strategy that may lead to better error messages: labeled failures. This approach is inspired by exception handling of programming languages, and lets a PEG define different kinds of failure, with each ordered choice operator specifying which kinds it catches. Labeled failures give a way to annotate grammars for better error reporting, to express some of the error reporting strategies used by deterministic parser combinators, and to encode predictive top-down parsing in a PEG.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- On the relation between context-free grammars and parsing expression grammarsScience of Computer Programming, 2014
- Typed Lua2014
- When Maybe is not good enoughJournal of Functional Programming, 2012
- Left Recursion in Parsing Expression Grammars2012
- LL(*)2011
- Better extensibility through modular syntax2006
- Generating LR syntax error messages from examplesACM Transactions on Programming Languages and Systems, 2003
- Predictive parser combinators need four values to report errorsJournal of Functional Programming, 1996
- Higher-order functions for parsingJournal of Functional Programming, 1992