PUERTA | GATE-CS-2015 (Conjunto 2) | Pregunta 29

Une el siguiente:

      List-I                  List-II
A. Lexical analysis       1. Graph coloring
B. Parsing                2. DFA minimization
C. Register allocation    3. Post-order traversal
D. Expression evaluation  4. Production tree

Codes:
    A B C D
(a) 2 3 1 4
(b) 2 1 4 3
(c) 2 4 1 3
(d) 2 3 4 1

(A) a
(B) b
(C) c
(D) d

Respuesta: (C)
Explicación:

Register allocation is a variation of Graph Coloring problem.

Lexical Analysis uses DFA.

Parsing makes production tree

Expression evaluation is done using tree traversal 

Cuestionario de esta pregunta