Results 1 to 10 of about 362 (165)
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 +4 more sources
Left Recursion in Parsing Expression Grammars [PDF]
Lecture Notes in Computer Science, 2012 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 Queiroz De Medeiros +2 more
exaly +7 more sources
Error reporting in Parsing Expression Grammars
Science of Computer Programming, 2016 Preprint (plus appendix) submitted to Science of Computer ...
Sérgio Queiroz De Medeiros +2 more
exaly +4 more sources
From regexes to parsing expression grammars
Science of Computer Programming, 2014 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 Queiroz De Medeiros +2 more
exaly +3 more sources
On the relation between context-free grammars and parsing expression grammars
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. In this paper we present a new formalism for CFGs that highlights the similarities and differences between them.
Sérgio Queiroz De Medeiros +2 more
exaly +4 more sources
Automatic syntax error reporting and recovery in parsing expression grammars [PDF]
Science of Computer Programming, 2020 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 Queiroz De Medeiros +1 more
exaly +4 more sources
Journal of Visual Languages and Computing, 2018 تحليل قواعد التعبير (PEGs) هي شكلية تستخدم لوصف التحليل من أعلى إلى أسفل مع التراجع. نظرًا لأن PEGs لا توفر آلية جيدة لاسترداد الأخطاء، فإن المحللين المعتمدين على PEG لا يتعافون عادةً من أخطاء بناء الجملة في الإدخال، أو يتعافون من أخطاء بناء الجملة باستخدام ميزات مخصصة خاصة بالتنفيذ.
Sérgio Queiroz De Medeiros +1 more
exaly +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 +1 more source
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 +3 more sources