It wouldn’t have, since

    fib(n-1) + fib(n-2)

isn’t a tail call—there’s work left after the recursive calls, so the tail call interpreter can’t optimize it.