undefined

Construct a new CFG, denoted as G = (V, E, R, S), which can generate the languages IR and prefix(L), respectively, to show that the class of context-free languages is closed under these operations. (i) Show that IR = {wR| W E L} is CFL is L is context-free (Where LR is the reversal of L). (ii) Show Prefix(L) = {prefir(w)[W E L} is a CFL if L is context-free