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 deep affection and recollection
I often think of the Shandon bells,”
—Francis Sylvester Mahony (1805–1866)
“A little grit in the eye destroyeth the sight of the very heavens, and a little malice or envy a world of joys. One wry principle in the mind is of infinite consequence.”
—Thomas Traherne (1636–1674)