GATEverse Practice, past papers & mock tests
GATE 2019
Compiler DesignParsing TechniquesmediumNAT1 mark

Consider the following given grammar:

GRAMMAR RULES
SA a
AB D
Bb | ε
Dd | ε Let a, b, d and $ be indexed as follows: a: 3, b: 2, d: 1, $: 0

Compute the FOLLOW set of the non-terminal B and write the index values for the symbols in the FOLLOW set in descending order.

Save your progress

Related Compiler Design PYQs