o&

o& is an Esoteric Programming Language created By User:Buckets in 2024.

Commands	Instructions
/	Pushes the value of The previous Cell Value, then It Increments It by one.
*	Swap the Current tape Cell with The top of The Stack but If stack is Empty, Just push the Current value to Stack.
@	Rotate the Tape Segment from Three Values Back To three values ahead one step To the right.
!	Reverse the Tape Segment from The Current Value - The Top value of the stack Values Back To the current value + the top Value Of The Stack Values Ahead then Pop top of stack To get the size Of The Stack.
°	Duplicate The Current stack, the data Pointer atached to the Tape Segment, and a copy of the Tape Segment from Two Values Back To two values forward Then Push The duplicate On a Higher plane of Existence in the code, Specifically On the next Stack level.
~	Multiply the Entirety Of The tape cell by -1, Then swap The Current Value on the Tape with the Top value on the Stack.
^	Set the Current cell to the Maximum Value of The Three tape cells Below This's Data pointer Values.
:	Set the Current cell to the Maximum Value of The Last Three tape cells that Were Created Before This one's Data pointer Values.
‐	Move The data pointer Rightwards by the Top Value of The stack and discard the Top Value, unless If the stack is empty, Then Print "Hello, World!" And move 1 Cell leftwards, unless if the current Cell number is 0, Then Don't Print "Hello, World!".
≠	If the Current Value cell is Zero, reverse the Direction of the Next data pointer Moves for the Next five Steps.
‰	Add the Current Cell value to the next Three cells In the Direction Of the Data pointer's last directional Movement, If the Data pointer has not moved Yet, It will Add it To the tape Cells below this But only to the Next Four cells.
¯	Pop n From stack then Sum the Next n Tape cells Into Current Cell.
#	Discard the Entirety Of The Current stack.
ñ	Pop m from The Current stack Then divide current Value Cell evenly among the next m tape cells Under This One On the Existence stack, And "modulo leftover stays".
‽	Pop The Top value Of the Current Stack, add The Current Cell value to the top Of the Stack, output As a character in Unicode, then increment all cells Two Values Back To two values Forward by "that value".
♲	Rotate the Existence stack Leftwards by Three, Unless there is Less Than four Planes of Existence available, Do the Following things: If there is Only One plane, Execute A cat Program, If there Is Only Two Planes, Execute a Truth-machine, If there is only Three planes, Execute A FizzBuzz program.

"Hello, World!" Program:

/*#‐

Cat Program:

♲

Truth-machine:

°♲

FizzBuzz Program:

°°♲