On the Complexity of the Smallest Grammar Problem over Fixed Alphabets