GATE CSE SDT, Intermediate Code, Optimization & Code Generation – Compiler Design

GATE CSE SDT, Intermediate Code, Optimization & Code Generation – Compiler Design | Set 1

Questions 71-75 of 100

0% completed (0/100 answered)

Question 71

MCQ · Single Correct 1 mark

What is 'Peephole Optimization'?

A A local code optimization technique that examines a small sliding window (peephole) of target assembly instructions to apply simple improvements. B A global interprocedural analysis across all source files. C A hardware technique inside CPU execution units. D An optimization done purely at the lexical analysis phase.

Question 72

MCQ · Single Correct 1 mark

Which of the following transformations can be applied during Peephole Optimization?

A Lexical Tokenization B Global Interprocedural Pointer Analysis C Context-Free Grammar Parsing D Redundant Load/Store Elimination and Strength Reduction

Question 73

MCQ · Single Correct 1 mark

What does 'Copy Propagation' do?

A Duplicates functions to avoid function call overhead. B Given an assignment 'x = y', replaces subsequent uses of 'x' with 'y' as long as neither x nor y is modified. C Copies the entire program memory to a backup buffer. D Copies array elements into registers.

Question 74

MCQ · Single Correct 1 mark

In a basic block, if statement (1) 't1 = a + b' is followed by statement (2) 't2 = a + b', replacing (2) with 't2 = t1' is an example of:

A Local Common Subexpression Elimination B Strength Reduction C Constant Folding D Loop Invariant Code Motion

Question 75

MCQ · Single Correct 1 mark

What is the 'Loop Pre-Header' in loop optimizations?

A The first instruction inside the loop body. B The basic block that exits the loop. C The stack frame created for function calls inside the loop. D A newly created basic block inserted immediately before the loop header to hold code moved out of the loop.