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.

@article{AnconaP94,
  title = {Table Merging by Compatible Partitions for LR Parsers is NP-complete},
  author = {Massimo Ancona and Alessandro Paone},
  year = {1994},
  tags = {completeness, partitioning, parsing},
  researchr = {https://researchr.org/publication/AnconaP94},
  cites = {0},
  citedby = {0},
  journal = {Elektronische Informationsverarbeitung und Kybernetik},
  volume = {30},
  number = {3},
  pages = {123-134},
}