In an automata or formal-language problem, which option best represents context-sensitive grammar?

A. a grammar with no non-terminals B. a grammar where the left side is always a terminal C. a grammar whose productions do not decrease string length, except limited start-symbol epsilon cases D. a grammar equivalent to every DFA