



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Various global code optimizations techniques in compiler construction, including copy propagation & elimination, constant folding & propagation, strength reduction, partial redundancy elimination, and partial dead code elimination. The concepts and conditions under which these optimizations can be performed.
Typology: Study notes
1 / 5
This page cannot be seen from the preview
Don't miss anything!
1
2
3
7
for each copy S: X=Y do OK = true for each use u on def-use(X,S) do if (s is in IN[B] where B contains a use of X) and (there is no redinifition of X or Y in B prior to u) then /* can propagate / else OK = false endif / cannot propagate */ endfor if Ok then replace all uses u of X in def-use(X,S) by use of Y; remove S endif endfor 8
9
Eliminated: D=A Not Eliminated: A=B Y=D W=A
Assume W,A,X,Y,Z Are live