what is context free grammer of A O B


if A and B are regular language, what is context free grammer of :

A o b = { x y | x ∈ A and y ∈ B and | x | = | y ∣ }