Greetings. :)

[Greg Munt]

On Mon, 7 Apr 1997, Chris Gray wrote:

> Perhaps we can come up with a gradient (I'm sure this has been done before!),
> and we can all point to where we are on it:
> 
> 1.  native machine code
> 2.  threaded code
> 3.  bytecode
> 4.  parse tree traversal
> 5.  pre-tokenized interpretation
> 6.  straight text interpretation

Would anyone be able to give a short description of all of these? 
(Especially threaded and bytecode) I have been trying to find out about 
threads - i got the pthreads lib for linux, the docs for that are 
impossible to understand without *some* kind of prior knowledge of what 
threads are - I have heard that the linux port of it isnt very 
good/stable/efficient and martin keegan has gone so far as to advise not 
to use them under any kind of unix..

Also, last week I declared all my code as junk. I'm now considering 
writing my mud in some kind of interpreted language, but efficiency and 
speed is a concern (is there anything else i should also be concerned 
with?). Im not 'definite' about going interpreted tho, although it seems 
highly likely that im about to embark on my sixth complete rewrite :-/

Has anyone ever done an analysis comparing the above 6 methods? It would 
be interesting to look at.

------------------------------------------------------------------------------
        T  H  E     F  R  O  N  T  I  E  R  S     P  R  O  J  E  C  T   
    http://www.uni-corn.demon.co.uk   telnet://linux2.cms.shu.ac.uk:9999
   A student who changes the course of history is probably taking an exam