User:Tommyaweosme/unnamed oisc

first, all commands are numbered, so a "proper" command may look like this:

N f A B C D E

where N is the line number.

parsing the command

if the cell at the memory pointer is less than or equal to A, then jump to B after incrementing the current cell by C and incrementing the memory pointer by D, along with outputting the cell at memory pointer if E is 1, or inputting the cell at memory pointer if E is 2. otherwise, jump to N+1.

if a cell is -1, it is infinity. infinity+1=0, infinity-1=-2. however here, -1>0 and -2<-1. this can only make sense as infinity>0 and infinity-1<infinity

brainfuck equivalents

+ N f -1 N+1 1 0 0
- N f -1 N+1 -1 0 0
. N f -1 N+1 0 0 1
, N f -1 N+1 0 0 2
> N f -1 N+1 0 1 0
< N f -1 N+1 0 -1 0
 
N [
C
M ]
D
 
N f 0 M 0 0 0
C
M f 0 M+2 0 0 0
M+1 f -1 N+1 0 0 0
D

history

i thought this up while i was bored in school