Consider the following grammar: X -> (Y) | b Y -> Y, X | X A: . List LR(0) items for this grammar b. construct the DFA of these LR(0) items c. construct the SLR(1) parsing table d. for the input...

Consider the following grammar: X -> (Y) | b
Y -> Y, X | X
A: . List LR(0) items for this grammar
b. construct the DFA of these LR(0) items
c. construct the SLR(1) parsing table
d. for the input string ((b),b,(b,b)),show the parsing stack and actions of the parsing SLR(1) parser.
e. Is this grammar an LR(0) grammar? If not, describe the LR(0) conflict. If so, construct the LR(0) parsing table, and describe how a parse might differ from an SLR(1) parse.

pay attention to the grammar given