Packrat Parsing
Packrat Parsing is a deterministic parsing algorithm that belongs to the class of recursive descent parsers and is distinguished by its use of memoization to achieve linear time complexity for parsing expressions in grammars with unlimited lookahead.
15
Publications
779
Citations
29
Authors
14
Institutions
Publications per year
2017–2026
2
Parents
15
Better extensibility through modular syntax
Robert Grimm · ACM SIGPLAN Notices · 2006 · 128 citations
Computing, Computer Science, Natural Language Processing +16
Packrat Parsing: Simple, Powerful, Lazy, Linear Time
Bryan Ford · ArXiv.org · 2006 · 84 citations · Full text
Better extensibility through modular syntax
Robert Grimm · 2006 · 81 citations
Computing, Computer Science, Natural Language Processing +16
1–5 of 15
29
3
h-index
2
h-index
2
h-index
1
h-index
National Institutes for Quantum Science and Technology, Japan
1 publications · 30 citations
1
h-index
1–5 of 29
14
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
204 citations
New York University
New York, United States
2 h-index
2 publications
209 citations
UCLA Health
Los Angeles, United States
1 h-index
1 publications
56 citations
Misericordia University
Dallas, United States
1 h-index
4 publications
52 citations
University of Bern
Bern, Switzerland
1 h-index
3 publications
138 citations

Viewpoints Research Institute
Los Angeles, United States
1 h-index
1 publications
56 citations

Yokohama National University
Yokohama, Japan
1 h-index
1 publications
17 citations
University of Pennsylvania
Philadelphia, United States
1 h-index
4 publications
52 citations
1–8 of 14
2 publications · 161 citations
2
h-index
2 publications · 61 citations
2
h-index
Repository · 1 publications · 46 citations
1
h-index
JIP · 1 publications · 17 citations
1
h-index
Repository · 1 publications · 84 citations
1
h-index
1–5