1. (i) Analyze the given expressions a+bc2 with different phases of the compiler. (ii) Classify the concepts of compiler and Interpreter. 2. What is meant by lexical analysis? Identify the lexemes that makeup the token in the following program segment. indicate the correspond token and pattern. Void swap(int i, int j) inttt=ii=jj=t} 3. Consider the following grammar: SAAA+AB++By a) Draw the parse tree for the input " y+++y++". b) Show a leftmost derivation of "y +++y++". 4. Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA)- also write the regular expression for following NFA. Check whether the following grammar is a LL(1) grammar. S > iEtS iEtSeSa E>b Name of the Course Teacher Signature