• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

GATE | GATE CS 2019 | Question 28

Consider the following given grammar:
S → Aa
A → BD
B → b|ε
D → d|ε 
Let a, b, d and $ be indexed as follows:
Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in the descending order. (For example, if the FOLLOW set is {a, b, d, $}, then the answer should be 3210). Note: This was Numerical Type question.

(A)

31

(B)

310

(C)

230

(D)

23

Answer

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments