Consider the following grammar: X -> (Y) | b Y -> Y, X | X 1. for the input string ((b),b,(b,b)),show the parsing stack and actions of the parsing SLR(1) parser. 2. Is this grammar an LR(0) grammar?...

Consider the following grammar:

X -> (Y) | b

Y -> Y, X | X

1. for the input string ((b),b,(b,b)),show the parsing stack and

actions of the parsing SLR(1) parser.

2.  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.