Results 11 to 20 of about 133,940 (200)
Recognising and Generating Terms using Derivatives of Parsing Expression Grammars [PDF]
arXiv, 2018 Grammar-based sentence generation has been thoroughly explored for Context-Free Grammars (CFGs), but remains unsolved for recognition-based approaches such as Parsing Expression Grammars (PEGs). Lacking tool support, language designers using PEGs have difficulty predicting the behaviour of their parsers. In this paper, we extend the idea of derivatives,
Garnock-Jones, Tony +2 more
arxiv +5 more sources
parboiled2: a macro-based approach for effective generators of parsing expressions grammars in Scala [PDF]
arXiv, 2019 In today's computerized world, parsing is ubiquitous. Developers parse logs, queries to databases and websites, programming and natural languages. When Java ecosystem maturity, concise syntax, and runtime speed matters, developers choose parboiled2 that generates grammars for parsing expression grammars (PEG).
Alexander A. Myltsev
arxiv +5 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 +2 more
+8 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 +7 more
core +3 more sources
From regexes to parsing expression grammars [PDF]
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 ...
Roberto Ierusalimschy +2 more
openaire +3 more sources
The formalization and implementation of Adaptable Parsing Expression Grammars
Science of Computer Programming, 2014 The term "extensible language" is especially used when a language allows the extension of its own concrete syntax and the definition of the semantics of new constructs. Most popular tools designed for automatic generation of syntactic analysers do not offer any adequate resources for the specification of extensible languages.
Luis Eduardo de Souza Amorim +3 more
openaire +3 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.
Shin-ya Hamaguchi, Kimio Kuramitsu
+5 more sources
“gnparser”: a powerful parser for scientific names based on Parsing Expression Grammar [PDF]
BMC Bioinformatics, 2017 Scientific names in biology act as universal links. They allow us to cross-reference information about organisms globally. However variations in spelling of scientific names greatly diminish their ability to interconnect data. Such variations may include abbreviations, annotations, misspellings, etc.
Dmitry Y. Mozzherin +2 more
openaire +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.
Rubtsov, Alexander, Chudinov, Nikita
openaire +5 more sources
A Declarative Extension of Parsing Expression Grammars for Recognizing Most Programming Languages
Journal of Information Processing, 2016 To appear in Journal of Information Processing, 24(2 ...
Tetsuro Matsumura, Kimio Kuramitsu
+8 more sources