brainfuck-tut: A simple BF interpreter.

[ bsd3, language, library, program ] [ Propose Tags ]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],,,,,,,,
Change log
Dependencies array, base (>=4.7 && <5), brainfuck-tut [details]
License BSD-3-Clause
Copyright (c) 2016 Allele Dev
Author Allele Dev
Category Language
Home page
Bug tracker
Source repo head: git clone git clone
Uploaded by alleledev at 2016-12-30T18:00:38Z
Distributions NixOS:
Reverse Dependencies 1 direct, 0 indirect [details]
Executables bfh
Downloads 6855 total (1 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2016-12-30 [all 1 reports]

Readme for brainfuck-tut-

[back to package description]

Brainfuck: A Toy Implementation

This project exists to show what a Brainfuck evaluator might look like in Haskell.

The implementation is fairly well documented. I endeavored to make it readable.


Below is the abstract syntax tree for the BF language as implemented:

data Term
  = IncDP        -- >
  | DecDP        -- <
  | OutDP        -- ?
  | IncByte      -- +
  | DecByte      -- -
  | OutByte      -- .
  | InByte       -- ,
  | JumpForward  -- [
  | JumpBackward -- ]
  deriving (Show, Eq)

Evaluation Semantics

I followed the summary given on the wikipedia page closely. A few particulars to this implementation:

  • "Jump not found" errors abort evaluation and return the state of the tape
  • Out of bound errors are not detected
  • Evaluation proceeds until the instruction stream runs out


An executable is provided:

$ cabal build bfh
$ cabal run bfh
usage: bfh <size> <program>
$ cabal run bfh 10 ',.'