问为什么在python列表理解中不会(总是)出现超过最大递归深度的情况？

EN

from functools import lru_cache

@lru_cache(maxsize = 2048)
def fib(n): return n if n<2 else fib(n-1)+fib(n-2)

# The following will be calculated (and 5000 can be replaced by much bigger integer)
fb = [fib(n)for n in range(5000)]
print(fb[-1])

# but next line:
print(fib(500))
# will cause a RecursionError: maximum recursion depth exceeded
# And will need this to be enabled:

import sys
sys.setrecursionlimit(1024)
print(fib(500))