Table Merging by Compatible Partitions for LR Parsers is NP-complete. - Massimo Ancona; Alessandro Paone (J. Inf. Process. Cybern., 1994)