Question 10552 – Compiler-Design
February 13, 2024Question 9975 – Compiler-Design
February 13, 2024Question 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
Code optimization – DAG
Code generation – Syntax tree
Abelian groups – Push down automaton
(a) – (s), (b) – (p), (c) – (q), (d) – (r)
Subscribe
Login
0 Comments