I agree that it sounds cool and would be interested in seeing benchmarks. It should be possible to benchmark without implementing the full functionality by hard coding support temporarily for a certain expression to test. It seems like the gains would be larger on more expressions with more tokens ... not just (+/%#) ?
On Tue, Jun 21, 2016 at 1:46 AM, 'Pascal Jasmin' via Source < sou...@jsoftware.com> wrote: > That would seem cool. So 3: '(+/%#) y' would be a bit faster when applied > with rank? > > Some ideas: Only "optimize" when assigned to name or applied with rank. > In your noun example, limit to 4096 bytes or have a 9!:xx setting for this > limit (expecially if tempted to make default lower). > > > > > > ----- Original Message ----- > From: Henry Rich <henryhr...@gmail.com> > To: Source forum <sou...@jsoftware.com> > Sent: Monday, June 20, 2016 11:08 PM > Subject: [Jsource] PPPP (Pre-Parsed Parenthesized Primitives) > > It occurs to me that in explicit definitions, parenthesized expressions > that contain only primitives could be parsed at definition time and > replaced with a single word in the queue. This would save parsing time > during execution. The only downside I can see is that something like > (<1000 1000 $ a:) would tie up a lot of memory - maybe I would have to > check for that. > > Any other objections? > > Henry > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
