On 7/9/2010 5:28 PM, Craig DeForest wrote: > > The Right thing to do is probably to have a separate > parser that can recognize arithmetic expressions and > optimize for your particular machine on-the-fly by cutting > up the threaded expression into smaller cache-compatible > chunks, and evaluating them one at a time. That was talked > about a bit on this list sometime in (it seems) the late > Jurassic, but it does require access to the expression > tree, perhaps via a source filter, if the syntax is not to > change.
If by "late Jurassic" you mean last Summer/Fall. :-) The context of the previous discussion was regarding refactoring of the PP generator. Such an optimization could help with transparently mapping to use GPU computation in piddle computations as well. > Source filters do leave something to be desired since Perl > is so hard to parse, ... My thought here was something like a FORALL construct in F9X/HPF. Source filters are cool but problematic as it is difficult to ensure that it doesn't break valid perl contructs. Cheers, Chris _______________________________________________ Perldl mailing list [email protected] http://mailman.jach.hawaii.edu/mailman/listinfo/perldl
