  Using the usual syntax for first-order formulae, the set of stratifiable
formulae of set theory forms a formal language. We show that this language, and
its complement, are not context-free. However, in a slightly enriched syntactic
system we may consider a subset of the stratifiable formulae that is full under
$\alpha$-equivalence, and demonstrate that this set is context-free.
