What complexity class is this set of grammars? RE?
That grammar is unrestricted (not context free, as there are right hand sides shorter than the corresponding left hand side). The languages they generate are recursively enumerable, recursive only in special cases.