Question: Let \[G=(V,T,S,P)\] be the phrase-structure grammar with \[V=\{0,1,A,B,S\}\], \[T=\{0,1\}\], and set of productions P consisting of

\[S\to 0A,\] \[S\to 1B,\] \[A\to 010A,\] \[B\to 00B,\] \[A\to 0\] and \[B\to 1\].

Show that “100001” and “00100” belong to the language generated by G. This problem is similar to P.794 #4 and #5.