Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Brainfuck
open-in-new
<h2 id="history">History</h2> <p>Müller designed Brainfuck with the goal of implementing the smallest possible <a href="/facts/Compiler/WNfCDFJe">compiler</a>,<a class="footnote-ref" id="fnref:6" href="#fn:6"><sup>6</sup></a> inspired by the 1024-<a href="/facts/Byte/BNHUp9Qq">byte</a> compiler for the <a href="/facts/Esoteric_programming_language/nyRNfC2P">FALSE programming language</a>.<a class="footnote-ref" id="fnref:7" href="#fn:7"><sup>7</sup></a><a class="footnote-ref" id="fnref:8" href="#fn:8"><sup>8</sup></a> Müller's original compiler was implemented in <a href="/facts/Motorola_68000/3p2wt2D6">Motorola 68000</a> <a href="/facts/Assembly_language/7XuV0cla">assembly</a> on the <a href="/facts/Amiga/60B3A9of">Amiga</a> and compiled to a <a href="/facts/Binary_file/ysttM8hh">binary</a> with a size of 296 bytes. He uploaded the first Brainfuck compiler to <a href="/facts/Aminet/T8fG11FJ">Aminet</a> in 1993. The program came with a <a href="/facts/README/BeUhsR1I">"Readme" file</a>, which briefly described the language, and challenged the reader "Who can program anything useful with it? :)". Müller also included an interpreter and some examples. A second version of the compiler used only 240 bytes.<a class="footnote-ref" id="fnref:9" href="#fn:9"><sup>9</sup></a> </p> <h2 id="language-design">Language design</h2> <p>The language consists of eight <a href="/facts/Command_(computing)/zUrvQbFy">commands</a>. A brainfuck program is a sequence of these commands, possibly interspersed with other characters (which are ignored). The commands are executed sequentially, with some exceptions: an <a href="/facts/Program_counter/BxqulBRq">instruction pointer</a> begins at the first command, and each command it points to is executed, after which it normally moves forward to the next command. The program terminates when the instruction pointer moves past the last command. </p><p>The brainfuck language uses a simple machine model consisting of the program and instruction pointer, as well as a one-dimensional array of at least 30,000 <a href="/facts/Byte/BNHUp9Qq">byte</a> cells initialized to zero; a movable <a href="/facts/Pointer_(computer_programming)/fPoNzy9b">data pointer</a> (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 <a href="/facts/ASCII/vGUI33Qu">ASCII</a> character encoding). </p><p>The eight language commands each consist of a single character: </p> <table><tbody><tr><th>Character</th><th>Instruction Performed</th></tr><tr><td>></td><td>Increment the <a href="/facts/Pointer_(computer_programming)/fPoNzy9b">data pointer</a> by one (to point to the next cell to the right).</td></tr><tr><td><</td><td>Decrement the data pointer by one (to point to the next cell to the left).</td></tr><tr><td>+</td><td>Increment the byte at the data pointer by one.</td></tr><tr><td>-</td><td>Decrement the byte at the data pointer by one.</td></tr><tr><td>.</td><td>Output the byte at the data pointer.</td></tr><tr><td>,</td><td>Accept one byte of input, storing its value in the byte at the data pointer.</td></tr><tr><td>[</td><td>If the byte at the data pointer is zero, then instead of moving the <a href="/facts/Program_Counter/BxqulBRq">instruction pointer</a> forward to the next command, <a href="/facts/Branch_(computer_science)/obBGrnor">jump</a> it <i>forward</i> to the command after the <i>matching</i> ] command.</td></tr><tr><td>]</td><td>If the byte at the data pointer is nonzero, then instead of moving the instruction pointer forward to the next command, jump it <i>back</i> to the command after the <i>matching</i> [ command.<a class="footnote-ref" id="fnref:10" href="#fn:10"><sup>10</sup></a></td></tr></tbody></table> <p>[ and ] match as parentheses usually do: each [ matches exactly one ] and vice versa, the [ comes first, and there can be no unmatched [ or ] between the two. </p><p>Brainfuck programs are usually difficult to comprehend. This is partly because any mildly complex task requires a long sequence of commands and partly because the program's text gives no direct indications of the program's <a href="/facts/State_(computer_science)/4Yu8xXHS">state</a>. These, as well as Brainfuck's inefficiency and its limited input/output capabilities, are some of the reasons it is not used for serious programming. Nonetheless, like any Turing-complete language, Brainfuck is theoretically capable of computing any computable function or simulating any other computational model if given access to an unlimited amount of memory and time.<a class="footnote-ref" id="fnref:11" href="#fn:11"><sup>11</sup></a> A variety of Brainfuck programs have been written.<a class="footnote-ref" id="fnref:12" href="#fn:12"><sup>12</sup></a> Although Brainfuck programs, especially complicated ones, are difficult to write, it is quite trivial to write an interpreter for Brainfuck in a more typical language such as C due to its simplicity. Brainfuck interpreters written in the Brainfuck language itself also exist.<a class="footnote-ref" id="fnref:13" href="#fn:13"><sup>13</sup></a><a class="footnote-ref" id="fnref:14" href="#fn:14"><sup>14</sup></a> </p> <h2 id="examples">Examples</h2> <h3>Adding two values</h3> <p>As a first, simple example, the following code snippet will add the current cell's value to the next cell: Each time the loop is executed, the current cell is decremented, the data pointer moves to the right, that next cell is incremented, and the data pointer moves left again. This sequence is repeated until the starting cell is 0. </p> [->+<] <p>This can be incorporated into a simple addition program as follows: </p> ++ Cell c0 = 2 > +++++ Cell c1 = 5 [ Start your loops with your cell pointer on the loop counter (c1 in our case) < + Add 1 to c0 > - Subtract 1 from c1 ] End your loops with the cell pointer on the loop counter At this point our program has added 5 to 2 leaving 7 in c0 and 0 in c1 but we cannot output this value to the terminal since it is not ASCII encoded To display the ASCII character "7" we must add 48 to the value 7 We use a loop to compute 48 = 6 * 8 ++++ ++++ c1 = 8 and this will be our loop counter again [ < +++ +++ Add 6 to c0 > - Subtract 1 from c1 ] < . Print out c0 which has the value 55 which translates to "7"! <h3>Hello World!</h3> <p>The following program prints <a href="/facts/Hello_world_program/vLn0jLlL">"Hello World!"</a> and a newline to the screen: </p> [ 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 an "initial 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 until 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 until 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 <p>For readability, this code has been spread across many lines, and blanks and comments have been added. Brainfuck ignores all characters except the eight commands +-<>[],. so no special syntax for comments is needed (as long as the comments do not contain the command characters). The code could just as well have been written as: </p> ++++++++[>++++[>++>+++>+++>+<<<<-]>+>+>->>+[<]<-]>>.>---.+++++++..+++.>>.<-.<.+++.------.--------.>>+.>++. <h3>ROT13</h3> <p>This program enciphers its input with the <a href="/facts/ROT13/qtgJFEqo">ROT13</a> cipher. To do this, it must map characters A-M (<a href="/facts/ASCII/vGUI33Qu">ASCII</a> 65–77) to N-Z (78–90), and vice versa. Also it must map a-m (97–109) to n-z (110–122) and vice versa. It must map all other characters to themselves; it reads characters one at a time and outputs their enciphered equivalents until it reads an EOF (here assumed to be represented as either -1 or "no change"), at which point the program terminates. </p> -,+[ Read first character and start outer character reading loop -[ Skip forward if character is 0 >>++++[>++++++++<-] Set up divisor (32) for division loop (MEMORY LAYOUT: dividend copy remainder divisor quotient zero zero) <+<-[ Set up dividend (x minus 1) and enter division loop >+>+>-[>>>] Increase copy and remainder / reduce divisor / Normal case: skip forward <[[>+<-]>>+>] Special case: move remainder back to divisor and increase quotient <<<<<- Decrement dividend ] End division loop ]>>>[-]+ End skip loop; zero former divisor and reuse space for a flag >--[-[<->+++[-]]]<[ Zero that flag unless quotient was 2 or 3; zero quotient; check flag ++++++++++++<[ If flag then set up divisor (13) for second division loop (MEMORY LAYOUT: zero copy dividend divisor remainder quotient zero zero) >-[>+>>] Reduce divisor; Normal case: increase remainder >[+[<+>-]>+>>] Special case: increase remainder / move it back to divisor / increase quotient <<<<<- Decrease dividend ] End division loop >>[<+>-] Add remainder back to divisor to get a useful 13 >[ Skip forward if quotient was 0 -[ Decrement quotient and skip forward if quotient was 1 -<<[-]>> Zero quotient and divisor if quotient was 2 ]<<[<<->>-]>> Zero divisor and subtract 13 from copy if quotient was 1 ]<<[<<+>>-] Zero divisor and add 13 to copy if quotient was 0 ] End outer skip loop (jump to here if ((character minus 1)/32) was not 2 or 3) <[-] Clear remainder from first division if second division was skipped <.[-] Output ROT13ed character from copy and clear it <-,+ Read next character ] End character reading loop <h3>Simulation of abiogenesis</h3> <p>In 2024, a Google research project used a slightly modified 10-command version of Brainfuck as the basis of an artificial digital environment. In this environment, they found that replicators arose naturally and competed with each other for domination of the environment.<a class="footnote-ref" id="fnref:15" href="#fn:15"><sup>15</sup></a> </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/JSFuck/U6ncza9m">JSFuck</a> – an esoteric subset of the <a href="/facts/JavaScript/XhhIIEsl">JavaScript</a> programming language with a very limited set of characters</li></ul> <h2 id="notes">Notes</h2> <h2 id="external-links">External links</h2> <ul><li><a href="https://brainfuck.org/">Official website</a></li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Easter, Brandee (2020-04-02). "Fully Human, Fully Machine: Rhetorics of Digital Disembodiment in Programming". Rhetoric Review. 39 (2): 202–215. doi:10.1080/07350198.2020.1727096. ISSN 0735-0198. S2CID 219665562. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Temkin, Daniel (2017-09-01). "Language without code: intentionally unusable, uncomputable, or conceptual programming languages". Journal of Science and Technology of the Arts. 9 (3): 83–91. doi:10.7559/citarj.v9i3.432. ISSN 2183-0088. Archived from the original on 2024-07-09. Retrieved 2024-02-11. <a href="https://revistas.ucp.pt/index.php/jsta/article/view/7297" target="_blank">https://revistas.ucp.pt/index.php/jsta/article/view/7297</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Haupt, Michael. "Implementing Brainfuck in COLA." <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Cox, Geoff, and Alex McLean. "Not Just for Fun." Bloomsbury Academic, 2014. 157-173. <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>"brainfuck - Esolang". esolangs.org. Archived from the original on 2018-10-23. Retrieved 2024-02-07. <a href="https://esolangs.org/wiki/Brainfuck" target="_blank">https://esolangs.org/wiki/Brainfuck</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>"The Brainfuck Programming Language". Muppetlabs.com. Archived from the original on 2023-05-03. Retrieved 2023-04-30. <a href="https://muppetlabs.com/~breadbox/bf/" target="_blank">https://muppetlabs.com/~breadbox/bf/</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>"The FALSE Programming Language — Wouter van Oortmerssen". Strlen.com. 2013-08-03. Archived from the original on 2023-04-30. Retrieved 2023-04-30. <a href="https://strlen.com/false-language/" target="_blank">https://strlen.com/false-language/</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>Tamedia TX 2017 - Livestream Werdino. 13 June 2017. Archived from the original on 11 August 2023. Retrieved 30 August 2024. <a href="https://www.youtube.com/watch?v=gjm9irBs96U&t=8722s" target="_blank">https://www.youtube.com/watch?v=gjm9irBs96U&t=8722s</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>"Aminet - dev/lang/brainfuck-2.lha". Aminet. Archived from the original on 2023-04-30. Retrieved 2023-04-30. <a href="https://aminet.net/package.php?package=dev/lang/brainfuck-2.lha" target="_blank">https://aminet.net/package.php?package=dev/lang/brainfuck-2.lha</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Alternatively, the ] command may instead be translated as an unconditional jump to the corresponding [ command, or vice versa; programs will behave the same but will run more slowly, due to unnecessary double searching. <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>"BF is Turing-complete". Iwriteiam.nl. Archived from the original on 2023-05-23. Retrieved 2023-04-30. <a href="https://iwriteiam.nl/Ha_bf_Turing.html" target="_blank">https://iwriteiam.nl/Ha_bf_Turing.html</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>"Index of /esoteric/brainfuck/bf-source/prog". sange.fi. 2002-01-22. Archived from the original on 2023-04-30. Retrieved 2023-04-30. <a href="https://sange.fi/esoteric/brainfuck/bf-source/prog/" target="_blank">https://sange.fi/esoteric/brainfuck/bf-source/prog/</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> <li id="fn:13"><p>"BF interpreter written in BF". Iwriteiam.nl. Archived from the original on 2024-09-22. Retrieved 2023-04-30. <a href="https://iwriteiam.nl/Ha_bf_inter.html" target="_blank">https://iwriteiam.nl/Ha_bf_inter.html</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></p></li> <li id="fn:14"><p>"brainfuck interpreter". Daniel B. Cristofani. Archived from the original on 2024-09-22. Retrieved 2024-06-19. <a href="https://www.brainfuck.org/dbfi.b" target="_blank">https://www.brainfuck.org/dbfi.b</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></p></li> <li id="fn:15"><p>Blaise Agüera y Arcas; Alakuijala, Jyrki; Evans, James; Laurie, Ben; Mordvintsev, Alexander; Niklasson, Eyvind; Randazzo, Ettore; Versari, Luca (2024). "Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction". arXiv:2406.19108 [cs.NE]. <a href="/wiki/ArXiv_(identifier)" target="_blank">/wiki/ArXiv_(identifier)</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></p></li> </ol>