[pypy-issue] [issue873] PyPy almost 300 times slower in recursive AST evaluation

[anon]

anon <b10419697 at klzlk.com> added the comment:

It also produces a segfault when run with CPython 2.7 if the value on line 75 is
increased. It's worth noting that PyPy, unlike CPython, uses a huge amount of
memory too.

The program essentially creates an AST representing the recursive function f(x)
-> 1 if x<1 else f(x-1)+2. Each Node on the tree is stored as a list with the
first value the function and the other values the arguments. It's actually a
greatly simplified version of real code.

________________________________________
PyPy bug tracker <tracker at bugs.pypy.org>
<https://bugs.pypy.org/issue873>
________________________________________