This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: (e) What are the predict sets for each production? (f) Give the parse table for the grammar. Is this an LL(1) grammar? Why or why not? 3. for the following sub-problems, consider the following grammar: S → AB (7) A → xA (8) A → xyB (9) B → zB (10) B → w (11) (12) (a) Describe the strings generated by this language. (b) Is this language LL(1)? Why or why not? (c) Build the CFSM for this grammar. 1 (d) Build the goto and action tables for this grammar. Is it an LR(0) grammar? Why or why not? (e) If we add the production A → y to the grammar, is it an LR(0) grammar? Why or why not? 2...
View Full Document
- Fall '08
- Grammar, Formal language, Regular expression, Formal grammar, Context-free grammar, finite automata