LR Parsing is a deterministic bottom-up syntactic analysis method that reads input from left to right and produces a rightmost derivation in reverse, distinguished from other parsing techniques by its use of a lookahead symbol to resolve production rules unambiguously.
150
Publications
5.2K
Citations
221
Authors
107
Institutions
Publications per year
2017–2026
9
Parents
Publications
150
Bryan Ford · 2004 · 409 citations
Computing, Computer Science, Natural Language Processing +16
An efficient augmented-context-free parsing algorithm
Masaru Tomita · 1987 · 195 citations
Terence Parr, Kathleen Fisher · ACM SIGPLAN Notices · 2011 · 176 citations
1–5 of 150
Authors
221
- MT
7
h-index
- MN
5
h-index
- DP
4
h-index
- TB
4
h-index
- HS
4
h-index
1–5 of 221
Institutions
107
Carnegie Mellon University
Pittsburgh, United States
12 h-index
19 publications
1.2K citations
Royal Holloway University of London
Egham, United Kingdom
4 h-index
9 publications
422 citations
University of Padua
Padua, Italy
4 h-index
4 publications
53 citations
University of California, Santa Cruz
Santa Cruz, United States
4 h-index
5 publications
193 citations
University of Hawaii System
Honolulu, United States
3 h-index
3 publications
99 citations
Advanced Telecommunications Research Institute International
Kyoto, Japan
3 h-index
6 publications
252 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
3 h-index
4 publications
70 citations
University of Groningen
Groningen, The Netherlands
3 h-index
3 publications
43 citations
1–8 of 107
Venues
- ACM Transactions on Programming Languages and Systems
13 publications · 435 citations
12
h-index
- ACM SIGPLAN Notices
11 publications · 426 citations
11
h-index
- Acta Informatica
10 publications · 260 citations
10
h-index
- ArXiv.org
Repository · 3 publications · 89 citations
3
h-index
- Communications of the ACM
3 publications · 150 citations
3
h-index
1–5