What complexity class is this set of grammars? RE? Given a grammar where every rule has the form $X \to YZ$, $XY \to Z$, $X \to a$, or $X \to \epsilon$ where $X,Y,Z$ range over nonterminals and $a$ ranges over terminals, and given a nonterminal $S$ and a terminal $a$, determine whether $S$ can derive $a$.

(Thanks Yuval Filmus for pointing out this characterization - see first comment in linked question)

What complexity class does this correspond to? RE?

Related questions:

What complexity class does is this set of grammars? L-complete?

What complexity class does is this set of grammars? NL-complete?

What complexity class is this set of grammars? In between NL and P?

What complexity class is this set of grammars?
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.