Classical

Compiler Design - Basics of code optimization

1:  

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

A.

recognization of basic syntactic construction through reductions

B.

recognition of basic elements and creation of uniform symbols

C.

creation of more optical matrix

D.

use of macro-processor to produce more optimal assembly code

 
 

Option: C

Explanation :


2:  

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

A.

assembly and output

B.

code generation

C.

storage assignment

D.

syntax analysis

 
 

Option: A

Explanation :


3:  

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

A.

assembly and output

B.

code generation

C.

syntax analysis

D.

machine independent optimization

 
 

Option: D

Explanation :


4:  

 Peep-hole optimization is a form of 

A.

loop optimization

B.

local optimization

C.

constant folding 

D.

data flow analysis

 
 

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 recognising 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


5:  

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

A.

local optimization

B.

loop optimization

C.

constant folding

D.

none of these

 
 

Option: C

Explanation :




Suggest an improvement

 


Syllabus Covered in this section is

  • Compilation and Interpretation 
  • Bootstrap compilers
  • Phases of compilation process
  • Lexical analysis
  •  Context free grammars
  • Parsing and parse trees
  • Representation of parse (derivation) trees as rightmost and leftmost derivations
  • Bottom up parsers-shift-reduce, operator precedence and LR
  • Topdown parsers-left recursion and its· removal.
  • Recursive descent parser.
  • Predictive parser
  • Intermediate codes-Quadruples, Triples
  • Intermediate code generation
  • Target code generation
  • Basics of  Code optimization
  • Syntax directed translation
  • Runtime environments

This Section covers Multiple Choice Questions Answers in Compiler Design .

Who can benefit - 

  • Any undergraduate or postgraduate student who is seeking Compiler Design objective type questions answers can use this section.
  • Compiler Design Multiple Choice questions Answers can help you in interview preparation.
  • Compiler Design MCQ Questions Answers are also used by engineering students in the preparation of their Exams.
  • Any candidate who has to appear for DOEACC A, B or C level Exam can also learn Compiler Design Questions Answers.
  • All the teachers who are appearing for Kendriya Vidyalya Sangathan Entrance Exam can also use Compiler Design Multiple Choice Questions Answers.
  • Compiler Design MCQs can also be used by the students who are pursuing B.Sc or Msc Computer Science.
  • Compiler Design Questions Answers can also be used by BCA students for the preparation of their exams.
  • Any student who is pursuing B.Sc. or Msc  in Information Technology can also use this Compiler Design mcq Questions Answers.
  •  MCA students can also prepare for their exams using Compiler Design Objective Type Questions Answers.
  • You can get free access to Compiler Design mcq pdf.
  • You can also have online access to Compiler Design Questions Answers EBook.

Various Search Terms used for this section are

  • Compiler Design quiz questions with answers

  • Compiler Design exam questions answers

  • Compiler Design MCQ questions Answers

  • Compiler Design MCQ