kind of a forth-compiler with some steps more in the
interpreter could do it, except of "one time bindings"
like objects (a/b , find the b). should be as fast
as bytecode?
> Hello [EMAIL PROTECTED]!
>
> On 29-Ago-00, you wrote:
>
> p> Is REBOL interpreted or byte-compiled?
>
> It is interpr
Howdy:
As I understand your question:
Rebol is interpreted.
Even if it were byte-compiled, I presume that
you would still have function calls, but optimized.
Furthermore, in the case of Python or Elisp (as in Emacs)
doesn't the interpreter need to be present to "interpret"
the
Is REBOL interpreted or byte-compiled?
The reason I ask this is I see get word called 800,000 times below and I hope that
each invocation does not incur the overhead of a function call.
source: func [
"Prints the source code for a word."
'word [word!]
][
prin join word ": "
if n
