Results 51 to 60 of about 127,422 (77)
, 1903 A bushy-tailed woodrat, also known as a packrat, stands on a stump at the Juno Group of ...
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Optimizing Packrat Parsing with Non-Linear Data Structures for Memoization
2023 International Conference on Self Sustainable Artificial Intelligence Systems (ICSSAS), 2023This research paper presents the implementation of memoization in packrat parsing using non-linear data structures. Packrat parsing is a powerful parsing technique that guarantees linear time parsing for grammars that can be expressed using parsing ...
Nikhil Mangrulkar, Kavita Singh
exaly +3 more sources
ACM SIGPLAN Notices, 2002
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing with backtracking and unlimited lookahead, but nevertheless guarantees linear parse time. Any language defined by an LL( k ) or LR(
Bryan Ford
exaly +5 more sources
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing with backtracking and unlimited lookahead, but nevertheless guarantees linear parse time. Any language defined by an LL( k ) or LR(
Bryan Ford
exaly +5 more sources
Proceedings of the 10th ACM SIGPLAN International Conference on Software Language Engineering, 2017
Packrat parsing is a popular technique for implementing top-down, unlimited-lookahead parsers that operate in guaranteed linear time. In this paper, we describe a method for turning a standard packrat parser into an incremental parser through a simple modification to its memoization strategy. By 'incremental', we mean that the parser can perform syntax
Patrick Dubroy, Alessandro Warth
exaly +3 more sources
Packrat parsing is a popular technique for implementing top-down, unlimited-lookahead parsers that operate in guaranteed linear time. In this paper, we describe a method for turning a standard packrat parser into an incremental parser through a simple modification to its memoization strategy. By 'incremental', we mean that the parser can perform syntax
Patrick Dubroy, Alessandro Warth
exaly +3 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, 2017Parsing 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
exaly +4 more sources
Towards a Faster Incremental Packrat Parser
2019 12th International Conference on Information & Communication Technology and System (ICTS), 2019 This work is an extension to the research done by Dubroy and Warth [1] on incremental packrat parsing. It attempts to further decrease the parse time of the incremental parser using two techniques from experimental algorithmics: algorithm and code tuning.
J. Guillermo, P. Fernandez
exaly +4 more sources
Stack and Queue Based Parser Approach for Parsing Expression Grammar
2023 11th International Conference on Emerging Trends in Engineering & Technology - Signal and Information Processing (ICETET - SIP), 2023Parsing Expression Grammar (PEG) and Packrat Parser are the two recent developments in the field of Formal Languages and Automata Theory. The syntax of PEG is similar to the syntax of Context free grammar with ordered choice.
Shravankumar Purve +2 more
exaly +2 more sources
DCGs + Memoing = Packrat Parsing but Is It Worth It?
International Symposium on Practical Aspects of Declarative Languages, 2007Packrat parsing is a newly popular technique for efficiently implementing recursive descent parsers. Packrat parsing avoids the potential exponential costs of recursive descent parsing with backtracking by ensuring that each production rule in the grammar is tested at most once against each position in the input stream.
Ralph Becket, Zoltan Somogyi
openaire +2 more sources
Optimization of * operator in Parsing Expression Grammar
IEEE International Conference on Electrical, Computer and Communication Technologies, 2015Latesh Malik
exaly +2 more sources
Packrat parsers can handle practical grammars in mostly constant space
Workshop on Program Analysis For Software Tools and Engineering, 2010Kota Mizushima +2 more
exaly +2 more sources