In beta-o I have rewritten the parser one more time. I don't see how it
can get much faster. In a weakly-typed language like J there is only so
much analysis that can be done before executing a sentence. I wonder
how J performs compared to other popular languages, especially Python
which is what the cool kids are using. If anyone is willing to do the
comparison, I'd be obliged.
I am thinking of measuring the execution time of a simple program, one
that does scalar-only operations so we are focusing on the parser. A
sample J program would be:
v =: {{ totl =. 0 for_i. y do. totl =. totl + i * i_index end. totl }}
10 (6!:2) 'v a' [ a =. i. 1e6
Large improvement would require heroic intervention: parsing & caching
sentences on the fly & watching assignments to make sure the cached
parse is valid. I would rather avoid that.
Henry Rich
--
This email has been checked for viruses by AVG.
https://www.avg.com
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
