(Solved): Consider the context free grammar (CFG): \( \mathrm{S} \rightarrow \mathrm{AB} \quad \) (S being t ...

Consider the context free grammar (CFG): \( \mathrm{S} \rightarrow \mathrm{AB} \quad \) (S being the start symbol) \( \mathrm{A} \rightarrow \mathrm{aAb} \mid \) aabb \( \mathrm{B} \rightarrow \mathrm{cBd} \mid \) cd 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 \( \mathrm{b} \) ) above, write (in \( \mathrm{C}++ \) pseudo code) the corresponding recursive descent parser (for the grammar). \( \mathrm{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 \( * \operatorname{str} 1, \operatorname{char} * \operatorname{str} 2) \), has been coded appropriately to compare the two \( \mathrm{C}(++) \) strings, str1 and str2. \( [1]+[5]+[(2)+(6)+(6)] \)