Very Deep or Infinite Recursion
The most common cause of stack overflow is excessively deep or infinite recursion. Languages like Scheme, which implement tail-call optimization, allow infinite recursion of a specific sort—tail recursion—to occur without stack overflow. This works because tail-recursion calls do not take up additional stack space.
An example of infinite recursion in C.
int foo { return foo; }The function foo, when it is invoked, continues to invoke itself, using additional space on the stack each time, until the stack overflows resulting in a segmentation fault.
Read more about this topic: Stack Overflow
Famous quotes containing the words deep and/or infinite:
“Joy wants the eternity of all things, wants deep, wants deep eternity.”
—Friedrich Nietzsche (1844–1900)
“In talking with scholars, I observe that they lost on ruder companions those years of boyhood which alone could give imaginative literature a religious and infinite quality in their esteem.”
—Ralph Waldo Emerson (1803–1882)