1. Given the context-free grammar G with productions A 00A11| B 1A | 11 B (a) By drawing parse trees and looking for repeated variables, find the shortest string s E L(G) for which the Pumping Lemma applies. (b) For the string you found above, if suwxyz as in the PL, identify the substrings u,v, T,y, 2. (c) Describe the pumped strings u xy’z, for i 2 0 that will be in L(G).
OR
OR