1. Consider the context-free grammar with the rules (E is start variable) E+E+TE-TT TTF|T/F|F F (Exly Give parse tree and leftmost derivation for each string a) y+yxy-x b) x/y+x c) (y+x) * (y-x) - y d) ((()))) 2. Convert CFG from question 1 to an equivalent PDA using the procedure given in Theorem 2.20