For each of the (augmented) grammars of Exercise 4.2.2(a)- (g): a) Construct the SLR sets of items and their GOTO function. b) Indicate any action conflicts in your sets of items. c) Construct the...

For each of the (augmented) grammars of Exercise 4.2.2(a)- (g):

a) Construct the SLR sets of items and their GOTO function.


b) Indicate any action conflicts in your sets of items.

c) Construct the SLR-parsing table, if one exists.

Exercise 4.2.2(a)

a) S 0 5 1 | 0 1 with string 000111.

Consider the family of grammars Gn defined by: 5 -» Ai bi for 1 <><> aj Ai | aj for 1 <><>

a) Gn has 2n 2 - n productions.

b) Gn has 2n + n2 + n sets of LR(0) items.

c) Gn is SLR(l).


What does this analysis say about how large LR parsers can get?