In an automata or formal-language problem, which option best represents Chomsky hierarchy?

A. the classification of grammars and languages into regular, context-free, context-sensitive, and recursively enumerable classes B. a method for database indexing C. a programming language syntax only D. a list of all compiler phases