Consider the grammar: (used EPSILON in place of the symbol as chegg doesn't accept it, EPSILON stands for the empty string/the little e)

S A g BC (1)

A a A (2)

A C B (3)

B d B c (4)

B EPSILON (5)

C f C (6)

C EPSILON (7)

Write the parser for the grammar. Your parser should follow the general model of predictive parser that we saw in class. In particular, for non-terminals that can generate , the parser should check the FOLLOW set before choosing to parse the righthand side that generates .