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:
“But in our experience, man is cheap and friendship wants its deep sense. We affect to dwell with our friends in their absence, but we do not; when deed, word, or letter comes not, they let us go.”
—Ralph Waldo Emerson (1803–1882)
“I feel that the Godhead is broken up like the bread at the Supper, and that we are the pieces. Hence this infinite fraternity of feeling.”
—Herman Melville (1819–1891)