This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: not? (g) Add one more production for C (i.e., of the form C → α ) that makes this grammar not LL(1). 2. for the following sub-problems, consider the following grammar: S → AB $ (7) A → xB (8) A → xyB (9) B → zA (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. (d) Build the goto and action tables for this grammar. Is it an LR(0) grammar? Why or why not? 1 (e) If we add the production B → yz to the grammar, is it an LR(0) grammar? Why or why not? (f) (ECE 573 only): Build the LR(1) machine for the grammar extended with the rule from (e). 2...
View Full Document
- Fall '08
- Grammar, Formal language, Formal grammar, Context-free grammar