QUESTION 2 ONLY

Theorem 2.20: A language is context free if and only if some push-down automaton recognizes it.

1. Consider the context-free grammar with the rules (E is start variable) Give parse tree and leftmost derivation for each string a) a b) ataxa c) axata d) (a+a) x (a+a)+a 2. Convert CFG from question 1 to an equivalent PDA using the procedure given in Theorem 2.20