Consider the following grammar: E->(L) l a L->L,E | E a. Construct the DFA that recognize viable prefixes. b. Is this grammar a LR(o) grammar? If not, describe the conflict. c. Construct the action table and goto table d. Give the parsing process of string (a,a) Show transcribed image text Consider the following grammar: E->(L) l a L->L,E | E a. Construct the DFA that recognize viable prefixes. b. Is this grammar a LR(o)
