~Compiler Construction~

1. Consider the Grammar:

lexp --> atom | list atom --> number | identifier list --> ( lexp-seq ) lexp-seq --> lexp-seq lexp | lexp

a. remove the left recursion b. Construct First and Follow sets for the nonterminals of the resulting grammar c. Show that the resulting grammar is LL(1) D. Construct the LL(1) parsing table for the resulting grammar