Let G be a formal grammar with non-terminal symbols A, D, B and C, terminal symbol 'x','+' and '$', start symbol 'S', and the following production rules:

A->B$

B->DC'

C'->+DC'

D->x

Constructan LL(1) parse table for the grammar. Calculate FIRST & FOLLOW sets as needed.

Use the parse table to recognize the sentence x+x. Show the stack implementation.