On Sat, Jan 17, 2009 at 4:33 PM, Paul Moore <p.f.mo...@gmail.com> wrote: > 3. Is there a good example anywhere of how to write a high-performance > bytecode interpreter in factor, which I could use as a guide to > implementing the Lua algorithm in factor (my experience so far says > that this isn't something I'll get right if I use the "write correct, > high-level code first, then optimise later" approach given my current > level of knowledge :-))
I suggest getting it right, then optimizing later. Test it on smaller inputs perhaps, to see if its just slow, or hanging. Slava ------------------------------------------------------------------------------ This SF.net email is sponsored by: SourcForge Community SourceForge wants to tell your story. http://p.sf.net/sfu/sf-spreadtheword _______________________________________________ Factor-talk mailing list Factor-talk@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/factor-talk
