206 views

1 Answer

Best answer
1 1 vote

NOTE:

$Source: Ullman $


Easy method:

As you can see $First(A) = \{a, c, \varepsilon\} = \{First(B), \varepsilon\}$

from this we can say that other production of A should be starting with terminal B

and there is only one option matching this case $Option  C$

$A\rightarrow  BbS | \varepsilon$

gives $First(A) = \{First(BbS), \varepsilon\} = \{First(B), \varepsilon\} = \{a, c, \varepsilon\}$ 

so $Answer: C$


Using Option Verification:

 

 

• edited by
Position:
Show:

Related questions

0 0 votes
2 2 answers
1.7k
1.7k views
atulcse asked Jan 16, 2022
1,694 views
Consider the following context-free grammar:Find the number of unique productions in {Goto (A → D.BC, B) U Goto (A → .DBC, D)}
1 1 vote
1 1 answer
1.2k
1.2k views
anon1 asked Dec 31, 2021
1,202 views
How to solve this ? Please help.
1 1 vote
1 1 answer
1.6k
1.6k views
srestha asked Apr 27, 2019
1,630 views
Consider the following CFG:$S\rightarrow Aa\mid ca$$A\rightarrow c\mid d$How many conflict occur in $CLR\left ( 1 \right )$ Parsing construction ?I think $LR\left ( 0 \ri...
1 1 vote
1 1 answer
547
547 views