堆内存上的Python递归

Question

Is there any good methods to place recursion stack on heap to prevent stack overflowing?

Of course, there is method to store own stack and place there function's variables (frame) and just simulate recursion, and, by all appearances, I'm looking for something like decorator, which will do it automatically.

Answer 1

There are a few options here.

1. Use stackless Python, as the name would suggest it doesn't have this problem.
2. Build your own stack instead of using recursion
3. NOT RECOMMENDED Increase the recursion limit https://docs.python.org/2/library/sys.html#sys.setrecursionlimit