Questions tagged [brainfuck]

Brainfuck (bf) is an esoteric, Turing-complete programming language famous for its minimalistic, eight-character syntax.

Brainfuck is an esoteric and turing complete programming language famous for its minimalistic eight character syntax.

Brainfuck uses a simple machine model consisting of the program and instruction pointer, and an array of at least 30,000 byte cells initialized to zero. There is a movable data pointer (initialized to point to the leftmost byte of the array), and two streams of bytes for input and output (most often connected to a keyboard and a monitor respectively, and using the ASCII character encoding).

Language syntax

There are 8 language commands, each represented with a single character:

  • > - increment the data pointer (to point to the next cell to the right)
  • < - decrement the data pointer (to point to the next cell to the left)
  • + - increment (increase by one) the byte at the data pointer
  • - - decrement (decrease by one) the byte at the data pointer
  • . - output a character, the ASCII value of which being the byte at the data pointer
  • , - accept one byte of input, storing its value in the byte at the data pointer
  • [ - if the byte at the data pointer is zero, then instead of moving the instruction pointer forward to the next command, jump it forward to the command after the matching ] command
  • ] - if the byte at the data pointer is nonzero, then instead of moving the instruction pointer forward to the next command, jump it back to the command after the matching [ command.

All other characters in the source code are ignored, and there is therefore no special syntax for comments. Despite its minimalistic approach the language is Turing-complete, meaning that any algorithm can be implemented in Brainfuck.

Language semantics

Brainfuck language pseudocode

>   becomes     ++p;
<   becomes     --p;
+   becomes     ++*p;
-   becomes     --*p;
.   becomes     putchar(*p);
,   becomes     *p = getchar();
[   becomes     while (*p) {
]   becomes     }

Hello world Program

The following represents a program that outputs Hello, world! followed by newline \n:

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

The following represents same code with explanation of how it proceeds:

[ This program prints "Hello World!" and a newline to the screen, its
  length is 106 active command characters. [It is not the shortest.]

  This loop is a "comment loop", a simple way of adding a comment
  to a BF program such that you don't have to worry about any command
  characters. Any ".", ",", "+", "-", "<" and ">" characters are simply
  ignored, the "[" and "]" characters just have to be balanced. This
  loop and the commands it contains are ignored because the current cell
  defaults to a value of 0; the 0 value causes this loop to be skipped.
]
+++++ +++               Set Cell #0 to 8
[
    >++++               Add 4 to Cell #1; this will always set Cell #1 to 4
    [                   as the cell will be cleared by the loop
        >++             Add 2 to Cell #2
        >+++            Add 3 to Cell #3
        >+++            Add 3 to Cell #4
        >+              Add 1 to Cell #5
        <<<<-           Decrement the loop counter in Cell #1
    ]                   Loop till Cell #1 is zero; number of iterations is 4
    >+                  Add 1 to Cell #2
    >+                  Add 1 to Cell #3
    >-                  Subtract 1 from Cell #4
    >>+                 Add 1 to Cell #6
    [<]                 Move back to the first zero cell you find; this will
                        be Cell #1 which was cleared by the previous loop
    <-                  Decrement the loop Counter in Cell #0
]                       Loop till Cell #0 is zero; number of iterations is 8

The result of this is:
Cell No :   0   1   2   3   4   5   6
Contents:   0   0  72 104  88  32   8
Pointer :   ^

>>.                     Cell #2 has value 72 which is 'H'
>---.                   Subtract 3 from Cell #3 to get 101 which is 'e'
+++++++..+++.           Likewise for 'llo' from Cell #3
>>.                     Cell #5 is 32 for the space
<-.                     Subtract 1 from Cell #4 for 87 to give a 'W'
<.                      Cell #3 was set to 'o' from the end of 'Hello'
+++.------.--------.    Cell #3 for 'rl' and 'd'
>>+.                    Add 1 to Cell #5 gives us an exclamation point
>++.                    And finally a newline from Cell #6

This article is based on the one found in Wikipedia.

Read more

204 questions
0
votes
2 answers

How do I decode this program?

How can I decode this strange text? +[----->+++<]>++.+++.+++.+++++++.+[->+++<]>.[--->+<]>----.--------.[--->+<]>.---------.-----------.++.+++++++++++.+++[->+++<]>++.+. This text should be a program.
0
votes
2 answers

What is the correct mime type for esoteric languages

What is the correct mime-type type of esoteric languages? I've googled everywhere, I even tried to ask Chuck Norris, but I didn't find the answer anywhere. I have tried these for…
m93a
  • 8,866
  • 9
  • 40
  • 58
0
votes
1 answer

Incorrect egrep command

The problem is the following: I have a document called brain.txt with lines of (brainfuck) code like this: ++++++++++[>++++++++>++++++>+<<<-]>+++.>+++++.<-.+.>>. word The word at the end can really be any word. How can i filter the lines from the…
jvermeulen
  • 505
  • 1
  • 6
  • 14
-1
votes
1 answer

Brainfuck Interpreter

Will somebody please describe this brainfuck interpreter for me?? #include char m[9999], *n[99], *r = m, *p = m + 5000, **s = n, d, c; main() { for (read(0, r, 4000); c = *r; r++) c - ']' || (d > 1 ||…
David James
  • 635
  • 6
  • 16
-1
votes
1 answer

How is Brainfuck interpereting loops that makes this code work?

This might sound stupid, but i need help with brainfuck. so im writing an interpreter in c#, and I tried to use my interpreter on a real piece of code (+[----->+++<]>+.+.) which should print "hi". But the while loop never ends, because the first…
bruh
  • 93
  • 10
-1
votes
2 answers

How should I handle possible negatives in my BrainF**k interpreter?

I'm building my first interpreter to learn Rust better, and I'm sort of stuck on this problem, because me tape/memory is a vector of unsigned 8-bit integers, but loops sometimes result on negatives. I'm trying to execute this code in BF (which…
Caio Ishikawa
  • 179
  • 11
-1
votes
1 answer

List has no items to pop however there was something there?

Trying to make a brainfuck interpreter in python from scratch just for fun, I'm almost done with the code however this small error is coming up whenever I try interpreting ",[>++++<]" Which is supposed to input a number, and multiply it by 4. It…
-1
votes
1 answer

My Brainf*** interpreter Does Not Work With Common Hellow World Program

I am trying to make a brainf*** interpreter in c++. when I test it with the Esolang hello world example: ++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++. is is here:…
Ed May
  • 33
  • 1
  • 7
-1
votes
1 answer

Instruction set implementation for a simple VM

Suppose you need to implement a toy VM(such for Brainfuck) where you have an external data structure representing the memory(a simple fixed array), and a ComputationalUnit object which cares of acting operations from a given set. What is the most…
majik
  • 128
  • 9
-1
votes
2 answers

How do I read and write a stream 3 bits at a time?

I'm trying to make an ultra-compressed variant of brainfuck, which is an esoteric programming language with 8 instructions. Since 3 bits is the minimum amount of storage to store 8 values, I went with that. The part I'm stuck on is how to read a…
robbie
  • 1,219
  • 1
  • 11
  • 25
-1
votes
1 answer

Java substr not working as expected

So I'm making a brainfuck interpreter in Java and I don't have any problems with it except for the [ and ]. (Inevitably) The problem is with parsing the string. So what I do to deal with the loop is locate the code in between the two brackets and…
null
  • 548
  • 2
  • 6
  • 17
-1
votes
2 answers

Finding odd number of occurences and alternating constructions using grep

I have to search in a file with 300 000 lines of brainfuck code with grep for several constructions. First Question I need to find codes like the first code below, i am looking for an alternating + - construction, the other characters are seen as…
fangio
  • 1,746
  • 5
  • 28
  • 52
-2
votes
1 answer

compiling a Brainfuck hello world program

I found this weird programming language that is an attempt to create the smallest possible compiler called brainf*ck, and i honestly want to try it but i don't have any knowlegde about how to compile the code. Can you help me compiling a hello world…
Cozer
  • 15
  • 5
-2
votes
2 answers

Which would compile and/or calculate the first 100 numbers of the fibonacci sequence faster: C or Brainfuck

I know very little about what makes a language "fast", but it stands to reason for me that a language designed for extreme minimalism would also be extremely fast, right? C is far closer to English than BrainFuck, and the compiler size for BrainFuck…
-2
votes
2 answers

Can someone please tell me what this means?

Do the following sets of characters have a meaning? Thank you +++++++++[ >+++++++++<]>+ ++.<++++[ >++++<]>++++.+.<+++[ ->+++<]>+.<+++[ >---<]>. <+++[ >+++<]>+.
1 2 3
13
14