bf 0.4.8

An optimizing Brainfuck interpeter and JIT compiler
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27

//! Brainfuck bytecode instead of an abstract syntax tree.
//!
//! This is closer to
//!
//! Previous passes represent the Brainfuck program as an [abstract syntax
//! tree](../ast.index.html), with
//! child trees for loops. This pass transforms the program to a flat array of
//! [`Instruction`](enum.Instruction.html)s, where loop operations take the
//! address to possibly jump to as a parameter. This representation includes
//! run-length encoding for some instructions, with moving and arithmetic
//! commands taking the count as a parameter. It also includes the
//! instructions produced by the peephole optimizer.
//!
//! Flattening is not necessary for interpretation, but it might
//! perform better because of the cache. So far, it appears
//! to perform worse than the peephole-optimized AST.

use common;

mod compiler;
mod interpreter;

pub use self::compiler::{compile, BytecodeCompilable};

/// A program is a bytecode sequence of instructions.
pub type Program = [common::Instruction];