Brianfuck
- Not to be confused with Brainfuck.
Brainfuck Info
Brainfuck operates on an array of memory cells, also referred to as the tape, each initially set to zero. There is a pointer, initially pointing to the first memory cell. The commands are:
Command | Description |
---|---|
>
|
Move the pointer to the right |
<
|
Move the pointer to the left |
+
|
Increment the memory cell under the pointer |
-
|
Decrement the memory cell under the pointer |
.
|
Output the character signified by the cell at the pointer |
,
|
Input a character and store it in the cell at the pointer |
[
|
Jump past the matching ] if the cell under the pointer is 0
|
]
|
Jump back to the matching [ if the cell under the pointer is nonzero
|
Brianfuck Adds
- This section is not detailed enough and needs to be explained. Please help us by adding some more information.
F
factorial
P
check if a sentence is palindrome.
c
convert from roman to decimal
U
Underload
B
Beer program
R
ROT13
D
Display printable characters ASCII table
r
Reverse order of lines in input
O
Reverse order of characters on each line in input
b
BrainFuck interpreter (use @ at end of program)
C
Count how many of each letters
S
Set-theoretic definition of natural numbers
Example Code
Factorial
F
Check if sentence is palindrome
P
Convert from Ruman numerals to Decimal
c
Underload
U
Beer program
B
ROT13
R
Display printable characters ASCII table
D
Reverse order of lines in input
r
Reverse order of characters on each line in input:
O
BrainFuck interpreter (use @ at end of program):
b
Count how many of each letters:
C
Set-theoretic definition of natural numbers
S