Oleg Kobchenko wrote:
>
> Well, this opinion is misinformed and hasty
> to say the least.
>
> J uses several parsers. Two most important are
> the explicit parser, which breaks down the controls
> structures, see 5!:7
> http://www.jsoftware.com/help/dictionary/dx005.htm
>
> and the interpreter, which is a context-sensitive
> bottom-up table-driven parser/executor:
> http://www.jsoftware.com/help/dictionary/dicte.htm
>
> (which is obviosly not recursive-descent).
>
>
>
One optimization I would like to see is removing the need to use special
operators to avoid multiple independant passes over an array. One of the
first questions I ever asked here had to do with the forked definition of
average;
avg =: +/ % #
and noted that an imperative language would iterate over the input data
once, whereas here we have two iterations over it, one for +/ the other for
#
The response to me for optimal execution had to do with me manually
rewriting it instead of a multi-pass parser discovering it and optimizing
it.
--
View this message in context:
http://www.nabble.com/squeak-tf4744740s24193.html#a13700779
Sent from the J Chat mailing list archive at Nabble.com.
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
