Theory of Computation and Compilers - Code Generation And Optimization

1. In analyzing the compilation of PL/I program, the term "Machine independent optimization" is associated with

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


2. In analyzing the compilation of PL/I program the description " resolving symbolic address ( labels ) and generating machine language " is associated with

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


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
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


4. In analyzing the compilation of PL/I program the description " creation of more optimal matrix " is associated with

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


5. Substitution of values for names whose values are constant, is done in

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *