This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Kleene closure) of the regular expression operations as can be found on page 55 and 56 in the textbook. 3. (50 points) Consider the following LL(1) grammar for a simplified subset of Lisp P → E E → atom → ’ E → ( E Es ) Es → E Es → ε a. Compute the first and follow set of all nonterminals. b. Construct the LL(1) parse table for the grammar c. Show step-by-step (content of stack and input string, as well as the parser action) how the following program is parsed: (cdr ‘(a b c)) d. Show the parse tree of the program in c. 4. (10 points) Eliminate left recursion in the following grammar: S → A a | b A → A c | S d | ε...
View Full Document
- Spring '11
- static semantic error, dynamic semantic error