++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++.

Consisting of an infinite tape of bytes, an instruction pointer, and a data pointer, brainfuck offers the following commands:

+ : increment current cell value by one
- : decrement current cell value by one
> : increment data pointer by one
< : decrement data pointer by one
. : print current cell as ascii
, : accept one byte of input (not implemented)
[ ] : square brackets function as while loops. If the current cell is zero (when the instruction is [) we skip to the next ]. Conversely, when reading ], we skip back to the previous matching [, if the current cell is non-zero.