- Not to be confused with TLWNN.
|Computational class||Turing complete|
The nameless language is an esoteric programming language which only uses the digits 1 and 0 in its source code, making it look like binary. It is based on brainfuck, but adds five additional commands, making it slightly easier for the programmer to perform common tasks.
Nameless language operates on an array of memory cells called a tape. There is a virtual pointer which starts off pointing to the first memory cell. Each of nameless language's commands are four digits long and are only made up of ones and zeros. The commands are:
||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 |
||Jump back to the matching |
||Add the next command's base 10 equivalent to the current cell|
||Subtract the next command's base 10 equivalent to the current cell|
||Randomly sets the current cell's value to either 1 or 0|
||Reset the current cell's value to 0|
||Reset the pointer to point at cell 0|
The nameless language interpreter ignores any characters which are not a one or a zero so you can type comments and they won't have any effect on the program. It is worth noting that the command
0001 which moves the pointer to the left, will wrap around to the last cell if it is called when the pointer is over the left most cell of the tape.
An example "Hello, World!" program written in nameless language:
00100110001100110000001101100000000000100000001100110011001100110001000101110001 00110011000100110011001101110000001101000000000000000010010000000000010001000010 00100010011001000000011100010001000100010100001000100010010000110011001100110011 001101000001000100110100000000000000000000100100
An example cat program which asks for five letters of input and then outputs them again: