Which statement correctly describes unrestricted grammar?

Correct Answer: D

a grammar type powerful enough to generate recursively enumerable languages

unrestricted grammar is correctly described as a grammar type powerful enough to generate recursively enumerable languages.