reverse(L) is the language containing the reverse of all strings in L. In other words, reverse(L) = {UR | WEL}, where wR

[answerhappygod]

Reverse L Is The Language Containing The Reverse Of All Strings In L In Other Words Reverse L Ur Wel Where Wr 1 (24.84 KiB) Viewed 43 times

reverse(L) is the language containing the reverse of all strings in L. In other words, reverse(L) = {UR | WEL}, where wR is the reverse of w. (a) Prove that reverse is closed over the class of context-free languages by providing a con- struction that, given a CFG generating L, explains how to create a CFG that generates reverse(L) (b) Test your reverse construction on the following grammar: S+ asf | bcs Sde €