aboutsummaryrefslogtreecommitdiff
path: root/running.md
diff options
context:
space:
mode:
Diffstat (limited to 'running.md')
-rw-r--r--running.md2
1 files changed, 1 insertions, 1 deletions
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.