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.
- Let's build a simple interpreter for APL series (currently incomplete) on Mathspp Blog
- Slides and talk by Rob Pike about implementing ivy
- Bunda-Gerth parsing, implemented with commentary as parse in the dfns workspace
- Parsing and Execution in the J dictionary
- APL In Exposition, from page 54 (labelled 51) down
- J Incunabulum is the initial partial implementation of J
- An Implementation of J describes the implementation of J in C terms
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.
|APL development |
|Interface||Session ∙ Typing glyphs (on Linux) ∙ Fonts ∙ Text editors|
|Publications||Introductions ∙ Learning resources ∙ Simple examples ∙ Advanced examples ∙ Mnemonics ∙ Standards ∙ A Dictionary of APL ∙ Case studies ∙ Documentation suites ∙ Books ∙ Papers ∙ Videos ∙ Periodicals ∙ Terminology (Chinese, German) ∙ Neural networks ∙ Error trapping with Dyalog APL (in forms)|
|Sharing code||Backwards compatibility ∙ APLcart ∙ APLTree ∙ APL-Cation ∙ Dfns workspace ∙ Tatin ∙ Cider|
|Implementation||Developers (APL2000, Dyalog, GNU APL community, IBM, IPSA, STSC) ∙ Resources ∙ Open-source ∙ Magic function ∙ Performance ∙ APL hardware|