Results 1 to 10 of about 11,934 (173)
Parsing Expression Grammars Made Practical [PDF]
Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering, 2015 Parsing Expression Grammars (PEGs) define languages by specifying recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and ...
Laurent, Nicolas, Mens, Kim
core +5 more sources
Linear Parsing Expression Grammars [PDF]
, 2017 PEGs were formalized by Ford in 2004, and have several pragmatic operators (such as ordered choice and unlimited lookahead) for better expressing modern programming language syntax.
A Birman +10 more
core +3 more sources
On the Relation between Context-Free Grammars and Parsing Expression Grammars [PDF]
Science of Computer Programming, 2014 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 presented through formalisms that hinder a proper comparison.
Ierusalimschy, Roberto +2 more
core +4 more sources
Left Recursion in Parsing Expression Grammars [PDF]
Science of Computer Programming, 2014 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 language.
Aho +37 more
core +5 more sources
Error Reporting in Parsing Expression Grammars
Science of Computer Programming, 2016 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 ...
Ierusalimschy, Roberto +3 more
core +4 more sources
Parsing Expression Grammars and Their Induction Algorithm [PDF]
Applied Sciences, 2020 Grammatical inference (GI), i.e., the task of finding a rule that lies behind given words, can be used in the analyses of amyloidogenic sequence fragments, which are essential in studies of neurodegenerative diseases. In this paper, we developed a new method that generates non-circular parsing expression grammars (PEGs) and compares it with other GI ...
Wojciech Wieczorek +2 more
openaire +4 more sources
The Computational Power of Parsing Expression Grammars [PDF]
Journal of Computer and System Sciences, 2018 We study the computational power of parsing expression grammars (PEGs). We begin by constructing PEGs with unexpected behaviour, and surprising new examples of languages with PEGs, including the language of palindromes whose length is a power of two, and a binary-counting language.
Bruno Loff, Nelma Moreira, Rogério Reis
openaire +4 more sources
A verified packrat parser interpreter for parsing expression grammars [PDF]
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020 15 pages, 15 figures, Certified Proofs and ...
Clement Blaudeau, Natarajan Shankar
openaire +2 more sources
Syntax error recovery in parsing expression grammars [PDF]
Proceedings of the 33rd Annual ACM Symposium on Applied Computing, 2018 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 usually do not recover from syntax errors in the input, or recover from syntax errors using ad-hoc, implementation-specific features.
Fabio Mascarenhas, Sérgio Medeiros
openaire +3 more sources
Derivatives of Parsing Expression Grammars [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 This paper introduces a new derivative parsing algorithm for recognition of parsing expression grammars. Derivative parsing is shown to have a polynomial worst-case time bound, an improvement on the exponential bound of the recursive descent algorithm.
openaire +3 more sources