Brainstar
Brainstar is a Turing-complete programming language which is a cross between Branflakes and Rockstar. It preserves Rockstar's poetic literals, while keeping Branflakes's numeric tape.
Instructions
Brainstar operates on an infinite tape of signed bignums, each starting at 0. There is also an unbounded stack of unsigned bignums.
Numbers are written by listing words where each word's length is a decimal digit of the number, modulo 10. However, if the first word is "not", it is to be interpreted as a negative sign. For example, "a good language" is 148.
A cell reference is "a", "an", "the", "my" or "your" followed by a word, and the word's length is the index of the cell, minus 1. For example, "an instance" is cell 7.
The special word "it" can be used instead of a cell, and it references the last used variable, or cell 0 if used before any variable is referenced.
| Instruction | What it does |
|---|---|
| [cell] is [number] | Sets [cell] to [number] |
| Let [cell] be [reference] | Sets [cell] to value in [reference] |
| Let [cell1] be [operator] [cell2] | Sets [cell1] to [cell1] [operator] [cell2]. |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
| Example | Example |
And here are the operators. "a" is the first argument, and "b" is the second (if applicable).