The following is an ambiguous grammar:
Construct for this grammar its collection of sets of LR(0) items. If we try to build an LR-parsing table for the grammar, there are certain conicting actions. What are they?
Suppose we tried to use the parsing table by nondeterministically choosing a possible action whenever there is a con ict. Show all the possible sequences of actions on input abab.