Question 10552 – Compiler-Design
February 13, 2024
GATE 1998
February 13, 2024
Question 10552 – Compiler-Design
February 13, 2024
GATE 1998
February 13, 2024

Question 10556 – Compiler-Design

Match the pairs in the following questions:

(a) Lexical analysis         (p) DAG's
(b) Code optimization        (q) Syntax trees
(c) Code generation          (r) Push down automaton
(d) Abelian groups           (s) Finite automaton

Correct Answer: A

Question 21 Explanation: 
Lexical analysis – Finite automaton
Code optimization – DAG
Code generation – Syntax tree
Abelian groups – Push down automaton
A
(a) – (s), (b) – (p), (c) – (q), (d) – (r)

Leave a Reply

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