Results 11 to 20 of about 383 (145)
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
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 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.
Leonardo Vieira dos Santos Reis +3 more
openalex +3 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 Mozzherin +2 more
openalex +4 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
On the relation between context-free grammars and parsing expression grammars [PDF]
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.
Fabio Mascarenhas +2 more
openalex +4 more sources
Top-Down Online Handwritten Mathematical Expression Parsing with Graph Grammar [PDF]
, 2015 In recognition of online handwritten mathematical expressions, symbol segmentation and classification and recognition of relations among symbols is managed through a parsing technique. Most parsing techniques follow a bottom-up approach and adapt grammars typically used to parse strings.
Frank Julca-Aguilar +3 more
openalex +3 more sources
Towards automatic error recovery in parsing expression grammars [PDF]
Proceedings of the XXII Brazilian Symposium on Programming Languages, 2018 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.Parsing Expressions Grammars (PEGs) are a formalism that naturally ...
Sérgio Queiróz de Medeiros +1 more
openalex +2 more sources
Adaptable Parsing Expression Grammars [PDF]
, 2012 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 analyzers do not offer any desirable resources for the specification of extensible languages.
Leonardo Vieira dos Santos Reis +3 more
openalex +2 more sources