6. Given the grammar G = ({E,F,T},{a,b,(,),+,},E,P} (Note E,F, and T are nonterminals, a, b, (, ), +, , are terminals, E is the starting nonterminal symbol) with production rules, P , as follows: Give parse trees for each string: (a) ((a+b)) (b) (a+b)a E E+T|T TTF|F F (E)|a|b|(|)| + | (c) ((a+a)+b)

(d)What is the difference between a right-most derivation and a left-most derivation? Explain and give examples.

(e)List and explain two properties of the definition of a parse (derivation) tree.