1. (30 Points) For the following grammar and the right sentential form E + (T * F + id * id) draw a parse tree and show all phrases, simple phrases, and the handle (E, T, and F are nonterminal symbols; E is the start symbol). E E + T | T T T * F | F F (E) | id

2.(20 Points) Transform the following left recursive BNF grammar into an equivalent non-left recursive grammar (S and A are nonterminal symbols; S is the start symbol; a and b are terminal symbols): S aSb | bAS A AbA | bAA | Aa | aAb