E-, ID | ID . E | E E | (E) The two rules for parsing with this (ambiguous) grammar are: Application is left associative. So "E1 E2 E3" is parsed as "(El E2) E3 E2)" Lambda extends as far to the right as possible. So " x . El E2" is parsed as " x . (El E (E) is the grouping rule. So "( x . El E2) E3" is parsed as "(2x . (El E2)(E3)" . Bearing that in mind, draw parse trees for the following lambda terms: (c) x . xyAX.yx