I have this grammar, and I've been asked to eliminate all useless productions.
S-> aS | AB
A-> bA
B-> AA
Now it's pretty easy to see that every production is useless because none of them produce terminal strings. So does this just result in an empty language?