Ealuation Order and Exceptions

Suppose we add an exception mechanism similar to the one used in ML to pure Lisp. Pure Lisp has the property that if every evaluation order for expression e terminates, then e has the same value under every evaluation order. Does pure Lisp with exceptions still have this property? [Hint: See if you can ?nd an expression containing a function call f(e1, e2) so that evaluating e1 before e2 gives you adifferent answer than evaluating the expression with e2 before e1.]