Results 11 to 20 of about 27,476 (181)
Left recursion in Parsing Expression Grammars [PDF]
Science of Computer Programming, 2014 Las gramáticas de expresión de análisis (PEG) son un formalismo que puede describir todos los lenguajes libres de contexto deterministas a través de un conjunto de reglas que especifican un analizador de arriba hacia abajo para algún lenguaje. Los PEG son fáciles de usar y hay implementaciones eficientes de bibliotecas de PEG en varios lenguajes de ...
Sérgio Queiróz de Medeiros +2 more
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
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
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
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
Automatic syntax error reporting and recovery in parsing expression grammars [PDF]
Science of Computer Programming, 2019 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 syntactically invalid programs in order to offer features such as automated refactoring and code completion.
Sérgio Queiróz de Medeiros +2 more
+8 more sources
CONVERSÃO DE REGEXES PARA PARSING EXPRESSION GRAMMARS [PDF]
, 2010 MARCELO OIKAWA
openalex +2 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
XML schema validation using parsing expression grammars [PDF]
, 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
+4 more sources
Parsing Expression Grammar and Packrat Parsing – A Review
Journal of University of Shanghai for Science and Technology, 2020 Bryan Ford presented Parsing Expression Grammars (PEGs) as an alternative to specify rules for programming language, along with a Packrat parser, based on an idea of memoization. The idea proposed by B. Ford guarantees parsing of grammar written using PEGs in linear time in spite of backtracking. The primary aim of the paper is to highlight the details
Nikhil Mangrulkar S +3 more
openalex +2 more sources