GATE 2015 CS (CS2) – Question 27

Compiler Design · Code Optimization and Data Flow Analysis · 1 mark · Multiple choice

Match P: lexical analysis; Q: parsing; R: register allocation; S: expression evaluation. Techniques: 1 graph colouring; 2 DFA minimization; 3 postorder traversal; 4 production tree.

P–2,Q–3,R–1,S–4
P–2,Q–1,R–4,S–3
P–2,Q–4,R–1,S–3
P–2,Q–3,R–4,S–1

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) P–2,Q–4,R–1,S–3

Explanation

Lexical scanners use finite automata and DFA minimization, P–2. Parsing builds a production/parse tree, Q–4. Register allocation colours an interference graph, R–1. Expression trees are evaluated by postorder traversal, S–3. Thus C.

More Code Optimization and Data Flow Analysis questions

GATE 2021 CS (CS2) Q40 – Apply common-subexpression elimination to the code. y points to a heap struct with f1,f2;…
GATE 2021 CS (CS2) Q48 – For statement S, USE(S) contains variables used in S; IN(S) those live at entry; OUT(S)…
GATE 2026 CS (CS1) Q42 – Consider the control flow graph shown in the figure. Which one of the following options…
GATE 2026 CS (CS2) Q45 – Consider the control flow graph given below. Which one of the following options is the set…
GATE 2025 CS (CS1) Q13 – Which ONE of the following techniques used in compiler code optimization uses live…
GATE 2023 CS Q37 – Consider the control flow graph shown. Which one of the following choices correctly lists…

All Code Optimization and Data Flow Analysis questions →