Data Flow Analysis of Recursive Structures

International audienceMost imperative languages only offer arrays as "first-class" datastructures. Other data structures, especially recursive datastructures such as trees, have to be manipulated through explicitlymanagement of memory. On the other hand, recursion in the flow ofcontrol also is an open problem in automatic parallelization. To helpand solve this problem, this paper proposes a data flow analysis forboth data and control recursive structures