Category:Brainf***: Difference between revisions

m
- 2nd link to Turingmachine
(Reasons for naming.)
m (- 2nd link to Turingmachine)
 
(3 intermediate revisions by 2 users not shown)
Line 1:
{{language|Brainf***|bnf=http://ninh.nl/blog/2008/10/25/brainfck-birds-of-a-feather-session-take-2/}}
{{language|Brainf***|bnf=http://ninh.nl/blog/2008/10/25/brainfck-birds-of-a-feather-session-take-2/}}Also known as '''Brainfuck''', but identified as '''Brainf***''' for reasons described [[Rosetta Code:Brainf***|here]]. Created by Urban Müller in 1993 in an attempt to create the world's smallest Turing-complete compiler. It is noted as an [[:Category:Esoteric_Languages|esoteric programming language]], as it is not ordinarily used for applications development, but it also noted as being a minimalist language.
Also known as '''Brainfuck''', but identified as '''Brainf***''' for reasons described [[Rosetta Code:Brainf***|here]]. <br>
Created by Urban Müller in 1993 in an attempt to create the world's smallest Turing-complete compiler.
It is noted as an [[:Category:Esoteric_Languages|esoteric programming language]],
as it is not ordinarily used for applications development,
but it also noted as being a minimalist language.
 
The constructconstruction forof the language is similar to a [[wp:Turing Machine|Turing Machine]]. The commands themselves act on an array or "tape" (usually a byte or integer array and usually "infinite" on one or both ends) and a pointer to a position in that array. The complete specification for the language can be summed up with the following eight symbols:<br>
As with the Turing Machine, Brainf*** is built from a finite state machine and an infinite tape of cells.
Each cell can be any size, including unbounded, but is frequently an eight bit byte.
The finite state machine is the program code with the program counter pointing at the current state. <br>
The strong similarity is one reason that a Brainf*** equivalent named ''Ρʺ''
was suitable for use by Corrado Böhm in 1964
to prove that structured programming using only ''while loops''
was just a powerful as ''goto spagetti'' programming.
 
The complete specification for the language
(the available state transitions of the Turing machine)
can be summed up with the following eight symbols:
 
{| class="wikitable"
Line 14 ⟶ 30:
|-
|style="text-align:center"|<tt>+</tt>
||increment (increase by one) the bytecell at the pointer.
|-
|style="text-align:center"|<tt>-</tt>
||decrement (decrease by one) the bytecell at the pointer.
|-
|style="text-align:center"|<tt>.</tt>
||output the value of the byte at the pointer (usually interpreted to a character).
|-
|style="text-align:center"|<tt>,</tt>
||accept one byte of input (usually interpreted from a character), storing its value in the byte at the pointer.
|-
|style="text-align:center"|<tt>[</tt>
||jump forward to the command after the corresponding <tt>]</tt> if the bytecell at the pointer is zero.
|-
|style="text-align:center"|<tt>]</tt>
||jump back to the command after the corresponding <tt>[</tt> if the bytecell at the pointer is nonzero.
|-
|style="text-align:center"|<tt>.</tt>
||output the value of the bytecell at the pointer (usually interpreted toas a character).
|-
|style="text-align:center"|<tt>,</tt>
||accept one bytecharacter of input (usually interpreted from a character), storing its value in the bytecell at the pointer.
|}
 
Alternatively, the <tt>]</tt> command may instead be translated as an unconditional jump '''to''' the corresponding <tt>[</tt> command, or vice versa; programs will behave the same but willmay run more slowly.
 
All other symbols, including traditional whitespace characters, are interpreted as comments.
 
The definition of the <tt>.</tt> and <tt>,</tt> in the above table still has some ambiguities due to the many ways of converting 'numbers' to 'characters'.
Due to this minimal instruction set, Brainf*** is used as an introduction to compilers and has even been successfully implemented as a microprocessor core and the foundation to an operating system using a slightly extended syntax for output.
Urban Müller's ''smallest compiler'' converted between characters and numbers using the ASCII character set.
The newline character is number ''10'' and a end of file on input is signalled by the cell value being unchanged when the <tt>,</tt> command completes.
The <tt>,</tt> command uses line editing and waits for for the return key to be pressed.
 
Due to this minimal instruction set, Brainf*** is used as an introduction to compilers and has even been successfully implemented as a microprocessor core and the foundation to an operating system using a slightly extended syntax for output.
BUT due to vehement opposition to the name [http://esolangs.org/wiki/Cupid various] [http://esolangs.org/wiki/Category:Brainfuck_equivalents equivalents] are frequently used.
 
==See also==
* [[Rosetta Code:Brainf***]] ( why some people call it BF :)
* [[RCBF]] - BF interpreters as a Rosetta Code task
 
Line 47 ⟶ 71:
* [http://dmoz.org/Computers/Programming/Languages/Brainfuck/ DMOZ Brainf*** category]
* [http://www.iwriteiam.nl/Ha_BF.html Brainf*** tutorial]
 
 
[[Category:Esoteric_Languages]]
Anonymous user