As the author points out, the standard does not mention stack overflow at all. From this, the author concludes an implementation that always overflows stack is conforming, therefore no strictly conforming programs exist, therefore all implementations are conforming. More reasonable conclusion is that under the current standard, implementations are not allowed to overflow stack, therefore no bounded storage conforming implementation is possible, and all current implementations are buggy. Is anyone surprised that all current implementations are buggy?<p>It would have been more interesting if the author discussed Microsoft’s solution to this problem, namely __try&#x2F;__except and EXCEPTION_STACK_OVERFLOW, which is actually used by programmers to recover from stack overflow.