Skip to content
This repository was archived by the owner on Jul 9, 2022. It is now read-only.

Add integer division, bitwise operations, stack to stack copy, "yank", and stack rotation commands #2

Open
cnamejj wants to merge 3 commits into
base: master
Choose a base branch
from
Open

Add integer division, bitwise operations, stack to stack copy, "yank", and stack rotation commands #2

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
3a93f31
Add _ Y B/b E/e and W/w instructions
cnamejj Dec 19, 2021
b9c2e15
Add bitwise and, or, and xor instructions/commands
cnamejj Dec 20, 2021
18b3b6b
Ideas for more commands/instructions
cnamejj Dec 20, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
109 changes: 103 additions & 6 deletions ly.py
100644 → 100755
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
#!/usr/bin/python3
#!/usr/bin/env python3

# Ly interpreter in Python
# Created by LyricLy
Expand All @@ -9,7 +9,6 @@
import random
import sys
import re
import time

parser = argparse.ArgumentParser()
parser.add_argument("filename", help="File to interpret.")
Expand Down Expand Up @@ -139,6 +138,15 @@ def add_value(self, value):
else:
self.append(value)

def reset_value(self, value):
while stack:
stack.pop()
if type(value) == list:
for v in value:
self.append(v)
else:
self.append(value)

def take_input():
nonlocal input_function

Expand Down Expand Up @@ -172,9 +180,9 @@ def dump_input():
while idx < len(program):
char = program[idx]
try:
next = program[idx + 1]
nxt = program[idx + 1]
except IndexError:
next = None
nxt = None
try:
last = program[idx - 1]
except IndexError:
Expand Down Expand Up @@ -208,7 +216,7 @@ def function_execution(value):
function_name, err_info[1], err_info[2]), file=sys.stderr)
print(err_info[0], file=sys.stderr)
return False
elif next == "{":
elif nxt == "{":
pass
elif char.isdigit():
stack.add_value(int(char))
Expand Down Expand Up @@ -301,10 +309,22 @@ def function_execution(value):
elif char == "/":
x, y = stack.pop_value(2)
stack.add_value(y / x)
elif char == "_":
x, y = stack.pop_value(2)
stack.add_value(int(y / x))
elif char == "%":
x = stack.pop_value()
y = stack.pop_value()
stack.add_value(y % x)
elif char == "A":
x, y = stack.pop_value(2)
stack.add_value(int(y & x))
elif char == "O":
x, y = stack.pop_value(2)
stack.add_value(int(y | x))
elif char == "X":
x, y = stack.pop_value(2)
stack.add_value(int(y ^ x))
elif char == "^":
x, y = stack.pop_value(2)
stack.add_value(y ** x)
Expand Down Expand Up @@ -386,13 +406,67 @@ def function_execution(value):
y = stack.pop_value()
stack.add_value(x)
stack.add_value(y)
elif char == "B":
v = stack.get_value()
if v is not None:
if stack_pointer > 0:
p = stack_pointer
stack_pointer -= 1
else:
# since this changes the indexing we don't need to decrement the pointer
p = 1
stacks.insert(0, Stack())
stack = stacks[stack_pointer]
stack.add_value(v)
stack = stacks[p]
stack_pointer = p
elif char == "b":
v = stack[0]
if v is not None:
if stack_pointer > 0:
p = stack_pointer
stack_pointer -= 1
else:
# since this changes the indexing we don't need to decrement the pointer
p = 1
stacks.insert(0, Stack())
stack = stacks[stack_pointer]
stack.add_value(v)
stack = stacks[p]
stack_pointer = p
elif char == "<":
if stack_pointer > 0:
stack_pointer -= 1
else:
# since this changes the indexing we don't need to decrement the pointer
stacks.insert(0, Stack())
stack = stacks[stack_pointer]
elif char == "E":
v = stack.get_value()
if v is not None:
p = stack_pointer
try:
stacks[stack_pointer + 1]
except IndexError:
stacks.append(Stack())
stack_pointer += 1
stack = stacks[stack_pointer]
stack.add_value(v)
stack = stacks[p]
stack_pointer = p
elif char == "e":
v = stack[0]
if v is not None:
p = stack_pointer
try:
stacks[stack_pointer + 1]
except IndexError:
stacks.append(Stack())
stack_pointer += 1
stack = stacks[stack_pointer]
stack.add_value(v)
stack = stacks[p]
stack_pointer = p
elif char == ">":
try:
stacks[stack_pointer + 1]
Expand Down Expand Up @@ -486,6 +560,15 @@ def function_execution(value):
stack.sort()
elif char == "N":
stack.add_value(-stack.pop_value())
elif char == "Y":
w = stack.pop_value(implicit=False)
v = stack[w]
if w:
n = stack[:w] + stack[w+1:]
else:
n = stack[1:]
stack.reset_value(n+[v,])
#stack = stacks[stack_pointer]
elif char == "I":
stack.add_value(stack[stack.pop_value(implicit=False)])
elif char == "R":
Expand All @@ -494,7 +577,7 @@ def function_execution(value):
for i in range(y, x + 1):
stack.add_value(i)
elif char == "'":
stack.add_value(ord(next))
stack.add_value(ord(nxt))
idx += 1
elif char == "w":
time.sleep(stack.pop_value())
Expand All @@ -508,6 +591,20 @@ def function_execution(value):
stack.add_value(stack.pop_value() - 1)
elif char == "~":
stack.add_value(int(stack.pop_value(implicit=False) in stack))
elif char == "q":
r = stack.pop_value()
l = len(stack)
s = r % l
if s:
n = stack[s:] + stack[:s]
stack.reset_value(n)
elif char == "Q":
r = stack.pop_value()
l = len(stack)
s = r % l
if s:
n = stack[-s:] + stack[:-s]
stack.reset_value(n)
except errors as err:
if output_function.__name__ == "function_execution":
raise FunctionError("{}: {}$${}$${}".format(
Expand Down