User:MihaiEso/InDev
After seeing: User:None1/InDev, I made my own "sandbox" (known exactly as InDev, from "In Development"). Basically, there are some languages that are in development.
Created on June 1, 2024!
Those that are completed it will be moved out of this sandbox and posted as separate pages.
Skibidi Toilet (moved out of sandbox and posted on Skibidi Toilet)
3 Bits, 9 Bytes is an assembly language for a 3-bit CPU, made by User:MihaiEso. With 9 bytes of memory, this machine could store at least 8 instructions. It's like 3 Bits, 1.5 Bytes but with more memory
Operations
The following are instructions of 3 Bits, 9 Bytes:
| Code | Name | Description | ||||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 000 | NOT | do NOThing. | ||||||||||||||||||
| 001 | ACT | ACTion. Given value in memory, change the value according to the following table:
| ||||||||||||||||||
| 010 | JMP | JuMP. Jump (unconditionally) to address specified. | ||||||||||||||||||
| 011 | CJM | Conditional JuMp. Given two addresses, if the value in the first address is nonzero, jump to the second address. | ||||||||||||||||||
| 100 | OR | OR. ORs the given 2 values in memory. | ||||||||||||||||||
| 101 | XOR | XOR. eXclusive ORs the given 2 values in memory. | ||||||||||||||||||
| 110 | NAND | NAND. Not ANDs the given 2 values in memory. | ||||||||||||||||||
| 111 | END | END. Print the entire memory as characters and end the program. |
The instruction pointer can wrap around, thus allowing more "complicated" programs.
Programs
The memory is 72 bits, so you can store with 9 characters.
For example:
0�
becomes:
001100001011
which, when disassembled, becomes:
ACT 100b ACT 011b
Example codes
TODO...
Interpreters
TODO...