Results 141 to 150 of about 27,476 (181)

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

, 2022
Stefan Sobernig
openalex   +3 more sources

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 Patrick Pereira, Leonardo Vieira dos Santos Reis, Rodrigo Ribeiro   +4 more
openalex   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

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

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   +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. This is convenient for many applications, but there are two problems:
openaire   +2 more sources

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.
Manish M. Goswami, M.M. Raghuwanshi, Latesh Malik   +2 more
openaire   +1 more source

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   +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