Brainfuck

Introduction

This exercise is based on the Brainfuck langage.

Brainfuck is an esoteric programming language created in 1993 by Urban Müller. It’s a minimalist langage composed of one character instructions while remaining Turing complete.

Problem Description

Create an interpreter, which, given a valid Brainfuck program execute it and return the memory state at the end of it.

The Brainfuck langage consists of :

• a program;
• a one-dimensional array of at least 30,000 byte cells initialized to zero, representing ASCII characters;
• a movable data pointer (initialized to point to the leftmost byte of the array).

The program is composed of 8 different commands :

Character	Meaning
+	Increment the byte at the data pointer.
-	Decrement the byte at the data pointer.
>	Increment the data pointer.
<	Decrement the data pointer.
.	Output the byte at the data pointer (ASCII format)
,	Accept one byte of input (ASCII format), storing its value in the byte at the data pointer.
[	If the byte at the data pointer is zero jump it forward to the command after the matching ] command.
]	If the byte at the data pointer is nonzero jump it back to the command after the matching [ command.

Suggested steps

1. Implement + - > < commands to manage memory.
2. Implement . , to manage I/O.
3. Implement [ ] to manage jump/loops.

Additional constraints

• When the data pointer is on the first bite and you use the < command the data pointer is moved to the last bite of the array.
• Value stored in the array cannot be negative, if you decrement from 0 you go back to 255.
• Instructions should be easy to rename if I want to change the syntax to OooWee from Rick and Morty.
• It should be easy to add new instructions for example :
  • ! : goes directly to the end of the memory array.

---