DQbJA?cih{aEVg9'hh%{j+aAabfECffXBC-| 565G5F7XYWCW

StackOverflowException.` The stack has limited memory. It can overflow. Typically the StackOverflowException is triggered by a recursive method that creates a deep call stack. The problem is linked to the concept of the stack memory region in general.`Example.` This program defines a method that causes an infinite recursion at runtime. The Recursive() method calls itself at the end of each invocation. An optimizing compiler could turn this method into a tail recursive call. `Recursion `recursion`However: `The current C# compiler does not achieve this. Each method call frame (activation record) is kept on the stack memory.`After nearly` 80,000 invocations, the stack memory space is exhausted and the program terminates. Usually, the StackOverflowException is caused by an infinite or uncontrolled recursion. `The final numbers` printed by the program execution are displayed in the Output section. This shows that the runtime was able to call this trivial recursive method nearly 80,000 times before the stack memory region was out of space.`The message` "Process is terminated" is displayed at this point and no recovery is possible. If you wrap the initial call to Recursive in a try-catch block, you cannot catch the StackOverflowException. The program is unsalvageable. `Try `try`Catch `catch`Tail recursion and constant space.` The Recursive method body here contains a single call to the same method in its final statement. This could be rewritten as a linear loop, which would increment a counter variable and print its value. `Such a loop could continue indefinitely because it requires constant space on the stack.`But: `The C# compiler was unable to apply this optimization, called tail recursion, in this program.`Summary.` We tested a degenerate program that creates an infinite recursion to demonstrate the StackOverflowException. The program causes an unrecoverable error. The stack space varies based on the host computer, but is in all cases finite. `Warning: `This exception is a real risk to all programs—theoretically even those that do not use recursion.

FGH GGGGG { FGGHRecursiveH(GG) F{H FFGG call GGcall this mG again. FFGThe stack will eventually overflow. FFHGG); FFHRecursiveH(++G); F} FGF{H FFGBegin the infinite recursion. FFHRecursiveH(0); F} } HOutput: truncatedH 79845 79846 79847 79848 79849 79850 79851 Process is terminated dueGHStackOverflowGH.H

!@generates StackOverflowException