Verify whether the Grammar generates the string 00110011. If yes, derive a parse tree.

Let a CFG {N,T,P,S} be N = {S, A, B}, T = {0, 1}, Starting symbol = S. Verify whether the grammar S->0B|1A, A- >0|08|1AAJE, B->1|18|OBB generatesthe string 00110011. If yes, derive a parse tree