Results 21 to 30 of about 51,328 (185)
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.
Frédéric Voisin
semanticscholar +7 more sources
Exception Handling for Error Reporting in Parsing Expression Grammars [PDF]
Brazilian Symposium on Programming Languages, 2013 Parsing Expression Grammars (PEGs) are a new formalism to describe a top-down parser of a language. However, error handling techniques that are often applied to top-down parsers are not directly applicable to PEGs. This problem is usually solved in PEGs using a heuristic that helps to simulate the error reporting technique from top-down parsers, but ...
André Murbach Maidl +2 more
semanticscholar +4 more sources
CPEG: a typed tree construction from parsing expression grammars with regex-like captures [PDF]
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2018 CPEG is an extended parsing expression grammar with regex-like capture annotation. Two annotations (capture and left-folding) allow a flexible construction of syntax trees from arbitrary parsing patterns.
Daisuke Yamaguchi, Kimio Kuramitsu
semanticscholar +5 more sources
From regexes to parsing expression grammars [PDF]
Science of Computer Programming, 2012 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 different from the semantics of regular expressions, removing the commutativity of alternation and adding ad-hoc extensions that cannot be expressed by formalisms for efficient ...
Sérgio Queiróz de Medeiros +2 more
openalex +3 more sources
The computational power of parsing expression grammars [PDF]
Journal of Computer and System Sciences, 2020 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
openalex +5 more sources
Computational Model for Parsing Expression Grammars [PDF]
We present a computational model for Parsing Expression Grammars (PEGs). The predecessor of PEGs top-down parsing languages (TDPLs) were discovered by A. Birman and J. Ullman in the 1960-s, B. Ford showed in 2004 that both formalisms recognize the same class named Parsing Expression Languages (PELs). A. Birman and J.
Alexander A. Rubtsov, Nikita Chudinov
openalex +5 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 Queiróz de Medeiros +1 more
openalex +4 more sources
XML schema validation using parsing expression grammars
, 2015 Schema validation is an integral part of reliable information exchange on the Web. However, implementing an efficient schema validation tool is not easy. We highlight the use of parsing expression grammars (PEGs), a recognition-based foundation for describing syntax, and apply it to the XML/DTD validation.
Kimio Kuramitsu, Shin’ya Yamaguchi
+5 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
openalex +5 more sources
CONVERSÃO DE REGEXES PARA PARSING EXPRESSION GRAMMARS [PDF]
, 2010 MARCELO OIKAWA
openalex +2 more sources