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 interpreted. Compiling REBOL is virtually impossibile, > unless you want to do some magic (but that wouldn't be very fast, > I think). > > p> The reason I ask this is I see get word called 800,000 times > p> below and I hope that each invocation does not incur the > p> overhead of a function call. > > Well, SOURCE isn't certainly a critical function. :-) Anyway, you > could use the following "optimized" version if you really want to. > > source: func [ > "Prints the source code for a word." > 'word [word!] > ][ > prin join word ": " > if not value? word [print "undefined" exit] > word: get word > either any [native? :word op? :word action? :word] [ > print ["native" mold third :word] > ] [print mold :word] > ] > > Regards, > Gabriele. > -- > Gabriele Santilli <[EMAIL PROTECTED]> - Amigan - REBOL programmer > Amiga Group Italia sez. L'Aquila -- http://www.amyresource.it/AGI/ > > >
