edited by
7,832 views
32 votes
32 votes

Match all items in Group 1 with the correct options from those given in Group 2.Syntax analysis$$\begin{array}{|ll|ll|}\hline \rlap{\textbf{Group 1}} & & \rlap{\textbf{Group 2}}  \\\hline \text{P.} & \text{Regular Expression} & \text{1.} & \text{Syntax analysis} \\\hline  \text{Q.} & \text{Pushdown automata} & \text{2.}& \text{Code generation} \\\hline   \text{R.}& \text{Dataflow analysis} & \text{3.}  & \text{Lexical analysis} \\\hline  \text{S.} & \text{Register allocation} &\text{4.}  & \text{Code optimization}  \\\hline \end{array}$$

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

1 Answer

Best answer
49 votes
49 votes

Correct Option: B

Regular expressions are used in lexical analysis.

Pushdown automata is related to context free grammar which is related to syntax analysis.

Dataflow analysis is done in code optimization.

Register allocation is done in code generation.

edited by
Answer:

Related questions

39 votes
39 votes
5 answers
2
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...
22 votes
22 votes
1 answer
3
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...
23 votes
23 votes
3 answers
4
Kathleen asked Sep 22, 2014
13,639 views
Consider a binary max-heap implemented using an array.Which one of the following array represents a binary max-heap?$\left\{25,12,16,13,10,8,14\right\}$ $\left\{25,14,...