Results 1 to 10 of about 70 (63)
Parsing Expression Grammars and Their Induction Algorithm [PDF]
Applied Sciences (Switzerland), 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 ...
Łukasz Strak +2 more
exaly +5 more sources
Cigale: A tool for interactive grammar construction and expression parsing
Science of Computer Programming, 1986 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +4 more sources
Parsing expression grammars made practical [PDF]
Proceedings of the 2015 ACM SIGPLAN International Conference on Software Language Engineering, 2015 "Proceedings of the International Conference on Software Language Engineering (SLE 2015)" - 167-172 (ISBN : 978-1-4503-3686-4)
Nicolas Laurent, Kim Mens
openaire +8 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 +6 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. Since these operators are not explicitly defined in the classic formal language theory, it is significant and still challenging to argue PEGs' expressiveness in the context
Nariyoshi Chida, Kimio Kuramitsu
openaire +2 more sources
Adaptable Parsing Expression Grammars [PDF]
, 2012 The term "extensible language" is especially used when a language allows the extension of its own concrete syntax and the definition of the semantics of new constructs. Most popular tools designed for automatic generation of syntactic analyzers do not offer any desirable resources for the specification of extensible languages.
Leonardo Vieira dos Santos Reis +3 more
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.
Sérgio Medeiros 0001, Fabio Mascarenhas
openaire +2 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 +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
Error reporting in Parsing Expression Grammars
Science of Computer Programming, 2016 Preprint (plus appendix) submitted to Science of Computer ...
André Murbach Maidl +3 more
openaire +4 more sources