WingNews logo WingNews
top | item 27728071

Let's build a simple interpreter for APL, part 2 (2020)

115 points| miguendes | 4 years ago |mathspp.com

9 comments

order

RojerGS|4 years ago

OP here, thanks for sharing!

Feel free to ask any questions you might have in here or in the comments of the blog articles.

The series is not complete yet but rest assured that I haven't given up on it :)

ALLTaken|4 years ago

I missed the first part, but will check it out. I'm on sick leave and can't do anything anyway.

My main question so far is: Can you make use of the speed of Array-based languages, but save computation time, by compiling it into a solution-graph-assembly? Sorry, if my wording is to amateurish.

EDIT: What's the difference between symbolic computation, graph computation and array-based symbolic computation? I mean they have different internal representations due to semantics, but look alike mostly.

Would it be possible to "generate" an "optimal" internal structure for an array-based symbolic language like APL, based on the input?

miguendes|4 years ago

Awesome work, OP. I'm a really fan of your work, you make solid stuff!

How many more parts do you plan to do?