Given the following CFG and the Predictive Parsing table. Write a program to trace an input string given by the user. Save it as Prog1. Test your program with the following input strings: (1) (a +a )*a$, (2) a*(a/a)$, (3) a(a+a)$. Show the content of the stack after each match.

Thank you!!

CFG after removing left-recursion rules Given CFG E-E+T E--> E-1T E->T T->T*F T->T/F T->F F-(E) F->a E->TQ Q-> +TQ Q->-TQ Q-->? T->FR R-->*FR R--> /FR R--> ? FIRST FOLLOW F->a Predictive parsing table states TQ FR (E TQ +T FR *FR FR