Is it possible to turn the blew function into tail-recursion?

Question

I have order matching function that is written in recursive, I wonder if it is possible to turn this fuction into a tail-recursive one? and how.

Or is there a better