edited by
9,637 views
39 votes
39 votes

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 tree}  &  \text{i. Code generator} \\\hline  \text{Q. Character stream} & \text{ii. Syntax analyser} \\\hline  \text{R. Intermediate representation} & \text{iii. Semantic analyser} \\\hline  \text{S. Token stream} & \text{iv. Lexical analyser} \\\hline \end{array}$$

  1. $\text{P-ii; Q-iii; R-iv; S-i}$
  2. $\text{P-ii; Q-i; R-iii; S-iv}$
  3. $\text{P-iii; Q-iv; R-i; S-ii}$
  4. $\text{P-i; Q-iv; R-ii; S-iii}$
edited by

5 Answers

1 votes
1 votes

C. P-iii; Q-iv; R-i; S-ii;

because Syntax tree come from Syntax analyzer process by Semantic analyzer

             Character stream is input to Lexical analyzer

              Intermediate representation is input to Code generator

              token stream come from Lexical analyzer is input to Syntax analyzer

Answer:

Related questions

22 votes
22 votes
1 answer
1
Akash Kanase asked Feb 12, 2016
5,067 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...
25 votes
25 votes
7 answers
2
khushtak asked Feb 14, 2017
6,905 views
Match the algorithms with their time complexities:$$\begin{array}{|l|l|}\hline \textbf{Algorithms} & \textbf{Time Complexity} \\\hline \text{P. Tower of Hanoi with $n$...
34 votes
34 votes
3 answers
4
go_editor asked Feb 12, 2015
6,982 views
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.}&...