Theory of Computation and Compilers - Code Generation And Optimization
- Option : A
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
3. Peep-hole optimization is a form of
- Option : C
- Explanation : Redundant instructions may be discarded during the final stage of compilation by using a simple optimizing technique called peephole optimization. It 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 and it uses some common techniques: Constant folding. So option (C) is correct
You must be logged in to post a comment.
You must be logged in to post a comment.
- Option : D
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
5. Substitution of values for names whose values are constant, is done in
- Option : C
- Explanation :
You must be logged in to post a comment.
You must be logged in to post a comment.
You must be logged in to post a comment.