A small example of a non-LR(0) grammar with a shift-reduce conflict is:: (1) E → 1 E: (2) E → 1One of the item sets found is:: Item set 1: E → 1 E: E → 1: + E → 1 E: + E → 1There is a shift-reduce conflict in this item set because in the cell in the action table for this item set and the terminal '1' there will be both a shift action to state 1 and a reduce action with rule 2.