0->E
" "->Str4
" "->Str3
If length(Str1)=0
Then
Disp "NO PROGRAM FOUND IN STR1"
Pause
ClrHome
End
length(Str1)->L
0->A
0->I
0->C
1->P
1->L
Lbl MA
C+1->C
If C>L and E=1
Goto ER
If C>L
Stop
sub(Str1,C,1)->Str2
If Str2=" "
Goto MA
If Str2="R"
Goto R
If Str2="A"
Goto A
If Str2="D"
Goto D
If Str2="I"
Goto I
If Str2="S"
Goto S
If Str2="H"
Then
Goto H
Else
1->E
ClrHome
Str3+toString(C)+" "->Str3
Str4+Str2->Str4
Disp "ERROR:INVALID CHARACTER","FOUND AT LINE"
Output(2,15,C)
Disp "THE CHARACTER"
Output(3,15,Str2
Disp "IS INVALID"
Pause
End
Lbl R
0->I
Goto MA
Return
Lbl A
A+1->A
Goto MA
Return
Lbl D
I-1->I
Goto MA
Return
Lbl I
I+1->I
Goto MA
Return
Lbl S
I*A->I
0->A
Goto MA
Return
Lbl H
If I=0
L+1->L
If I=~10
Output(L,P,0
If I<0 and I>~10
Output(L,P,~I
If I>0 and I<31
Output(L,P,sub("ABCDEFGHIJKLMNOPQRSTUVWXYZ.,?Ï€",I,1)
Goto MA
Return
Lbl ER
ClrHome
Disp "REVIEW OF ERRORS."
Disp "THERE ARE"
Output(2,11,(length(Str4)-1)
Disp "ERRORS AT THESE LINES"
Disp Str3
UPDATES:
The counter will now be called the accumulator
There is now a 1 bit memory (called the flag)
Numbers 1-9 are labels. Labels can be jumped to using z, n, and j.
RCS (radish character set) update: the 30th character will not be π anymore, it will now be :
r: Reset mem
a: increment accumulator
d: decrement mem
i: increment mem
s: multiply accumulator by mem, store into mem, and reset the accumulator.
h: print RCS (radish character set) character stored in memory
c: copy memory into the accumulator
z: jumps to the program label stored in the accumulator if the flag = 0
n: jumps to the program label stored in the accumulator if the flag = 1
j: unconditional jump, jumps to program label stored in accumulator
f: if flag > memory, increment memory
/: swap memory and accumulator
<: Compares accumulator and memory, sets flag to 1 if A less than or equal to memory, sets flag to 0 if not.
>: Compares accumulator and memory, sets flag to 1 if A greater than or equal to memory, sets flag to 0 if not.
0: reset accumulator
rd(1)h
rih
(2)riih
ia 1 hj
While 1
Disp "A"
End
#predefining things
rcs = " ABCDEFGHIJKLMNOPQRSTUVWXYZ.,?:"
cursor = 0
memory = 0
accumulator = 0
flag = False
#starting up
print("RADISH interpreter V1.1")
p = input("Program:")
labels = {}
for i, ch in enumerate(p):
if ch.isdigit() and ch != "0":
labels[int(ch)] = i
while cursor < len(p): #checks if cursor position is further than the program
sub = p[cursor] #stores part of program to be evaluated
if sub.isdigit() and sub != "0":
cursor += 1
continue
if sub == "z":
if not flag:
cursor = labels.get(accumulator, cursor)
continue
if sub == "n":
if flag:
cursor = label.get(accumulator, cursor)
if sub == "j":
cursor = label.get(accumulator, cursor)
if sub == "r":
memory = 0
if sub == "a":
accumulator += 1
if sub == "d":
memory -= 1
if sub == "i":
memory += 1
if sub == "s":
memory *= accumulator
accumulator = 0
if sub == "c":
accumulator = memory
if sub == "f":
if flag >= memory:
memory += 1
if sub == "/":
previous = memory #temporary variable
memory = accumulator
accumulator = previous
del previous
if sub == "<":
if accumulator <= memory:
flag = True
else:
flag = False
if sub == ">":
if accumulator >= memory:
flag = True
else:
flag = False
if sub == "0":
accumulator = 0
if sub == "h":
print(rcs[memory % len(rcs)], end="")
cursor += 1
ia 1 hj
While 1
Disp "A"
End
iiiiaashriiiiihiiiaaaashhriiiiiaaashr
Advertisement