23 citations · 86 across the 7 of their papers we have counts for
8 papers
Towards Automatic Error Recovery in Parsing Expression
Sérgio Queiroz de Medeiros, Fabio Mascarenhas
Error recovery is an essential feature for a parser that should be plugged in Integrated Development Environments (IDEs), which must build Abstract Syntax Trees (ASTs) even for syn…
Automatic Syntax Error Reporting and Recovery in Parsing Expression Grammars
Sérgio Queiroz de Medeiros, Gilney de Azevedo Alvez Junior, Fabio Mascarenhas
Error recovery is an essential feature for a parser that should be plugged in Integrated Development Environments (IDEs), which must build Abstract Syntax Trees (ASTs) even for syn…
Syntax Error Recovery in Parsing Expression Grammars
Sérgio Medeiros, Fabio Mascarenhas
Parsing Expression Grammars (PEGs) are a formalism used to describe top-down parsers with backtracking. As PEGs do not provide a good error recovery mechanism, PEG-based parsers us…
Decoding Lua: Formal Semantics for the Developer and the Semanticist
Mallku Soldevila, Beta Ziliani, Bruno Silvestre +2
We provide formal semantics for a large subset of the Lua programming language, in its version 5.2. We validate our model by mechanizing it and testing it against the test suite of…
Error Reporting in Parsing Expression Grammars
André Murbach Maidl, Sérgio Medeiros, Fabio Mascarenhas +1
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 b…
On the Relation between Context-Free Grammars and Parsing Expression Grammars
Fabio Mascarenhas, Sérgio Medeiros, Roberto Ierusalimschy
Context-Free Grammars (CFGs) and Parsing Expression Grammars (PEGs) have several similarities and a few differences in both their syntax and semantics, but they are usually present…
From Regexes to Parsing Expression Grammars
Sérgio Medeiros, Fabio Mascarenhas, Roberto Ierusalimschy
Most scripting languages nowadays use regex pattern-matching libraries. These regex libraries borrow the syntax of regular expressions, but have an informal semantics that is diffe…
Left Recursion in Parsing Expression Grammars
Sérgio Medeiros, Fabio Mascarenhas, Roberto Ierusalimschy
Parsing Expression Grammars (PEGs) are a formalism that can describe all deterministic context-free languages through a set of rules that specify a top-down parser for some languag…