Module bf::flat

Brainfuck bytecode, flat instead of an abstract syntax tree.

This is closer to

Previous passes represent the Brainfuck program as an abstract syntax tree, with child trees for loops. This pass transforms the program to a flat array of Instructions, 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.

Functions

compile

Compiles peephole-optimized AST to a flat bytecode program.

Type Definitions

Program

A program is a flat sequence of instructions.