Implementation resources: Difference between revisions
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
* [https://www.researchgate.net/publication/234776477_APL_two_by_two-syntax_analysis_by_pairwise_reduction Bunda-Gerth parsing], implemented with commentary as [https://dfns.dyalog.com/n_parse.htm parse] in the [[dfns workspace]] | * [https://www.researchgate.net/publication/234776477_APL_two_by_two-syntax_analysis_by_pairwise_reduction Bunda-Gerth parsing], implemented with commentary as [https://dfns.dyalog.com/n_parse.htm parse] in the [[dfns workspace]] | ||
* [https://www.jsoftware.com/help/dictionary/dicte.htm Parsing and Execution] in the [[J]] dictionary | * [https://www.jsoftware.com/help/dictionary/dicte.htm Parsing and Execution] in the [[J]] dictionary | ||
* [http://www.softwarepreservation.org/projects/apl/Papers/197201_APL%20In%20Exposition_320-3010.pdf APL In Exposition], from page 54 down | * [http://www.softwarepreservation.org/projects/apl/Papers/197201_APL%20In%20Exposition_320-3010.pdf#page=54 APL In Exposition], from page 54 (labelled 51) down | ||
* [https://rickyhan.com/jekyll/update/2020/01/16/j-incunabulum-disected.html J Incunabulum] is the initial partial implementation of J | * [https://rickyhan.com/jekyll/update/2020/01/16/j-incunabulum-disected.html J Incunabulum] is the initial partial implementation of J | ||
Revision as of 11:53, 3 January 2022
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
- 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
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
| APL development [edit] | |
|---|---|
| Interface | Session ∙ Typing glyphs (on Linux) ∙ Fonts ∙ Text editors |
| Publications | Introductions ∙ Learning resources ∙ Simple examples ∙ Advanced examples ∙ Mnemonics ∙ ISO 8485:1989 ∙ ISO/IEC 13751:2001 ∙ A Dictionary of APL ∙ Case studies ∙ Documentation suites ∙ Books ∙ Papers ∙ Videos ∙ APL Quote Quad ∙ Vector journal ∙ 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 | Resources ∙ Open-source ∙ Magic function ∙ Performance ∙ APL hardware |
| Developers | Timeline of corporations ∙ APL2000 ∙ Dyalog ∙ IBM ∙ IPSA ∙ STSC |