A parsing machine for parsing expression grammars with labeled failures

Sérgio Queiróz de Medeiros, Fabio Mascarenhas · 2016

Parsing Expression Grammars (PEGs) are a formalism for specifying the syntax of programming languages which can be viewed as a description of a recursive descent parser for the language it describes. An issue that users of PEG-based parsers face is poor reporting of syntax errors on the part of PEG-based parsers. Labeled failures are an extension to PEGs that aims to address this issue by annotating a PEG with labels corresponding to syntax errors, improving the quality of error messages generated by a PEG-based parser.

Read the paper · More papers on PaperTik