A small example of a non-LR(0) grammar with a reduce-reduce conflict is:: (1) E → A 1: (2) E → B 2: (3) A → 1: (4) B → 1In this case the following item set is obtained:: Item set 1: A → 1: B → 1There is a reduce-reduce conflict in this item set because in the cells in the action table for this item set there will be both a reduce action for rule 3 and one for rule 4.