INTRODUCTION TO COMPILER DESIGN
OVERVIEW OF COMPILERS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
loop optimization
|
|
|
local optimization
|
|
|
constant folding
|
|
|
data flow analysis
|
Detailed explanation-1: -Peephole optimization is a technique for locally improving the target code which is done by examining a sliding window of target instructions and replacing the instruction sequences within the peephole by shorter or faster sequences wherever possible. Constant folding is a peephole optimization.
Detailed explanation-2: -Peephole optimization is a efficient and easy optimization technique used by compilers sometime called window or peephole is set of code that replace one sequence of instructions by another equivalent set of instructions, but shorter, faster.
Detailed explanation-3: -Which of the following comment about peep-hole optimization is true? It is applied in symbol table to optimize the memory requirements.