Consider the following grammer, top - down parsing LL(1) parsing

S---> (L) | a L-----> SL' L'-----> | , SL'

Calculate First and Follow value and create parse table for above grammer and Use String ( a,a) for stack implementation and parse tree.