Module 16: Data Flow Analysis in Presence of Procedure Calls
Lecture 31: Data Dependence Analysis
do i = 1, N
a(i) = b(i)
c(i) = a(i) + b(i)
e(i) = c(i+1)
enddo
Unroll The Loop
do I = 1, N
A = B(I)
C(I) = A + B(I)
E(I) = C(I+1)
enddo
