Hello,
I've re-implemented by intepreter in C and have already tackled all the issues
you mention. I'm using a dual-stack system which allows me to do without any
recursion anywhere in my interpreter. Thus deep nesting in Monkey (I too, have
stopped calling my interpreter "Joy") will exhaust the list-node pool but not
crash the underlying C program. Even the recursive combinators don't use up C
stack.
When I'm happy with it I'll post more information.
Here's the rub: the posted benchmark runs 25x slower than Joy :-(
--
Martin Young working for STMicroelectronics at `(o)_(o)' The fat wise /
1000 Aztec West, Almondsbury, Bristol, BS32 4SQ. ( V ) owl eats only >
+44 1454 462 523 `v' Martin.Young@... `.___,' clean mice. /
_(_)_ -="==="=============='