Esolang Interpreters

Interpreters and Boolean generators for 88 esoteric languages: 86 text and 2 raster.

Give it a truth table and a language; it writes a program in that language that computes the table, and runs it for you.

Try it

pip install esolangs
esolangs generate brainfuck 0110 > xor.bf
for i in 00 01 10 11; do printf $i | esolangs run --timeout 5 brainfuck xor.bf; echo " <- $i"; done
# 0 <- 00
# 1 <- 01
# 1 <- 10
# 0 <- 11

0110 is a truth table: the outputs for inputs 00, 01, 10, 11, in that order. This one is XOR. generate wrote a brainfuck program for it, and run fed it one input row at a time.

Install

Image-based programs built in memory need neither extra.

Command line

esolangs --help
esolangs list
esolangs generate Suffolk 0110 > program.txt
printf '01' | esolangs run Suffolk program.txt
printf '01' | esolangs debug --steps 20 --watch-cell 0 brainfuck xor.bf

• list shows every language; list --details marks which have a generator (gen), a template (tmpl) and committed examples (ex).
• debug steps through a program and watches memory.
• Run a program under its own language. Suffolk programs look like brainfuck, but brainfuck rejects or misreads them.

Python

import esolangs

program = esolangs.generate("brainfuck", "0110")
stdin = esolangs.encode_inputs("brainfuck", [0, 1])
output = esolangs.run("brainfuck", program, stdin=stdin, max_steps=10_000)
assert esolangs.read_answer("brainfuck", output) == "1"

Bound a run with:

• max_steps: a command count.
• timeout: wall time. On Windows or in a worker thread, pass isolated=True, timeout=5.
• max_output, and max_memory on Linux: need isolated=True.

The usage guide covers input, templates, answers, debugging and benchmarking.

Examples

esolangs generate FALSE 0110 emits 22 characters computing XOR:

^1&$[^'0=_.]?0=[^1&.]?

Feeding it the two adjacent input characters prints their XOR.

Ready-to-run programs for each of the 85 languages with a boolean generator live in each language's directory.

Languages

Familiar ones include brainfuck, Befunge, Piet, INTERCAL and Malbolge. The catalog lists all of them.

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. 85 of the languages have such a generator, some covering only a documented subset of tables.

Limitations lists those subsets and other known limits; the roadmap tracks open work.

Contributing

See CONTRIBUTING for setup and checks. Licensed GPL v3; see LICENSE.