What is meant by context-sensitive language in Theory of Automata and Formal Languages?

A. a language generated by a context-sensitive grammar B. a language with no decision procedure in all cases C. a language that cannot use terminals D. a language generated only by a regular expression