What is meant by CFG simplification in Theory of Automata and Formal Languages?

A. removing useless, unreachable, or non-generating symbols and unnecessary productions B. converting every grammar into a DFA C. adding infinite terminals D. making every language regular