I am looking for software/algorithm for the smallest context free grammar describing a finite set of words (and no other words).
For a single word I found sequitur
Related to this seems: given a CFG what is the shortest functionally equivalent CFG?
I would prefer the size to be measured by the CNF (for a precise estimate of the size).
To clarify I know the set can be described by a regular expression, this question is about the smallest CFG.