Parser Combinators is a functional programming technique for constructing recursive descent parsers by composing higher-order functions that represent syntactic units, enabling the modular and composable specification of context-free grammars.
39
Publications
2K
Citations
68
Authors
32
Institutions
Publications per year
2017–2026
8
Parents
Publications
39
Higher-order functions for parsing
Graham Hutton · Journal of Functional Programming · 1992 · 183 citations · Full text
Graham Hutton, Erik Meijer · Journal of Functional Programming · 1998 · 181 citations · Full text
Graham Hutton, Erik Meijer · Nottingham ePrints (University of Nottingham) · 1996 · 100 citations · Full text
1–5 of 39
Authors
68
- SD
4
h-index
- FP
3
h-index
- NA
3
h-index
- GH
3
h-index
- EM
3
h-index
1–5 of 68
Institutions
32
Utrecht University
Utrecht, The Netherlands
6 h-index
9 publications
545 citations
University of Nottingham
Nottingham, United Kingdom
4 h-index
5 publications
288 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
5 publications
140 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
2 h-index
8 publications
138 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
4 publications
876 citations
KU Leuven
Leuven, Belgium
2 h-index
4 publications
50 citations
Chalmers University of Technology
Gothenburg, Sweden
2 h-index
2 publications
58 citations
Microsoft Research (United Kingdom)
Cambridge, United Kingdom
2 h-index
6 publications
163 citations
1–8 of 32
Venues
- Journal of Functional Programming
8 publications · 522 citations
8
h-index
- Electronic Notes in Theoretical Computer Science
ENTCS · 2 publications · 65 citations
2
h-index
- Lirias (KU Leuven)
Repository · 2 publications · 51 citations
2
h-index
- ACM SIGPLAN Notices
2 publications · 62 citations
2
h-index
- Data Archiving and Networked Services (DANS)
Repository · 2 publications · 181 citations
2
h-index
1–5