That depends entirely on your definitions when you’re dealing with a listener, especially a sophisticated one like the Symbolics Dynamic Listener or the CLIM Listener. If you want the forms entered to go through term rewriting before or as part or evaluation, that’s entirely feasible.

One can develop rule-based term rewriting systems in Lisp (and integrate them) and there are some, but itself is not defined or implemented as such.

That can be seen by the clumsy implementation of lexical scope (renaming vars, etc.) in Mathematica or the limited compilation of the Mathematica language.