Brainfuck Compiler, JIT, Interpreter and Debugger
mkdir build && cd build
cmake ..
make
./Brainfuck {-i | -d | -c | -co | -j | -jo} program.bf [inputs.txt]
-i for the Interpreter
-d for the Debugger
-c for the Compiler
-co for the optimized Compiler
-j for the JIT
-jo for the optimized JIT
program.bf must be a text file containing the Brainfuck program to execute/compile
inputs.txt is an optional file containing inputs instead of using stdin (useful for debugging, see Notes below)
./Brainfuck -i program.bf
Simple interpretation of the program (much slower than Compiler and JIT)
./Brainfuck -c program.bf > compiled_brainfuck.s
gcc compiled_brainfuck.s -o executable_brainfuck
./executable_brainfuck
Compiles the program for x86_64 (amd64) Linux following System V ABI.
./Brainfuck -j program.bf
Just-In-Time compilation and direct execution for x86_64 (amd64) Linux following System V ABI
Using -co or -jo will result in optimized code that merge repeated Brainfuck instructions together.
For example, the sequence + + + compiled/jitted without optimizations will result in the following x86 instructions:
add $1, (%rbx)
add $1, (%rbx)
add $1, (%rbx)
On the other hand, using the optimized compiler/JIT will result in a single instruction:
add $3, (%rbx)
./Brainfuck -d program.bf
Debug the program using the following commands:
s<x>: executes x brainfuck instructions (if x is not specified then x = 1)
g<x>: executes instructions until instruction pointer = x (if x is negative, then until x instructions from end)
r: run until end of the program
d<x>-<y>: dump memory content between address x and y (y is optional to print the content of one cell only)
Brainfuck program to execute 2+3 (Non-Brainfuck characters are comments)
+++ sets first operand to 3
>++< sets second operand to 2
[->+<] add first op (3) to second (2) (yield 5)
Sample debugging trace
./Brainfuck -d ../samples/add.bf
Brainfuck Debugger
'exit' to exit
IP = 0 DP = 0
IP: v
L1: +++ sets first operand to 3
DP: v
MEM: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...]
> s2
IP = 2 DP = 0
IP: v
L1: +++ sets first operand to 3
DP: v
MEM: [2, 0, 0, 0, 0, 0, 0, 0, 0, 0, ...]
> g11
IP = 11 DP = 1
IP: v
L3: [->+<] add first op (3) to second (2) (yield 5)
DP: v
MEM: [2, 3, 0, 0, 0, 0, 0, 0, 0, 0, ...]
Using samples/mandelbrot.bf program which prints the mandelbrot set
| Method | Time |
|---|---|
| Interpreter | 78.40s |
| Compiler | 3.66s |
| JIT | 3.59s |
| Opt. JIT | 1.36s |
| Opt. Compiler | 1.23s |
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent