Results 21 to 30 of about 26,553 (178)
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
A text pattern‐matching tool based on Parsing Expression Grammars [PDF]
Software: Practice and Experience, 2008 AbstractCurrent text pattern‐matching tools are based on regular expressions. However, pure regular expressions have proven too weak a formalism for the task: many interesting patterns either are difficult to describe or cannot be described by regular expressions.
Roberto Ierusalimschy
openalex +2 more sources
Recognising and Generating Terms using Derivatives of Parsing Expression Grammars
, 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 +4 more sources
Tamias: a Syntax File Checker for Parsing Expression Grammar
Proceedings of International Conference on Artificial Life and Robotics, 2019 Toshihiro Miyaji +5 more
openalex +2 more sources
parboiled2: a macro-based approach for effective generators of parsing expressions grammars in Scala
, 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 +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 +4 more sources
Parsing Expression Grammars with Unordered Choices
Journal of Information Processing, 2017 Nariyoshi Chida, Kimio Kuramitsu
openalex +4 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
openalex +5 more sources
Quantification at a distance and grammatical illusions in French
Syntax, EarlyView., 2023 Abstract Recent research in psycholinguistics supports the hypothesis that retrieval from working memory is a key component of establishing syntactic dependencies in comprehension. This can result in so‐called grammatical illusions. These illusions have been modeled as the result of a content‐addressable retrieval process in sentence comprehension that
Jérémy Pasquereau +2 more
wiley +1 more source
Exception Handling for Error Reporting in Parsing Expression Grammars [PDF]
, 2013 Parsing Expression Grammars (PEGs) are a new formalism to describe a top-down parser of a language. However, error handling techniques that are often applied to top-down parsers are not directly applicable to PEGs. This problem is usually solved in PEGs using a heuristic that helps to simulate the error reporting technique from top-down parsers, but ...
André Murbach Maidl +2 more
openalex +3 more sources