Esolang Interpreters

Interpreters and Boolean generators for 78 esoteric languages: 76 text and 2 raster.

generate takes a truth table and returns a program computing it; evaluate runs a supplied program on every row and returns what it answers.

Start with the CLI or Python API. The usage guide covers inputs, templates, answers, and debugging. Limitations records contracts; the roadmap tracks open work.

Command line

python -m pip install esolangs

esolangs --help
esolangs list
esolangs generate Suffolk 0110 > program.txt
printf '01' | esolangs run Suffolk program.txt

esolangs generate brainfuck 0110 > bf.txt
printf '01' | esolangs debug --steps 20 --watch-cell 0 brainfuck bf.txt

The Polynomial interpreter needs the optional mathematics extra: pip install 'esolangs[math]'. PNG loading and saving need pip install 'esolangs[image]'; in-memory raster programs need neither extra.

Python API

import esolangs

program = esolangs.generate("Fargo", "10010110")
esolangs.evaluate("Fargo", program, timeout=None, inputs=3)  # -> '10010110'

evaluate returns the answers observed over every input row; compare the result with an expected table, or use CLI evaluate --table TABLE. Termination answers require a proved halt or cycle; reaching a timeout raises ExecutionTimeoutError. The default row timeout requires a Unix main thread. timeout=None disables that bound and also works on Windows and worker threads.

Run each program with its intended language: a Suffolk program may run as brainfuck but produce the wrong answer. Input formats also vary; use encode_inputs to build stdin.

Examples

esolangs generate Sophie 0110 emits 20 characters computing XOR:

;@0{;}{;@0{#1}{#0}},

Feeding it the two adjacent input characters prints their XOR.

Stepping a program

Generate a program with esolangs generate Flowchart 0110 > flowchart.txt, then run esolangs debug --tui --stdin 01 Flowchart flowchart.txt in a terminal. Here is Flowchart at step 14:

Flowchart  step 14  ip (1, 57, 0, -1)  running
--------------------------------------------------------------------------
1 | ───────────┐     ┌< ]──┐
2 | \ \─\{ }/─< >─/ /┴────< >─/ /─\[ ]/─{ ]─\[ ]/─[ >─\[ ]/─[ }─\[ ]/─{ ]─
--------------------------------------------------------------------------
memory   0 1 1
stack    (empty)
output   ''
views    deques={0: [0, 1], 1: [1]}  pointers=[_Pointer(row=1, col=57, d=(
hjkl move | t break | space step | c continue | r run | b back | q quit

See debugging for controls.

Ready-to-run programs for each of the 77 languages with a boolean generator live in examples/.

Implemented languages

Familiar languages include brainfuck, Befunge, Piet, INTERCAL, and Malbolge.

Line and Piet use the tape and stack interpreter families; their suites run with the rest by just test.

Generators

The truth table is a binary string of length 2**n, most-significant input first; its length implies n, so it isn't passed separately. 77 of the languages have such a generator, some covering only a documented subset of tables.

esolangs list --details marks generators (gen), templates (tmpl), and committed examples (ex). See the usage guide for input conventions and benchmarking.

Contributing

See contributing for setup and verification, and architecture for the execution path. The project is GPL v3; see LICENSE.