On-line Graph Algorithms for Incremental Compilation

Alberto Marchetti-Spaccamela, Umberto Nanni, Hans Rohnert

Abstract: Compilers usually construct various data structures which often vary only slightly from compilation run to compilation run. This paper describes in a compact and uniform way solutions to several problems arising in order to quickly update these data structures instead of building them from scratch each time. All the considered problems can be reduced to graph problems. Specifically, we give algorithms for the dynamic problems of loop detection, topological order, reachability from the start routine, and transitive closure.