Teaching TN TRB CS Mock Test Theory of Computation Regular Languages and Finite Automata Regular Languages
Match the following:
|
P. Lexical analysis |
1. Graph coloring |
|
Q. Parsing |
2. DFA minimization |
|
R. Register allocation |
3. Post-order traversal |
|
S. Expression evaluation |
4. Production tree |
1
P – 2, Q – 3, R – 1, S - 4
2
P – 2, Q – 1, R – 4, S - 3
3
P – 2, Q – 4, R – 1, S - 3
4
P – 2, Q – 3, R – 4, S - 1