From 9327d48ba01c4d44f38745b6b907b93f49b54622 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sat, 5 Sep 2020 22:51:15 -0400 Subject: Separate WebAssembly prototype wc.bqn from dzaima/BQN backend dc.bqn --- docs/running.html | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) (limited to 'docs/running.html') diff --git a/docs/running.html b/docs/running.html index c5c3771b..f199925b 100644 --- a/docs/running.html +++ b/docs/running.html @@ -7,8 +7,9 @@

How to run BQN

BQN is in an early stage of development, and no implementation is complete yet. However, it's a relatively simple language to implement, and a few implementations come close. At the moment, dzaima/BQN is the most usable version, with good performance and error reporting.

BQN

-

This repository contains a BQN implementation written mainly in BQN: the bytecode compiler is completely self-hosted, and the majority of the runtime is written in BQN except that it is allowed to define primitives; some preprocessing turns the primitives into identifiers. The remaining part, a VM, can be implemented in any language to obtain a version of BQN running in that language. A Javascript implementation allows BQN to be run as a REPL (running locally) from this webpage or in Node.js as a library. The bytecode is also the same as dzaima/BQN's format, and an extension to the compiler adjusts the slightly different block declarations to target dzaima+reference BQN. This version also contains an earlier experiment targetting WebAssembly that works only on a very small subset of BQN.

-

This version is not yet suitable for serious programming. The runtime checks for errors but the compiler does not, so syntax errors go unreported. It does not yet support function headers or multiple bodies. The Javascript-based compiler is also slow, taking about 0.05 seconds plus 1 second per kilobyte of source (this is purely due to the slow runtime, as dzaima+reference achieves 3ms/kB with the same compiler once warmed up).

+

This repository contains a BQN implementation written mainly in BQN: the bytecode compiler is completely self-hosted, and the majority of the runtime is written in BQN except that it is allowed to define primitives; some preprocessing turns the primitives into identifiers. The remaining part, a VM, can be implemented in any language to obtain a version of BQN running in that language. A Javascript implementation allows BQN to be run as a client-side REPL or in Node.js as a library.

+

The bytecode is also the same as dzaima/BQN's format, and an extension to the compiler adjusts the slightly different block declarations to target dzaima+reference BQN. There is also an earlier experiment targetting WebAssembly that works only on a very small subset of BQN.

+

This version is not yet suitable for serious programming. The runtime has full error checking but the compiler does not, so syntax errors can go unreported. It does not yet support function headers or multiple bodies. The Javascript-based compiler is also slow, taking about 0.05 seconds plus 1 second per kilobyte of source (this is purely due to the slow runtime, as dzaima+reference achieves 3ms/kB with the same compiler once warmed up).

All versions have automated tests in the test directory, with the self-hosted version (test/tj.js) and WebAssembly backend (test/t.js) tested with Javascript using Node and the dzaima/BQN backend tested with BQN itself (test/bt).

dzaima/BQN

dzaima/BQN is an implementation in Java created by modifying the existing dzaima/APL. It should be easy to run on desktop Linux and Android. It is still in development and has almost complete syntax support but incomplete primitive support.

-- cgit v1.2.3