From 12bf6f0085e171ec0e409ac9062a5f7487b4705e Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sun, 23 May 2021 18:01:40 -0400 Subject: Account for CBQN rearrangement --- docs/running.html | 2 +- running.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/running.html b/docs/running.html index 785c2769..ec2be2c2 100644 --- a/docs/running.html +++ b/docs/running.html @@ -21,7 +21,7 @@

The online REPL is here. The file docs/bqn.js is zero-dependency Javascript, and can be loaded from HTML or Node.js. For command line use, call the Node.js script bqn.js, passing a file and •args, or -e to execute all remaining arguments directly and print the results. This notebook shows how to run it in an Observable notebook.

CBQN

C sources are kept in the CBQN repository, but they also require the self-hosted bytecode to be built using genRuntime in that repository. The script uses bqn (whatever that is) by default, but can be run with another BQN executable: bqn.js or dzaima/BQN will work. For example, run $ path/BQN/bqn.js genRuntime path/BQN/ to bootstrap using Node.js (slow but should be under a minute even on cheap hardware). Once bootstrapped CBQN itself is the fastest option.

-

Options are configured at the top of src/main.c. I uncomment #define FORMATTER to get array formatting like this site uses.

+

Options are configured at the top of src/h.h. I uncomment #define FORMATTER to get array formatting like this site uses.

CBQN uses the self-hosted runtime to achieve full primitive coverage, and implements specific primitives or parts of primitives natively to speed them up. This means primitives with native support—including everything used by the compiler—are fairly fast while others are much slower.

dzaima/BQN

dzaima/BQN is an implementation in Java created by modifying the existing dzaima/APL, and should be easy to run on desktop Linux and Android. It may be abandoned as dzaima is now working on CBQN. It has almost complete syntax support but incomplete primitive support: major missing functionality is dyadic Depth (⚇), Windows (↕), and many cases of set functions (⊐⊒∊⍷, mostly with rank >1).

diff --git a/running.md b/running.md index 1d3c5224..23028295 100644 --- a/running.md +++ b/running.md @@ -26,7 +26,7 @@ The online REPL is [here](https://mlochbaum.github.io/BQN/try.html). The file [d C sources are kept in the [CBQN](https://github.com/dzaima/CBQN) repository, but they also require the self-hosted bytecode to be built using `genRuntime` in that repository. The script uses `bqn` (whatever that is) by default, but can be run with another BQN executable: bqn.js or dzaima/BQN will work. For example, run `$ path/BQN/bqn.js genRuntime path/BQN/` to bootstrap using Node.js (slow but should be under a minute even on cheap hardware). Once bootstrapped CBQN itself is the fastest option. -Options are configured at the top of `src/main.c`. I uncomment `#define FORMATTER` to get array formatting like this site uses. +Options are configured at the top of `src/h.h`. I uncomment `#define FORMATTER` to get array formatting like this site uses. CBQN uses the self-hosted runtime to achieve full primitive coverage, and implements specific primitives or parts of primitives natively to speed them up. This means primitives with native support—including everything used by the compiler—are fairly fast while others are much slower. -- cgit v1.2.3