INTRODUCTION TO COMPILER DESIGN
OVERVIEW OF COMPILERS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Local and loop optimization in turn provide motivation for
|
|
data flow analysis
|
|
|
constant folding
|
|
|
peep hole optimization
|
|
|
DFA and constant folding
|
Explanation:
Detailed explanation-1: -Machine independent optimizations: Loop optimizations such as: Code motion, Loop jamming or loop fusion, loop unrolling. Other machine independent optimization are: deadcode elimination, constant folding etc.
Detailed explanation-2: -Code motion. Induction-variable elimination. Strength reduction.
Detailed explanation-3: -Use simple termination conditions. Write count-down-to-zero loops. Use counters of type unsigned int . Test for equality against zero.
There is 1 question to complete.