Take a simple string expression, for example:
D$=A$+B$+C$
[...] The code could get as bad as: [...really stupid
implementation...]
Well, yes. (And an interpreted implementation could be stupid too.) I
don't think anyone has said that a stupid compiled implementation can't
be beat by a smart interpreter.
What I'm having trouble with is the claim that some interpreters can
beat compiled code in general, rather than specific (and stupid)
compilers' output.
/~\ The ASCII der Mouse
\ / Ribbon Campaign
X Against HTML mouse at rodents.montreal.qc.ca
/ \ Email! 7D C8 61 52 5D E7 2D 39 4E F1 31 3E E8 B3 27 4B