André Murbach Maidl
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
André Murbach Maidl has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Fabio Mascarenhas
Department of Computer Science UFRJ -Rio de Janeiro Brazil
2 shared publications - Roberto Ierusalimschy
PUC-Rio
2 shared publications - Sérgio Queiroz de Medeiros
UFRN
2 shared publications
Latest Publications
- 20 August 2016
- Published by Elsevier in Science of Computer Programming
- Vol. 132, 129-140
Error reporting in Parsing Expression Grammars
- 20 August 2016
- Published by Elsevier in Science of Computer Programming
- Vol. 132, 129-140
Error reporting in Parsing Expression Grammars
- Open Access
Error Reporting in Parsing Expression Grammars
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.
Open AccessError Reporting in Parsing Expression Grammars
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.