Consider the following grammar G S-A a -a A a) Calculate FIRST, FOLLOW, and SELECT sets for G and prove that G is not LL(1) b) Using standard transformations, create an equivalent LL(1) grammar G'. c) Generate the LL(1) parsing table for G' after recalculating First, Follow, and Select sets. d) Trace the parse of the input abdb$ in G Consider the following grammar G S-A a -a A a) Calculate FIRST, FOLLOW, and SELECT sets for G and prove that G is not LL(1) b) Using standard transformations, create an equivalent LL(1) grammar G'. c) Generate the LL(1) parsing table for G' after recalculating First, Follow, and Select sets. d) Trace the parse of the input abdb$ in G