LL(1) Grammer

Question

S -> (L) | a

L -> L . S | S

Question: Make necessary changes to make it suitable for LL(1) parsing and Construct FIRST and FOLLOW sets.

Answer 1

The only problem I see is the Left recursion.

Therefore the new grammar would be

$S\rightarrow \left ( L \right )|a$

$L\rightarrow SL'$

$L'\rightarrow .SL' | \epsilon$

$-----------------------------------$

FT( S)={( ,a }

FT( L)={ ( ,a}

FT( L' )={ .,$\epsilon$}

FL( S)={ $,.,( ,a }

FL( L)={  )}

FL( L')={  ) }

Answer 2

Here every thing you need 

Comments

Pls explain how did you find the follow.