Results 21 to 30 of about 133,940 (200)

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
openaire   +2 more sources

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 ...
Fabio Mascarenhas, Roberto Ierusalimschy, André Murbach Maidl   +2 more
openaire   +3 more sources

Cigale: A tool for interactive grammar construction and expression parsing

Science of Computer Programming, 1986
AbstractIn this paper we present CIGALE, a system for incremental grammar construction and expressions parsing. It is designed to cope with the problem of parsing in environments which require an incremental definition of languages and a great flexibility in syntax. Its main application, parsing in an environmental for Abstract Data Types specification,
Frédéric Voisin
  +6 more sources

Multiword Expression Identification with Tree Substitution Grammars: A Parsing tour de force with French

, 2011
Multiword expressions (MWE), a known nui-sance for both linguistics and NLP, blur the lines between syntax and semantics. Previous work on MWE identification has relied primar-ily on surface statistics, which perform poorly for longer MWEs and cannot model discontin-uous expressions. To address these problems, we show that even the simplest parsing mod-
Green, Spence, de Marneffe, Marie-Catherine, Bauer, John, Manning, Christopher D.   +3 more
  +8 more sources

Parsing Expression Grammars with Unordered Choices

Journal of Information Processing, 2017
Nariyoshi Chida, Kimio Kuramitsu
openaire   +4 more sources

Tamias: a Syntax File Checker for Parsing Expression Grammar

Proceedings of International Conference on Artificial Life and Robotics, 2019
Yoshihiro Kita, Kentaro Aburada, Toshihiro Miyaji, Naonobu Okazaki, Hisaaki Yamaba, Tetsuro Katayama   +5 more
openaire   +2 more sources

CONVERSÃO DE REGEXES PARA PARSING EXPRESSION GRAMMARS [PDF]

, 2015
MARCELO OIKAWA
openaire   +2 more sources

Implementation of Tamias to Check Production Rules for Parsing Expression Grammar

Journal of Robotics, Networking and Artificial Life, 2019
Toshihiro Miyaji, Kentaro Aburada, Yoshihiro Kita, Hisaaki Yamaba, Naonobu Okazaki, Tetsuro Katayama   +5 more
openaire   +3 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 V. S. Reis, Roberto da Silva Bigonha, Luis Eduardo de Souza Amorim, Vladimir Oliveira Di Iorio   +3 more
openaire   +2 more sources

Recovering Grammar Relationships for the Java Language Specification [PDF]

, 2010
Grammar convergence is a method that helps discovering relationships between different grammars of the same language or different language versions.
A. Dubey, C. A. R. Hoare, D. A. Thomas, D. Barnard, E. Bouwers, H. H. Do, M. Di Penta, R. Lämmel, Ralf Lämmel, T. Dean, Vadim Zaytsev   +10 more
core   +7 more sources