gambit VS ribbit

- Gambit: web-server example

Not to be confused with Gambit (Scheme programming language implementation):

https://github.com/gambit/gambit

https://gambitscheme.org/

The Ribbit compiler was developed using Gambit but most of the code is portable. I rewrote a few parts with cond-expand to port rsc.scm to older versions of Gambit and also Guile and Chicken. If you pull the latest commit the Ribbit system should work with any of those Scheme systems. The README also contains usage instructions, here is a relevant part:

The Ribbit compiler is written in Scheme and can be executed with Gambit, Guile or Chicken. It has been tested with Gambit v4.7.5 and above. For the best experience install Gambit from https://github.com/gambit/gambit .

Currently Ribbit supports the target languages C, JavaScript, Python and Scheme which are selectable with the compiler's `-t` option with `c`, `js`, `py`, and `scm` respectively. The compacted RVM code can be obtained with the target `none` which is the default.

The `-m` option causes a minification of the generated program. This requires a recent version of Gambit.

The `-l` option allows selecting the Scheme runtime library (located in the `lib` subdirectory). The `min` library has the fewest procedures and a REPL that supports the core Scheme forms only. The `max` library has most of the R4RS predefined procedures, except for file I/O. The `max-tc` library is like `max` but with run time type checking. The default is the `max-tc` library.

Here are a few examples:

    Use Gambit to compile the minimal REPL to JavaScript

That is a bummer about the expired certificate. You can access the site using http instead of https if you are comfortable doing so. I have never seen this live REPL before and have just used their Github repo to get the latest: https://github.com/gambit/gambit

I think it is great someone is trying to get Racket compiling to Javascript again. I also agree with you about the REPL; while it is interesting to compile Racket to JS, having a REPL, a live environment and all the features of something like ClojureScript has much more utility.

Don't hesitate to submit the problems you encounter to the issue tracker on github (https://github.com/gambit/gambit/issues).

But it's command like tool, I don't think that there is Online tool even smilar to the Python tool you showed. You can try creating issue with a question on https://github.com/gambit/gambit/issues Marc Feeley may consider that it's also nice idea to show usage of Gambit, he was working on making Gambit on new try.scheme.org website, I've also did some help.

Edit: somebody opened an issue for this https://github.com/gambit/gambit/issues/649

Marc Feeley's lab develops Ribbit Scheme, which is a tiny Scheme implementation. It is an AOT compile which produces a string of bytecode that is interpreted by a VM, of which there are various implementations. The one in C could be compiled to your target microcontroller and thus give you a Scheme REPL.

I have a question regarding Ribbit Scheme. (https://github.com/udem-dlteam/ribbit).

You might want to look at this 400 LOC implementation of Scheme in Haskell: https://github.com/udem-dlteam/ribbit/blob/main/src/host/hs/rvm.hs

Ribbit is a very interesting minimal Scheme driven by Marc Feeley. I spent a bit of time to benchmark some of the target runtimes and the results might be of interest to some.

A small and portable Scheme implementation that supports closures, tail calls, first-class continuations, a REPL and AOT and incremental compilers. All that for a run time footprint around 4 KB! https://github.com/udem-dlteam/ribbit

> No dynamic memory allocation = no garbage collector, no non-deterministic allocation/deallocation, no write barriers, no out-of-memory possibilities, no fragmentation. For a surprisingly large class of programs, this is a great situation!

I know you know this already, but your statement is a little too broad. Those problems all still exist, but are greatly reduced. Data structures still need to be compacted, caches evicted, scratch space cleared, etc. It is just that one class of intractable issues gets removed when dynamic memory allocation goes away.

On a side note, have you seen this? https://github.com/udem-dlteam/ribbit

You should also mention the JS version of Ribbit Scheme which supports tail-calls, continuations, a REPL, an AOT and incremental compilers, and a 4K run time footprint. There are also C, Python and Scheme versions of the Ribbit VM (more to come!). Demo: https://udem-dlteam.github.io/ribbit/repl-max-tc.html Repo: https://github.com/udem-dlteam/ribbit Paper: http://www.iro.umontreal.ca/\~feeley/papers/YvonFeeleyVMIL21.pdf Clearly Ribbit has fewer features than Gambit to achieve a 4K footprint. Gambit (700K footprint) offers a better development environment, in particular precise error messages and live debugging with a REPL in the browser. Gambit also has: - R7RS conformance including R7RS modules - a JavaScript FFI that supports asynchronous calls between JS and Scheme - a thread system build on top of first-class continuations - serializable closures and continuations allowing task migration - access to files on the server using Scheme file I/O - Scheme to JS compilation for fast execution