Consider the grammar lexpatom|list atomnumber|identifier list(lexp-seq) lexp-seqlexp-seq lexp|lexp (1) Remove the left recursion.

Consider the grammar

lexp→atom|list

atom→number|identifier

list→(lexp-seq)

lexp-seq→lexp-seq lexp|lexp

(1) Remove the left recursion.

(2) Construct First and Follow sets for the nonterminals of the resulting gra

mmar.

(3) Show that the resulting grammar is LL(1).

(4) Construct the LL(1) parsing table for the resulting grammar.

(5) Show the actions of the corresponding LL(1) parser,given the input strin

g(a (b (2)) (c)).