Implementation resources: Difference between revisions
Jump to navigation
Jump to search
(→Interpreting: Add ivy talk) |
(Link to list of open-source languages) |
||
| Line 1: | Line 1: | ||
This page lists some resources for learning how to implement array languages. | This page lists some resources for learning how to implement array languages. See also the [[list of open-source array languages]], which links to implementations in a wide variety of styles and languages. | ||
== Interpreting == | == Interpreting == | ||
Revision as of 01:38, 11 February 2021
This page lists some resources for learning how to implement array languages. See also the list of open-source array languages, which links to implementations in a wide variety of styles and languages.
Interpreting
- Let's build a simple interpreter for APL series (currently incomplete) on Mathspp Blog
- Slides and talk by Rob Pike about implementing ivy
- parse commentary in the dfns workspace
- Parsing and Execution in the J dictionary
Compiling
Because traditional APL does not have a context-free grammar, the language must be modified or restricted in some way to allow it to be compiled. K and BQN have context-free grammars, making them immediately suitable for compilation.
- BQN implementation notes
- Aaron Hsu's tree manipulation talks describe a technique used in Co-dfns.
- Compiling APL to JavaScript describes some implementation decisions made in ngn/apl