Prove that * l w } r = { r : w ∈ l the set of context-free languages is also closed under the reversal operation. to do this, consider a cfg given by g = {v , σ , r , s }.
prove that l is context-free by constructing.