I want to derive a context free grammar for the following language on alphabet $\Sigma=\{a,b\}$:$\qquad\displaystyle \{ xax'yby'z \mid x,y,z\in\Sigma ^*, |x|=|x'|, |y|=|y'|, |z|=|x|+|y|\}$I am convinced that this language is context-free because this is part of my proof to a theorem given in textbook, but haven't yet seen a context-free grammar for it.
Looking for a contex-free grammar for the following language
formal languages;context free