Why, if there is not significant overload of CIL’s stack for second example, does it crash “faster” than the first one? Note that the number of CIL instructions does not accurately represent the amount of work or memory that will be used. A single instruction can be very low impact, or very high impact, so … Read more
Note the absence of newline characters in 433943394339. It indicates that something wrong happens inside System.out.println(). The essential point here is that System.out.println() requires some stack space to work, so that StackOverflowError is thrown from System.out.println(). Here is your code with marked points: public static void main(String[] args) { try{ System.out.println(i); // (1) i++; main(args); … Read more
V8, the JavaScript engine in Chrome, had TCO support for a while, but as of this updated answer (November 2017) it no longer does and as of this writing, there is no active development on TCO in V8, and none is planned. You can read the details in the V8 tracking bug for it. TCO … Read more
The stack of a thread is created by Windows. It uses so-called guard pages to be able to detect a stack overflow. A feature that’s generally available to user mode code as described in this MSDN Library article. The basic idea is that the last two pages of the stack (2 x 4096 = 8192 … Read more
Open the Run Configuration for your application (Run/Run Configurations…, then look for the applications entry in ‘Java application’). The arguments tab has a text box Vm arguments, enter -Xss1m (or a bigger parameter for the maximum stack size). The default value is 512 kByte (SUN JDK 1.5 – don’t know if it varies between vendors … Read more
The key to answering this is deferred execution. When you do this items = items.Select(item => items.First(i => i == item)); you do not iterate the items array passed into the method. Instead, you assign it a new IEnumerable<int>, which references itself back, and starts iterating only when the caller starts enumerating the results. That … Read more
Executive summary: I wrote a simple implementation of an algorithm… that wasn’t tail-recursive. I compiled it with OCaml under Linux. It worked fine, and finished in 0.14 seconds. It was then time to port to F#. I translated the code (direct translation) to F#. I compiled under Windows, and run it – I got a … Read more
From node –help: node –max-stack-size=val Update: as the comments indicate, even though the help text still lists the –max-stack-size option, in node v0.10.x you need to use –stack-size instead. node –stack-size=val
Stack overflows I’ll make it easy for you; but this is actually quite complex… Note that I will generalize quite a bit here. As you might know, most languages use the stack for storing call information. See also: https://msdn.microsoft.com/en-us/library/zkwh89ks.aspx for how cdecl works. If you call a method, you push stuff on the stack; if … Read more
From Microsoft: Starting with the .NET Framework version 2.0, a StackOverflowException object cannot be caught by a try-catch block and the corresponding process is terminated by default. Consequently, users are advised to write their code to detect and prevent a stack overflow. For example, if your application depends on recursion, use a counter or a … Read more