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

Authors

29

  1. BF
    Bryan Ford

    Yale University, United States

    3 publications · 288 citations

    3

    h-index

  2. RG
    Robert Grimm

    New York University, United States

    2 publications · 209 citations

    2

    h-index

  3. RR
    Roman R. Redziejowski

    Sjukhuset i Lidköping, Sweden

    2 publications · 47 citations

    2

    h-index

  4. SM
    Sharon Moser

    Marymount University, United States

    1 publications · 48 citations

    1

    h-index

  5. KM
    Kota Mizushima

    National Institutes for Quantum Science and Technology, Japan

    1 publications · 30 citations

    1

    h-index

1–5 of 29

Venues

  1. ACM SIGPLAN Notices

    2 publications · 161 citations

    2

    h-index

  2. The Journal of Physician Assistant Education

    2 publications · 61 citations

    2

    h-index

  3. Bern Open Repository and Information System (University of Bern)

    Repository · 1 publications · 46 citations

    1

    h-index

  4. Journal of Information Processing

    JIP · 1 publications · 17 citations

    1

    h-index

  5. ArXiv.org

    Repository · 1 publications · 84 citations

    1

    h-index

1–5