Abstract Syntax Tree Traversal
An Abstract Syntax Tree Traversal is a systematic computational method for visiting and processing the nodes of an abstract syntax tree in a defined order, distinguished by its role in enabling the analysis or transformation of syntactic structures in programming languages.
42
Publications
3K
Citations
125
Authors
60
Institutions
Publications per year
2017–2026
14
Parents
42
Clone Detection Using Abstract Syntax Suffix Trees
Rainer Koschke, Raimar Falke, Pierre Frenzel · 2006 · 312 citations
ASTLOG: a language for examining abstract syntax trees
Roger F. Crew · 1997 · 121 citations
1–5 of 42
125
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 125
60
Nanyang Technological University
Singapore, Singapore
3 h-index
6 publications
231 citations
Indiana University
Bloomington, United States
2 h-index
4 publications
92 citations

Periyar University
Salem, India
2 h-index
2 publications
139 citations

University of Strathclyde
Glasgow, United Kingdom
2 h-index
2 publications
139 citations
Purdue University West Lafayette
West Lafayette, United States
2 h-index
4 publications
655 citations
Koneru Lakshmaiah Education Foundation
Vijayawada, India
2 h-index
8 publications
481 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
2 h-index
4 publications
328 citations

Tanta University
Tanta, Egypt
2 h-index
2 publications
139 citations
1–8 of 60
3 publications · 55 citations
3
h-index
2 publications · 57 citations
2
h-index
TSE · 2 publications · 684 citations
2
h-index
Repository · 2 publications · 27 citations
2
h-index
Conference · 2 publications · 63 citations
2
h-index
1–5