Results 21 to 30 of about 27,476 (181)
parboiled2: a macro-based approach for effective generators of parsing expressions grammars in Scala [PDF]
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
Parsing Expression Grammars with Unordered Choices
Nariyoshi Chida, Kimio Kuramitsu
openalex +3 more sources
Recognising and Generating Terms using Derivatives of Parsing Expression Grammars [PDF]
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
The formalization and implementation of Adaptable Parsing Expression Grammars
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
Computational Model for Parsing Expression Grammars
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
Local Search and the Evolution of World Models
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
Towards automatic error recovery in parsing expression grammars [PDF]
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
Probabilistic mathematical formula recognition using a 2D context-free graph grammar [PDF]
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
Implementation of Tamias to Check Production Rules for Parsing Expression Grammar
Tetsuro Katayama +5 more
openalex +2 more sources
Adaptable Parsing Expression Grammars [PDF]
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
openaire +1 more source

