h) Induction variable elimination

Given the following grammar G S rightarrow CC C rightarrow cC C rightarrow d a) - Building the LR(1) Automata for G: b). Building the LALR Automata G: Consider the following grammar. S rightarrow As A rightarrow BCA A rightarrow BCa B rightarrow b C rightarrowrightarrow c a. Show that the grammar is not LL(1). b. Is the grammar LL(k)? If so, the k value and show the paring table. 6. 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