Consider the following Context Free Grammar G: {(S), (a, b, @, $), P, S}

P: S--> abl SS | aSb | @S@

Construct a Push Down Automata that will accept all the strings belongs to L(G). Represent it in mathematical form.

170 Upload answer sheets Consider the following Context Free Grammar G (A, B, C), (2, #). P. S): P: S AB BC ABACCALZ BCC c AB Using CYK membership algorithm find out whether the string z #z # is a member of the language L(G) or not