|
The only reason I converted it to VBS is because I know thats probably what Ruud would have done. Arguably since it traps in both langauges there is more going on here that we dont understand.
My quess is (bear with me) is that IIF always evaluates both expressions - even if it is proved false in the first IIF parm (expression) - and because your recursing inside the IIF - it very quickly runs out of stack space.
Trying to think of a proof for that theory...
-Shawn
[edit]
Now that I think on it more - pretty positive that is whats going on.
[ 08. January 2003, 19:16: Message edited by: Shawn ]
| 
