This question already has an answer here:
There are four types of chomsky hierarchy (specified for formal languages):
Type-0 Recursively enumerable Type-1 Context-sensitive Type-2 Context-free Type-3 Regular
I consider that, it should be the type-0. This type is represented by Turing machine. I think, that it is because of the dynamic changing tokens during runtime, dynamic changing of the meaning of macros, calculating Lambda calcul (what should be the most important).
Do you have any advice?