Table Merging by Compatible Partitions for LR Parsers is NP-complete

Massimo Ancona, Alessandro Paone. Table Merging by Compatible Partitions for LR Parsers is NP-complete. Elektronische Informationsverarbeitung und Kybernetik, 30(3):123-134, 1994.

Abstract

Abstract is missing.