Results 1 to 10 of about 127,422 (77)
Packrat Parsing with Dynamic Buffer Allocation [PDF]
JOURNAL OF ADVANCED APPLIED SCIENTIFIC RESEARCH, 2022 Packrat parsing is a type of recursive decent parsing with guaranteed liner time parsing. For this,memoization technique is implemented in which all parsing results are memorized to avoid repetitive scanningof inputs in case of backtracking. The issue with this technique is large heap consumption for memoization whichout weigh the benefits.
null Nikhil Mangrulkar +2 more
semanticscholar +3 more sources
Is stateful packrat parsing really linear in practice? a counter-example, an improved grammar, and its parsing algorithms [PDF]
Proceedings of the 29th International Conference on Compiler Construction, 2020 Stateful packrat parsing is an algorithm for parsing syntaxes that have context-sensitive features. It is a well-known knowledge among researchers that the running time of stateful packrat parsing is linear for real-world grammars, as demonstrated in existing studies.
Nariyoshi Chida +4 more
exaly +4 more sources
Fast packrat parsing in a live programming environment
ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2022 Language developers who design domain-specific languages or new language features need a way to make fast changes to language definitions. Those fast changes require immediate feedback. Also, it should be possible to parse the developed languages quickly to handle extensive sets of code. Parsing expression grammars provides an easy to understand method
Eichenroth, Friedrich +2 more
semanticscholar +5 more sources
A verified packrat parser interpreter for parsing expression grammars [PDF]
Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2020 15 pages, 15 figures, Certified Proofs and ...
Natarajan Shankar
exaly +6 more sources
Parsing Expression Grammar and Packrat Parsing – A Review
Shanghai Ligong Daxue Xuebao/Journal of University of Shanghai for Science and Technology, 2020 Bryan Ford presented Parsing Expression Grammars (PEGs) as an alternative to specify rules for programming language, along with a Packrat parser, based on an idea of memoization. The idea proposed by B. Ford guarantees parsing of grammar written using PEGs in linear time in spite of backtracking. The primary aim of the paper is to highlight the details
Nikhil Mangrulkar S +3 more
exaly +3 more sources
Packrat Parsing: A Literature Review [PDF]
International Journal of Advanced Research in Artificial Intelligence, 2016 Packrat parsing is recently introduced technique based upon expression grammar. This parsing approach uses memoization and ensures a guarantee of linear parse time by avoiding redundant function calls by using memoization. This paper studies the progress made in packrat parsing till date and discusses the approaches to tackle this parsing process ...
Manish M., Dr. M.M., Dr. Latesh
exaly +3 more sources
Derivatives of Parsing Expression Grammars [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 This paper introduces a new derivative parsing algorithm for recognition of parsing expression grammars. Derivative parsing is shown to have a polynomial worst-case time bound, an improvement on the exponential bound of the recursive descent algorithm ...
Aaron Moss
doaj +3 more sources
Packrat Parsing with Elastic Sliding Window
Journal of Information Processing, 2015 Kimio Kuramitsu
openaire +3 more sources
A community convention for ecological forecasting: Output files and metadata version 1.0
Ecosphere, Volume 14, Issue 11, November 2023., 2023 Abstract This paper summarizes the open community conventions developed by the Ecological Forecasting Initiative (EFI) for the common formatting and archiving of ecological forecasts and the metadata associated with these forecasts. Such open standards are intended to promote interoperability and facilitate forecast communication, distribution ...
Michael C. Dietze +6 more
wiley +1 more source
Packrat Parsers Can Support Multiple Left-recursive Calls at the Same Position
Journal of Information Processing, 2021 : One of the common problems with the recursive descent parsing method is that when parsing with a left-recursive grammar, the parsing does not terminate because the same parsing function is recursively invoked indefi-nitely without consuming the input ...
M. Umeda, Atusi Maeda
semanticscholar +1 more source