Answer:
A language is context-free if it is generated by a CFG. For compactness, we write S → 0S1 | ε where the vertical bar means or. Let P be language of palindromes with alpha- bet {a,b}. One can determine a CFG for P by finding a recursive decomposition.
