Results 141 to 150 of about 362 (165)

An attribute language definition for adaptable parsing expression grammars

Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019
Adaptable Parsing Expression Grammars (APEG) are a formal model whose main purpose is to formally describe the syntax of extensible languages and their extension mechanisms. APEG extends Parsing Expression Grammar model with the notion of syntactic attributes, which are values passed through parse tree nodes and used during the parsing process.
Elton M. Cardoso, Rodrigo Geraldo Ribeiro, Leonardo Vieira dos Santos Reis, Mariza A. S. Bigonha, Roberto S. Bigonha, Vladimir Oliveira Di Iorio   +5 more
openaire   +1 more source

BITES Instead of FIRST for Parsing Expression Grammar

Fundamenta Informaticae, 2011
In an earlier paper, the author adapted to Parsing Expression Grammars (PEGs) the properties FIRST and FOLLOW used in the construction of predictive top-down parsers. The purpose was to obtain warnings for possible “language hiding”. It turned out that FIRST does not work well with lookahead expressions.
openaire   +2 more sources

Applying Classical Concepts to Parsing Expression Grammar

Fundamenta Informaticae, 2009
The paper is an attempt to see how much we can learn about a given Parsing Expression Grammar with the help of classical concepts used in the construction of predictive top-down parsers.
openaire   +2 more sources

A symbol-based extension of parsing expression grammars and context-sensitive packrat parsing

Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, 2017
Parsing expression grammars (PEGs) are a powerful and popular foundation for describing syntax. Despite PEGs' expressiveness, they cannot recognize many syntax patterns of popular programming languages. Typical examples include typedef-defined names in C/C++ and here documents appearing in many scripting languages.
openaire   +1 more source

A Haskell Library for Adaptable Parsing Expression Grammars

Proceedings of the XXVII Brazilian Symposium on Programming Languages, 2023
Elton Maximo Cardoso, Rodrigo Geraldo Ribeiro, Leonardo Vieira dos Santos Reis, Marcos Emiliano   +3 more
openaire   +1 more source

Top-Down Online Handwritten Mathematical Expression Parsing with Graph Grammar

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 D. Julca-Aguilar, Harold Mouchère, Christian Viard-Gaudin, Nina S. T. Hirata   +3 more
openaire   +2 more sources

Parsing Expression Grammar and Packrat Parsing—A Review

2022
Nikhil S. Mangrulkar, Kavita R. Singh, Mukesh M. Raghuwanshi   +2 more
openaire   +1 more source

Type-based Termination Analysis for Parsing Expression Grammars

Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, 2023
Elton M. Cardoso, Regina De Paula, Daniel Pereira, Leonardo Reis, Rodrigo Geraldo Ribeiro   +4 more
openaire   +1 more source

Parsing expression grammar as a primitive recursive-descent parser with backtracking

Fundam. Informaticae, 2007
Summary: Two recent developments in the field of formal languages are Parsing Expression Grammar (PEG) and packrat parsing. The PEG formalism is similar to BNF, but defines syntax in terms of recognizing strings, rather than constructing them. It is, in fact, precise specification of a backtracking recursive-descent parser. Packrat parsing is a general
openaire   +2 more sources

The computational power of parsing expression grammars

Journal of Computer and System Sciences, 2020
Bruno Loff, Rogerio Reis, Nelma Moreira   +2 more
exaly