Results 161 to 170 of about 146,311 (198)

Towards Typed Semantics for Parsing Expression Grammars

Proceedings of the XXIII Brazilian Symposium on Programming Languages, 2019
We describe the formalization of a type system for parsing expression grammars (PEG) which is equivalent to Ford's original fixpoint-based definition of well-formed PEGs. We use our type system definition to implement a functional big-step semantics for typed PEGs using the Agda programming language.
Rodrigo Ribeiro, Leonardo Vieira dos Santos Reis, Samuel da Silva Feitosa, Elton M. Cardoso   +3 more
openalex   +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.
Kimio Kuramitsu
openalex   +3 more sources

Optimization of * operator in Parsing Expression Grammar [PDF]

2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT), 2015
Packrat Parsing uses recursive decent parsing technique with memorization so that result will not be recomputed. The main advantage is that it allows the use of unlimited look ahead without constraints on the power and flexibility of backtracking. However, this is achieved at the cost of huge memory size.
Manish M. Goswami, Latesh Malik, Mukesh M. Raghuwanshi   +2 more
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

A parsing machine for parsing expression grammars with labeled failures

Proceedings of the 31st Annual ACM Symposium on Applied Computing, 2016
Parsing Expression Grammars (PEGs) are a formalism for specifying the syntax of programming languages which can be viewed as a description of a recursive descent parser for the language it describes. An issue that users of PEG-based parsers face is poor reporting of syntax errors on the part of PEG-based parsers.
Sérgio Medeiros, Fabio Mascarenhas
openaire   +2 more sources

Applying Classical Concepts to Parsing Expression Grammar [PDF]

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   +1 more source

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.
Roberto da Silva Bigonha, Vladimir Oliveira Di Iorio, Leonardo V. S. Reis, Rodrigo Ribeiro, Elton M. Cardoso, Mariza A. S. Bigonha   +5 more
openaire   +2 more sources

Parser Generator for Parsing Expression Grammar

2013
In the field of formal languages apart from context free grammar (CFG) a new approach is developed i.e. Parsing Expression Grammar (PEG). Parsing Expression Grammar (PEG) is a new way to specify recursive-descent parsers with limited backtracking. The use of backtracking lifts the LL(1) restriction usually imposed by top-down parsers.
Tota, Madhavi, Kumar, P. Pradeep
openaire   +1 more source

Towards automatic error recovery in parsing expression grammars

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 Medeiros, Fabio Mascarenhas
openaire   +2 more sources

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

A Haskell Library for Adaptable Parsing Expression Grammars

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