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:
“With spring the father-sky remakes the world:
The male shower has flowed into the bride,
Earth’s body; then shifted through sky and sea and land
To touch the quickening child in her deep side.”
—Allen Tate (1899–1979)
“Alas, poor Yorick! I knew him, Horatio: a fellow of infinite jest, of most excellent fancy.... Where be your jibes now, your gambols, your songs, your flashes of merriment that were wont to set the table on a roar?”
—William Shakespeare (1564–1616)