GATE | GATE CS 2019 | Question 29

Consider the following given grammar:
S → Aa
A → BD
B → b|ε
D → d|ε
Let b, d, e and $ be indexed as follows:

Compute the follow set of the non terminal B and write and write index values for symbols in the follow set in the decending order {for example if the follow set is a, b, d, $} then the answer shoud be 3210

(A) 31

Answer: (A)


Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Article Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.