Markus, I don't think there is any program that can show you the worst-case stack growth. That would require artificial intelligence as well as knowing what external conditions could influence program execution. The best a program can do is simulate your program and report how much the stack grew during that simulation.

If you wrote the program you should have a feel for "how bad" it can get based on how you've written your program. You should have a feel for what conditions can arise that would cause your program to increase the stack size.

As long as you avoid recursion I can't imagine a practical reason why you'd overflow the stack in a well-designed program that makes reasonable use of the stack.

Craig Steiner