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}$$ $\text{P-2, Q-3, R-1, S-4}$ $\text{P-2, Q-1, R-4, S-3}$ $\text{P-2, Q-4, R-1, S-3}$ $\text{P-2, Q-3, R-4, S-1}$ Compiler Design gatecse-2015-set2 compiler-design normal compilation-phases match-the-following + – go_editor asked Feb 12, 2015 • retagged Dec 12, 2023 by Hira Thakur go_editor 7.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 43 votes 43 votes Regular expression uses FA & Regular Sets. Expression can be evaluated with postfix Traversals. Register allocation can be modeled by graph coloring. The parser constructs a production tree. So, answer is C. shekhar chauhan answered May 28, 2016 • edited Dec 27, 2017 by Puja Mishra shekhar chauhan comment Share Follow See all 2 Comments See all 2 2 Comments reply vivekgatecs2020 commented Aug 6, 2019 reply Follow Share For Minimum no of registers required problem we can estimate it by graph coloring method 14 votes 14 votes Abhrajyoti00 commented Dec 25, 2022 reply Follow Share Register allocation by graph coloring - Citizendium 1 votes 1 votes Please log in or register to add a comment.
19 votes 19 votes Answer: C Rajarshi Sarkar answered Feb 12, 2015 • edited Nov 25, 2017 by kenzou Rajarshi Sarkar comment Share Follow See 1 comment See all 1 1 comment reply sumitsehgal commented Mar 12, 2015 reply Follow Share Answer is C. 3 votes 3 votes Please log in or register to add a comment.
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 chalam121 answered Apr 3, 2018 chalam121 comment Share Follow See 1 comment See all 1 1 comment reply Kumar Iyer commented May 18, 2018 reply Follow Share In that case you can directly eliminate all by seeing that for Q-4 , there is only 1 option C : 1 votes 1 votes Please log in or register to add a comment.