Results 131 to 140 of about 1,093 (164)

Optimization of * operator in Parsing Expression Grammar

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.
Latesh Malik
exaly   +2 more sources

Top-Down Online Handwritten Mathematical Expression Parsing with Graph Grammar

Lecture Notes in Computer Science, 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.
Harold Mouchère, Nina S T Hirata, Christian Viard-Gaudin   +2 more
exaly   +3 more sources

Object Parsing Expressions for Unplanned, Unmodified, and Incremental Grammar Reuse

Communications in Computer and Information Science, 2022
Stefan Sobernig
exaly   +4 more sources

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 0001, Fabio Mascarenhas
openaire   +1 more source

Some Aspects of Parsing Expression Grammar

Fundamenta Informaticae, 2008
Parsing Expression Grammar (PEG) is a new way to specify syntax, by means of a topdown processwith limited backtracking. It can be directly transcribed into a recursive-descent parser. The parser does not require a separate lexer, and backtracking removes the usual LL(1) constraint.
openaire   +3 more sources

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 Geraldo Ribeiro, Leonardo Vieira dos Santos Reis, Samuel da Silva Feitosa, Elton M. Cardoso   +3 more
openaire   +1 more source

Parsing expression grammars

ACM SIGPLAN Notices, 2004
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of programming languages and protocols. The power of generative grammars to express ambiguity is crucial to their original purpose of modelling natural languages, but this ...
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 Queiroz de Medeiros, Fabio Mascarenhas   +1 more
openaire   +2 more sources

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   +3 more sources