2. Give a CH+/Java function int Mul (int temp, int varl) { temp = temp + varl; return temp; } List all lexemes and tokens. 3. Using the recursive-descent parsing process to implement the syntax analysis for the following language. Assuming lex() is available. > > = + |