Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
Wolfram`Parser`Languages`Brainfuck`
BrainfuckRun  |
|
| | ||||
|
| | ||||
▪
BrainfuckRun
▪
The machine is a single carrying a byte (an of cell index to value), a cell , the remaining bytes, and the accumulated bytes. Every cell starts at ; arithmetic on a cell is taken .
"tape"
"ptr"
"in"
"out"
0
256
▪
Each appends the current cell to the output; the final byte list is decoded with into the returned string. Each consumes one byte of input, or writes once the input is exhausted.
.
,
0
▪
To see the structure of code rather than run it, use , which runs the same grammar over a neutral node-building algebra. The grammar is written once; only the algebra differs.
Examples
(4)
Basic Examples
(1)
The canonical "A" program: build in a cell with a multiply loop, add , and print it:
60
5
In[1]:=
 | BrainfuckRun |
Out[1]=
A
The classic hello-world program returns the greeting, newline and all:
In[2]:=
| BrainfuckRun |
Out[2]=
Hello World!
In[3]:=
| BrainfuckAST |
Out[3]=
ContainerNode[String,{LeafNode[Command,+,Source{{1,1},{1,2}}],LeafNode[Command,+,Source{{1,2},{1,3}}],LeafNode[Command,+,Source{{1,3},{1,4}}],LeafNode[Command,.,Source{{1,4},{1,5}}]},Source{{1,1},{1,5}}]
Scope
(1)
Properties & Relations
(1)
Possible Issues
(1)
 |
|
""