Results 11 to 20 of about 51,328 (185)
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 a recursive-descent parser that recognises them. The PEG formalism exhibits desirable properties, such as closure under composition, built-in disambiguation, unification of syntactic and ...
Nicolas Laurent, Kim Mens
semanticscholar +10 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 ...
Aaron Moss
doaj +7 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.
Wojciech Wieczorek +2 more
doaj +6 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.
Fabio Mascarenhas +2 more
core +6 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 Parsing expression grammars (PEGs) offer a natural opportunity for building verified parser interpreters based on higher-order parsing combinators. PEGs are expressive, unambiguous, and efficient to parse in a top-down recursive descent style. We use the
Clément Blaudeau, Natarajan Shankar
semanticscholar +5 more sources
Parsing Expression Grammars with Unordered Choices
Journal of Information Processing, 2017 Parsing expression grammars (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.
Nariyoshi Chida, Kimio Kuramitsu
semanticscholar +5 more sources
Implementation of Tamias to Check Production Rules for Parsing Expression Grammar
Journal of Robotics, Networking and Artificial Life, 2019 Backus–Naur Form (BNF) can express type-2 grammar (CFG: Context-Free Grammar) in the Chomsky hierarchy. Although BNF is traditionally used in the syntax definition of programming languages, it is possible to describe ambiguous grammar (e.g. dangling-else
Tetsuro Katayama +5 more
semanticscholar +4 more sources
Tamias: a Syntax File Checker for Parsing Expression Grammar
Proceedings of International Conference on Artificial Life and Robotics, 2019 Toshihiro Miyaji +5 more
semanticscholar +3 more sources
TRX: A Formally Verified Parser Interpreter [PDF]
Logical Methods in Computer Science, 2011 Parsing is an important problem in computer science and yet surprisingly little attention has been devoted to its formal verification. In this paper, we present TRX: a parser interpreter formally developed in the proof assistant Coq, capable of producing
Adam Koprowski, Henri Binsztok
doaj +4 more sources
Top-Down Online Handwritten Mathematical Expression Parsing with Graph Grammar [PDF]
Iberoamerican Congress on Pattern Recognition, 2015 In recognition of online handwritten mathematical expressions, symbol segmentation and classification and recognition of relations among symbols is managed through a parsing technique. Most parsing techniques follow a bottom-up approach and adapt grammars typically used to parse strings.
Frank Julca-Aguilar +3 more
semanticscholar +5 more sources