Results 1 to 10 of about 383 (145)
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
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 +5 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
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
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
openalex +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
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
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
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
openalex +4 more sources