Summary: We show that the problem of table merging by compatible partitions for LR $φ$-inaccessible parsing tables is NP-complete. The result is obtained by proving that the partition into cliques problem can be reduced to that problem in polynomial time.