Given the following grammar G: S rightarrow CC C rightarrow cC C rightarrow d a). Build the LR(I) Automata for G: b). Building the LALR Automata for G: Consider the following grammar. S rightarrow As A rightarrow BCA A rightarrow BCa B rightarrow b C rightarrow c a. Show that the grammar is not LL(I). b. Is the grammar LL(k)? Is so, give the k value and show the parsing table. Explain the following code optimization techniques with one example of each technique. a). Constant propagation: b). Constant folding: c). Algebraic simplification: d). Strength reduction: e). Copy propagation: f). Dead code elimination: g). Loop invariant detection and code motion: h). Induction variable elimination. Given the following grammar G: S rightarrow CC C rightarrow cC C rightarrow d a). Build the LR(I) Automata for G: b). Building the LALR Automata for G: Consider the following grammar. S rightarrow As A rightarrow BCA A rightarrow BCa B rightarrow b C rightarrow c a. Show that the grammar is not LL(I). b. Is the grammar LL(k)? Is so, give the k value and show the parsing table. Explain the following code optimization techniques with one example of each technique. a). Constant propagation: b). Constant folding: c). Algebraic simplification: d). Strength reduction: e). Copy propagation: f). Dead code elimination: g). Loop invariant detection and code motion: h). Induction variable elimination