Register

Test by Bikram | Compiler Design | Test 1 | Question: 19

• retagged by
313 views
4 votes
4 votes

Consider the following grammar:

  • $Z \rightarrow  TZ'$
  • $Z' \rightarrow  +TZ'  \mid \epsilon$
  • $T \rightarrow Y T '$
  • $T ' \rightarrow ^* YT ' \mid \epsilon$
  • $Y \rightarrow (Z) \mid id$

Which of the following represents Follow(Y)?

  1. $\{ ), id \}$
  2. $\{ ), id, \$,  *,  + \}$
  3. $\{ ^*, +,  ),  \$ \}$
  4. $\{ +, ),  \$ \}$
• retagged by
User Avatar

2 Answers

Best answer
3 votes
3 votes

$$\begin{array}{|l|l|l|l|} \hline  & \textbf{First} & \textbf{Follow} \\ \hline Z\rightarrow TZ' &  \{(,id\} &  \{\$,)\} \\ \hline Z'\rightarrow + TZ' \mid \epsilon & \{+,\epsilon\} & \{\$,)\}  \\ \hline T\rightarrow YT'& \{(,id\} & \{+,$,)\}  \\ \hline T'\rightarrow \ast YT' \mid \epsilon & \{\ast,\epsilon\} & \{+,$,)\}  \\ \hline Y\rightarrow (Z) \mid id & \{(,id\} & \{\ast,+,\$,)\} \\ \hline \end{array}$$ So, the correct answer is $(C)$.

Reference:

• edited by
User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

3 votes
3 votes
1 answer
1
Bikram asked Nov 25, 2016
469 views
Test by Bikram | Compiler Design | Test 1 | Question: 24
Consider the following grammar: $E \rightarrow E + T \mid T$ $T \rightarrow T ^* F \mid F$ $F \rightarrow (E) \mid id$ ... $E \rightarrow TE' , \ \ T \rightarrow FT' , \ \ F \rightarrow (E) \mid id$
Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...
User Avatar
3 votes
3 votes
1 answer
2
Bikram asked Nov 25, 2016
344 views
Test by Bikram | Compiler Design | Test 1 | Question: 10
The grammar which has no epsilon transition or two adjacent nonterminals in the right side of any production is ___________. LL(1) grammar Unambiguous grammar Operator grammar Context Sensitive grammar
The grammar which has no epsilon transition or two adjacent nonterminals in the right side of any production is ___________.LL(1) grammarUnambiguous grammarOperator gramm...
User Avatar
3 votes
3 votes
2 answers
3
Bikram asked Nov 25, 2016
239 views
Test by Bikram | Compiler Design | Test 1 | Question: 6
Consider the following grammars: $Z \rightarrow TZ'$ $Z' \rightarrow ^* TZ' \mid \epsilon$ $T \rightarrow YT'$ $T ' \rightarrow ^*YT ' \mid \epsilon$ $Y \rightarrow (Z) \mid id$ Which of the following is First(Z)? $\{T, ) \}$ $\{(, id \}$ $\{ ), \$ \}$ None of the above
Consider the following grammars:$Z \rightarrow TZ'$$Z' \rightarrow ^* TZ' \mid \epsilon$$T \rightarrow YT'$$T ' \rightarrow ^*YT ' \mid \epsilon$$Y \rightarrow (Z) \mi...
User Avatar
2 votes
2 votes
2 answers
4
Bikram asked Nov 25, 2016
692 views
Test by Bikram | Compiler Design | Test 1 | Question: 30
Consider the following grammar: $S \rightarrow L = P \mid P$ $L \rightarrow ^*P \mid id$ $P \rightarrow L$ The above grammar is: Ambiguous SLR(1) LALR(1) None of the above
Consider the following grammar:$S \rightarrow L = P \mid P$$L \rightarrow ^*P \mid id$$P \rightarrow L$The above grammar is:AmbiguousSLR(1)LALR(1)None of the above
User Avatar
Link Copied!