Current

• Reva does tail-recursion optimization. So a final "call xxx" is resolved to "jmp xxx". This eliminates the need to push a return address as well as the necessity for a final "ret". It makes it possible to do "recursion" without overflowing the return-stack.

• Conditionals and loops attempt to use a short jmp if possible; but will use a large jmp if needed.