The problem of reducing the number of states in a given LR(k) parser is treated from the standpoint of static merging, introducing a well-defined reduction of the parser. In addition, a locally optimal reduction is presented as a method for reducing the number of states.