Results 21 to 30 of about 28,083 (188)
CONVERSÃO DE REGEXES PARA PARSING EXPRESSION GRAMMARS [PDF]
, 2010 MARCELO OIKAWA
openalex +2 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
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
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
Implementation of Tamias to Check Production Rules for Parsing Expression Grammar
Journal of Robotics, Networking and Artificial Life, 2019 Tetsuro Katayama +5 more
openalex +2 more sources
parboiled2: a macro-based approach for effective generators of parsing expressions grammars in Scala [PDF]
, 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
openalex +3 more sources
Probabilistic mathematical formula recognition using a 2D context-free graph grammar [PDF]
, 2011 We present a probabilistic framework for the mathematical expression recognition problem. The developed system is flexible in that its grammar can be extended easily thanks to its graph grammar which eliminates the need for specifying rule precedence. It
Celik, Mehmet +3 more
core +3 more sources
Recognising and Generating Terms using Derivatives of Parsing Expression Grammars [PDF]
, 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,
Tony Garnock-Jones +2 more
openalex +3 more sources
Local Search and the Evolution of World Models
Topics in Cognitive Science, EarlyView., 2023 Abstract An open question regarding how people develop their models of the world is how new candidates are generated for consideration out of infinitely many possibilities. We discuss the role that evolutionary mechanisms play in this process. Specifically, we argue that when it comes to developing a global world model, innovation is necessarily ...
Neil R. Bramley +3 more
wiley +1 more source