Is it possible for a Turing machine to be able to reduce a grammar and tell where it fits in chomsky hierarchy?
It is not possible: it is undecidable whether a context-free grammar describes a regular language. For a proof, see e.g. Undecidable Problems for Context-free Grammars by Hendrik-Jan Hoogeboom.