Code-Optimization
October 10, 2023Code-Optimization
October 10, 2023Code-Optimization
|
Question 8
|
Peer-hole optimization is a form of :
|
loop optimization
|
|
|
local optimization
|
|
|
constant folding
|
|
|
data flow analysis
|
Question 8 Explanation:
→ Peephole optimization is a kind of optimization performed over a very small set of instructions in a segment of generated code. The set is called a “peephole” or a “window”. It works by recognizing sets of instructions that can be replaced by shorter or faster sets of instructions.
Common techniques:
Null sequences
Combine operations
Algebraic laws
Special case instructions
Address mode operations
Constant folding
Common techniques:
Null sequences
Combine operations
Algebraic laws
Special case instructions
Address mode operations
Constant folding
Correct Answer: B
Question 8 Explanation:
→ Peephole optimization is a kind of optimization performed over a very small set of instructions in a segment of generated code. The set is called a “peephole” or a “window”. It works by recognizing sets of instructions that can be replaced by shorter or faster sets of instructions.
Common techniques:
Null sequences
Combine operations
Algebraic laws
Special case instructions
Address mode operations
Constant folding
Common techniques:
Null sequences
Combine operations
Algebraic laws
Special case instructions
Address mode operations
Constant folding