This is possible when the recursive function call is the last thing that happens in the function body before returning, and it's commonly known as a tail call optimization (or tail recursion ...

Combining static and dynamic analysis allows a recursive function in order to generate a control data flow graph ... As a result, high-level synthesized and parallelized FFT performs 7.76x faster than ...