Results 151 to 160 of about 50,231 (194)
Some of the next articles are maybe not open access.
A Haskell Library for Adaptable Parsing Expression Grammars
Proceedings of the XXVII Brazilian Symposium on Programming Languages, 2023Adaptable Parsing Expression Grammar (APEG) is a formal model for describing languages which provide a mechanism to extend its own syntax during the parsing process.
E. Cardoso +3 more
semanticscholar +2 more sources
An attribute language definition for adaptable parsing expression grammars
Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, 2019Adaptable Parsing Expression Grammars (APEG) are a formal model whose main purpose is to formally describe the syntax of extensible languages and their extension mechanisms.
E. Cardoso +5 more
semanticscholar +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.
M. M. Goswami +2 more
semanticscholar +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.
Roman R. Redziejowski
semanticscholar +2 more sources
BITES Instead of FIRST for Parsing Expression Grammar
Fundamenta Informaticae, 2011In 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.
Roman R. Redziejowski
semanticscholar +3 more sources
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 ...
Bryan Ford
+6 more sources
Parsing Expression Grammar as a Primitive Recursive-Descent Parser with Backtracking
Fundamenta Informaticae, 2007 Roman R. Redziejowski
openalex +2 more sources
Towards automatic error recovery in parsing expression grammars
Proceedings of the XXII Brazilian Symposium on Programming Languages, 2018Error 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. Medeiros, Fabio Mascarenhas
semanticscholar +3 more sources
Parsing via Regular Expressions
International Symposium on Applied Machine Intelligence and Informatics, 2021Since programming languages exist, parsing the code - primarily for compilation - is an ever-present necessity. As of today, there is a deep theory of this topic, describing approaches and useful constructs, categories and capabilities of parsers, which ...
Dávid Magyar, S. Szénási
semanticscholar +1 more source