Tree Pattern Matching
Tree Pattern Matching is a deterministic parsing technique that belongs to the class of code generation algorithms in compiler design, specifically distinguished by its use of tree-structured patterns to systematically identify and match intermediate representation subtrees against predefined templates for optimal instruction selection.
85
Publications
7.5K
Citations
181
Authors
82
Institutions
Publications per year
2017–2026
1
Parents
85
Linear pattern matching algorithms
Peter Weiner · 1973 · 1.8K citations
Christoph M. Hoffmann, Michael J. O’Donnell · Journal of the ACM · 1982 · 440 citations · Full text
Your mediators need data conversion!
Sophie Cluet, Claude Delobel, Jérǒme Simèon et al. · 1998 · 308 citations
1–5 of 85
181
5
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 181
82
Courant Institute of Mathematical Sciences
New York, United States
8 h-index
14 publications
875 citations
AT&T (United States)
Bedminster, United States
6 h-index
10 publications
1.6K citations
New York University
New York, United States
5 h-index
8 publications
502 citations
Stanford University
Stanford, United States
5 h-index
5 publications
556 citations
New Jersey Institute of Technology
Newark, United States
4 h-index
6 publications
426 citations

Western University
London, Canada
4 h-index
6 publications
426 citations

Hanyang University
Seoul, South Korea
4 h-index
9 publications
174 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
3 h-index
8 publications
362 citations
1–8 of 82
JACM · 3 publications · 568 citations
3
h-index
TKDE · 3 publications · 246 citations
3
h-index
3 publications · 54 citations
3
h-index
2 publications · 82 citations
2
h-index
LNCS · Book series · 1 publications · 21 citations
1
h-index
1–5