Hi Rowan,
fixed in SVN 1191.
You should not be too enthusiastic, though, because the speed-ups
that
can be achieved are somewhat disappointing. And due to that, I
haven't put too much effort into fixing faults (sometimes apl
hangs
o
Greetings,
I think getting the parallel processing working is important. It may be
that for various reasons the speedup in general cases is minimal and not
worth the effort. However, I'd imagine that there are particular use-cases
utilizing large arrays where the speedup would be substantial. T
Hi Blake,
it is sort of working, but I could well use some help in
troubleshooting
the remaining problems. I can help fixing them, but finding their
root cause
(and making them reproducible) is a different story.
My current interpretation
Thank you for the explanation Jürgen.
That makes intuitive sense. A shared-memory single threaded service is a
reasonable abstraction.
Another approach, is to compile a subset of APL to an intermediate
representation.
Is there a way to export the AST?
in addition - is there an in-repl method of
Hi Rowan,
a stack-trace for the segfault would be good (command gdb apl
then: 'run' and finally 'bt' after
the segfault,
No idea what AST is.
You could try TAB-expansion to get options in various situations
and try e.g.
]help
Thanks again,
AST = abstract syntax tree. The tree-like structure that is produced by the
parser.
Avoiding compilation is a reasonable restriction.
Thanks for the context.
- Rowan
```
#gdb apl
GNU gdb (Debian 8.3.1-1) 8.3.1
Copyright (C) 2019 Free Software Foundation, Inc.
License GPLv3+: GNU
Hi Rowan,
actually there is no syntax tree in GNU APL. The way in which APL
binds names
(*late and ambiguously) makes it fairly useless to parse it
beforehand. What happens
in GNU APL is prefix matching at runtime. The prefix-table is in src/Prefix.d
Hi Rowan:
What classes of problems are you trying to solve that would benefit from
parallel processing?
Respect
Peter Teeson
> On Oct 16, 2019, at 1:27 PM, Dr. Jürgen Sauermann
> wrote:
>
> Hi Rowan,
>
> actually there is no syntax tree in GNU APL. The way in which APL binds names
> (*late
