Data Flow Analysis of Recursive Structures

Most imperative languages only offer arrays as "first-class" data structures. Other data structures, especially recursive data structures such as trees, have to be manipulated through explicitly management of memory. On the other hand, recursion in the flow of control also is an open problem in automatic parallelization. To help and solve this problem, this paper proposes a data flow analysis for both data and control recursive structures.