retagged by
6,894 views
34 votes
34 votes

Match the following:$$\begin{array}{ll|ll}\hline \text{P.} & \text{Lexical analysis} & \text{1.} & \text{Graph coloring} \\\hline  \text{Q.} & \text{Parsing} & \text{2.}& \text{DFA minimization} \\\hline   \text{R.}& \text{Register allocation} & \text{3.}  & \text{Post-order traversal} \\\hline  \text{S.} & \text{Expression evaluation} &\text{4.}  & \text{Production tree}  \\\hline \end{array}$$

  1. $\text{P-2, Q-3, R-1, S-4}$
  2. $\text{P-2, Q-1, R-4, S-3}$
  3. $\text{P-2, Q-4, R-1, S-3}$
  4. $\text{P-2, Q-3, R-4, S-1}$
retagged by

3 Answers

Best answer
43 votes
43 votes
  1. Regular expression uses FA & Regular Sets.
  2. Expression can be evaluated with postfix Traversals.
  3. Register allocation can be modeled by graph coloring.
  4. The parser constructs a production tree.

So, answer is C.

edited by
1 votes
1 votes
Answer Is C

Simple way to eliminating We Know that

Expression evaluation Is stack Based So we Analyses Post Order so we Left With Two Options C and B

For Production Tree We Get  Parsing

So Answer Is C
Answer:

Related questions

22 votes
22 votes
1 answer
1
Akash Kanase asked Feb 12, 2016
5,021 views
Match the following:$$\begin{array}{ll|ll}\hline \text{(P)} & \text{Lexical analysis} & \text{(i)} & \text{Leftmost derivation} \\\hline \text{(Q)} & \text{Top down pars...
39 votes
39 votes
5 answers
3
Madhav asked Feb 14, 2017
9,518 views
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it:$$\begin{array}{|l|l|}\hline \text{P. Syntax t...
29 votes
29 votes
3 answers
4
makhdoom ghaya asked Nov 19, 2016
14,264 views
Match the pairs in the following questions:$$\begin{array}{ll|ll} (a) & \text{Lexical analysis} & (p) & \text{DAG's} \\\hline (b) & \text{Code optimization} & (q) & \tex...