Question 1: Consider the context free grammar (CFG): S+AB (S being the start symbol) A-aAb aabb B-cBdcd + The grammar is strong LL(k). a) Determine the value of k. b) As a result of a) above, compute the corresponding look ahead sets (for each production) c) As a result of b) above, write (in CH pseudo code) the corresponding recursive descent parser (for the grammar). NB: Assume that 1. the procedure: void expect(char token), has been coded appropriately 2. The next k symbols will be contained in the character array: symbol 3. the procedure: bool equal(char * str1, char * str2), has been coded appropriately to compare the two C++) strings, strl and str2. -- [11[5+[(2)+(6)+(6)]