22 Oct
2006
22 Oct
'06
12:52 a.m.
Jay West wrote:
If you'd read what some of the previous people
have posted on this
topic, you'd get a clue. Instead, I'm left thinking you chose to ignore
any input that isn't what you want to hear.
I haven't read a single statement that explains how native, compiled
code could possibly be beaten by an interpreter. If I want to evaluate
the expression "a := a + b" on an x86 machine, where a and b are
variables in memory, I would expect a compiler to produce the following:
mov bx,b
add a,bx
You can't tell me any interpreter could possibly beat that. As der
mouse said, even if the interpreter produced exactly the same code,
there is the overhead of the interpreter itself.
--
Jim Leonard (trixter at oldskool.org) http://www.oldskool.org/
Help our electronic games project: http://www.mobygames.com/
Or check out some trippy MindCandy at http://www.mindcandydvd.com/
A child borne of the home computer wars: http://trixter.wordpress.com/