Hi. We have a fairly large and complex application (basically a compiler)
that is running into Control Stack Overflow problems. Now I know that
this can be caused by infinite recursion, but in this case, the overflow
is dependant on the size of the input, so I'm guessing it is just very
deep recursion.
Are there any good ways to determine why one has a Control
Stack Overflow? Are there good ways to avoid them?
One would think that writing recursions to be tail recursive
would do it, but I notice that even foldl can get a Control
Stack Overflow, so that doesn't do it.
Cheers,
Theo Norvell
----------------------------
Dr. Theodore Norvell [EMAIL PROTECTED]
Electrical and Computer Engineering http://www.engr.mun.ca/~theo
Engineering and Applied Science Phone: (709) 737-8962
Memorial University of Newfoundland Fax: (709) 737-4042
St. John's, NF, Canada, A1B 3X5
