Kelly, Samuel Livingston
AST Indexing: A Near-Constant Time Solution to the Get-Descendants-by-Type Problem
In this paper we present two novel abstract syntax tree (AST) indexing algorithms that solve the get-descendants-by-type problem in near constant time. This work has been implemented in the U.S. Department of Energy's ROSE...
ETD1
Kelly, Samuel Livingston[remove]1
Computer algorithms1
Software engineering1
abstract syntax tree indexing algorithms1
Computer Sciences1
Software Engineering1
English1
20141
Computer Science Honors Theses1
Dickinson College1