Ace Test Series: Compilers - Follow In Parsing

Question

Comments

option d is correct

---

Answer is option D.

First remove left recursion of B and D. and then calculate.

---

option D

Answer 1

hope this helps 

Answer 2

From the first production: A -> BCD : Follow(B) = First(C) = {y,m}                                                        -----(1)

From the second production: B -> w / Bx : Follow(B) = {x}                                                                   ------(2)

From the third production: C -> yCz / m : B is not present here, so it is not of any concern here.        -----(3)

And the last production: D -> DB / a : Follow(B) = Follow(D) = First(B) and Follow(A). = {w,\$}

Hence, from 1, 2, 3 and 4
Follow(B) =  {y,m,x,w,\$}

Answer 3

$follow(B)=first(C)\cup first(x)\cup follow(D)$

$follow(B)=(y,m)\cup (x)\cup first(B)\cup first(A)$

$follow(B)=(y,m,x,w,\$)$

Option (D) is correct here.