Initial data commit
This commit is contained in:
Ingy döt Net
parent
72d218235f
commit
f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
254
Task/Compiler-code-generator/Python/compiler-code-generator.py
Normal file
254
Task/Compiler-code-generator/Python/compiler-code-generator.py
Normal file
|
|
@ -0,0 +1,254 @@
|
|||
from __future__ import print_function
|
||||
import sys, struct, shlex, operator
|
||||
|
||||
nd_Ident, nd_String, nd_Integer, nd_Sequence, nd_If, nd_Prtc, nd_Prts, nd_Prti, nd_While, \
|
||||
nd_Assign, nd_Negate, nd_Not, nd_Mul, nd_Div, nd_Mod, nd_Add, nd_Sub, nd_Lss, nd_Leq, \
|
||||
nd_Gtr, nd_Geq, nd_Eql, nd_Neq, nd_And, nd_Or = range(25)
|
||||
|
||||
all_syms = {
|
||||
"Identifier" : nd_Ident, "String" : nd_String,
|
||||
"Integer" : nd_Integer, "Sequence" : nd_Sequence,
|
||||
"If" : nd_If, "Prtc" : nd_Prtc,
|
||||
"Prts" : nd_Prts, "Prti" : nd_Prti,
|
||||
"While" : nd_While, "Assign" : nd_Assign,
|
||||
"Negate" : nd_Negate, "Not" : nd_Not,
|
||||
"Multiply" : nd_Mul, "Divide" : nd_Div,
|
||||
"Mod" : nd_Mod, "Add" : nd_Add,
|
||||
"Subtract" : nd_Sub, "Less" : nd_Lss,
|
||||
"LessEqual" : nd_Leq, "Greater" : nd_Gtr,
|
||||
"GreaterEqual": nd_Geq, "Equal" : nd_Eql,
|
||||
"NotEqual" : nd_Neq, "And" : nd_And,
|
||||
"Or" : nd_Or}
|
||||
|
||||
FETCH, STORE, PUSH, ADD, SUB, MUL, DIV, MOD, LT, GT, LE, GE, EQ, NE, AND, OR, NEG, NOT, \
|
||||
JMP, JZ, PRTC, PRTS, PRTI, HALT = range(24)
|
||||
|
||||
operators = {nd_Lss: LT, nd_Gtr: GT, nd_Leq: LE, nd_Geq: GE, nd_Eql: EQ, nd_Neq: NE,
|
||||
nd_And: AND, nd_Or: OR, nd_Sub: SUB, nd_Add: ADD, nd_Div: DIV, nd_Mul: MUL, nd_Mod: MOD}
|
||||
|
||||
unary_operators = {nd_Negate: NEG, nd_Not: NOT}
|
||||
|
||||
input_file = None
|
||||
code = bytearray()
|
||||
string_pool = {}
|
||||
globals = {}
|
||||
string_n = 0
|
||||
globals_n = 0
|
||||
word_size = 4
|
||||
|
||||
#*** show error and exit
|
||||
def error(msg):
|
||||
print("%s" % (msg))
|
||||
exit(1)
|
||||
|
||||
def int_to_bytes(val):
|
||||
return struct.pack("<i", val)
|
||||
|
||||
def bytes_to_int(bstr):
|
||||
return struct.unpack("<i", bstr)
|
||||
|
||||
class Node:
|
||||
def __init__(self, node_type, left = None, right = None, value = None):
|
||||
self.node_type = node_type
|
||||
self.left = left
|
||||
self.right = right
|
||||
self.value = value
|
||||
|
||||
#***
|
||||
def make_node(oper, left, right = None):
|
||||
return Node(oper, left, right)
|
||||
|
||||
#***
|
||||
def make_leaf(oper, n):
|
||||
return Node(oper, value = n)
|
||||
|
||||
#***
|
||||
def emit_byte(x):
|
||||
code.append(x)
|
||||
|
||||
#***
|
||||
def emit_word(x):
|
||||
s = int_to_bytes(x)
|
||||
for x in s:
|
||||
code.append(x)
|
||||
|
||||
def emit_word_at(at, n):
|
||||
code[at:at+word_size] = int_to_bytes(n)
|
||||
|
||||
def hole():
|
||||
t = len(code)
|
||||
emit_word(0)
|
||||
return t
|
||||
|
||||
#***
|
||||
def fetch_var_offset(name):
|
||||
global globals_n
|
||||
|
||||
n = globals.get(name, None)
|
||||
if n == None:
|
||||
globals[name] = globals_n
|
||||
n = globals_n
|
||||
globals_n += 1
|
||||
return n
|
||||
|
||||
#***
|
||||
def fetch_string_offset(the_string):
|
||||
global string_n
|
||||
|
||||
n = string_pool.get(the_string, None)
|
||||
if n == None:
|
||||
string_pool[the_string] = string_n
|
||||
n = string_n
|
||||
string_n += 1
|
||||
return n
|
||||
|
||||
#***
|
||||
def code_gen(x):
|
||||
if x == None: return
|
||||
elif x.node_type == nd_Ident:
|
||||
emit_byte(FETCH)
|
||||
n = fetch_var_offset(x.value)
|
||||
emit_word(n)
|
||||
elif x.node_type == nd_Integer:
|
||||
emit_byte(PUSH)
|
||||
emit_word(x.value)
|
||||
elif x.node_type == nd_String:
|
||||
emit_byte(PUSH)
|
||||
n = fetch_string_offset(x.value)
|
||||
emit_word(n)
|
||||
elif x.node_type == nd_Assign:
|
||||
n = fetch_var_offset(x.left.value)
|
||||
code_gen(x.right)
|
||||
emit_byte(STORE)
|
||||
emit_word(n)
|
||||
elif x.node_type == nd_If:
|
||||
code_gen(x.left) # expr
|
||||
emit_byte(JZ) # if false, jump
|
||||
p1 = hole() # make room for jump dest
|
||||
code_gen(x.right.left) # if true statements
|
||||
if (x.right.right != None):
|
||||
emit_byte(JMP) # jump over else statements
|
||||
p2 = hole()
|
||||
emit_word_at(p1, len(code) - p1)
|
||||
if (x.right.right != None):
|
||||
code_gen(x.right.right) # else statements
|
||||
emit_word_at(p2, len(code) - p2)
|
||||
elif x.node_type == nd_While:
|
||||
p1 = len(code)
|
||||
code_gen(x.left)
|
||||
emit_byte(JZ)
|
||||
p2 = hole()
|
||||
code_gen(x.right)
|
||||
emit_byte(JMP) # jump back to the top
|
||||
emit_word(p1 - len(code))
|
||||
emit_word_at(p2, len(code) - p2)
|
||||
elif x.node_type == nd_Sequence:
|
||||
code_gen(x.left)
|
||||
code_gen(x.right)
|
||||
elif x.node_type == nd_Prtc:
|
||||
code_gen(x.left)
|
||||
emit_byte(PRTC)
|
||||
elif x.node_type == nd_Prti:
|
||||
code_gen(x.left)
|
||||
emit_byte(PRTI)
|
||||
elif x.node_type == nd_Prts:
|
||||
code_gen(x.left)
|
||||
emit_byte(PRTS)
|
||||
elif x.node_type in operators:
|
||||
code_gen(x.left)
|
||||
code_gen(x.right)
|
||||
emit_byte(operators[x.node_type])
|
||||
elif x.node_type in unary_operators:
|
||||
code_gen(x.left)
|
||||
emit_byte(unary_operators[x.node_type])
|
||||
else:
|
||||
error("error in code generator - found %d, expecting operator" % (x.node_type))
|
||||
|
||||
#***
|
||||
def code_finish():
|
||||
emit_byte(HALT)
|
||||
|
||||
#***
|
||||
def list_code():
|
||||
print("Datasize: %d Strings: %d" % (len(globals), len(string_pool)))
|
||||
|
||||
for k in sorted(string_pool, key=string_pool.get):
|
||||
print(k)
|
||||
|
||||
pc = 0
|
||||
while pc < len(code):
|
||||
print("%4d " % (pc), end='')
|
||||
op = code[pc]
|
||||
pc += 1
|
||||
if op == FETCH:
|
||||
x = bytes_to_int(code[pc:pc+word_size])[0]
|
||||
print("fetch [%d]" % (x));
|
||||
pc += word_size
|
||||
elif op == STORE:
|
||||
x = bytes_to_int(code[pc:pc+word_size])[0]
|
||||
print("store [%d]" % (x));
|
||||
pc += word_size
|
||||
elif op == PUSH:
|
||||
x = bytes_to_int(code[pc:pc+word_size])[0]
|
||||
print("push %d" % (x));
|
||||
pc += word_size
|
||||
elif op == ADD: print("add")
|
||||
elif op == SUB: print("sub")
|
||||
elif op == MUL: print("mul")
|
||||
elif op == DIV: print("div")
|
||||
elif op == MOD: print("mod")
|
||||
elif op == LT: print("lt")
|
||||
elif op == GT: print("gt")
|
||||
elif op == LE: print("le")
|
||||
elif op == GE: print("ge")
|
||||
elif op == EQ: print("eq")
|
||||
elif op == NE: print("ne")
|
||||
elif op == AND: print("and")
|
||||
elif op == OR: print("or")
|
||||
elif op == NEG: print("neg")
|
||||
elif op == NOT: print("not")
|
||||
elif op == JMP:
|
||||
x = bytes_to_int(code[pc:pc+word_size])[0]
|
||||
print("jmp (%d) %d" % (x, pc + x));
|
||||
pc += word_size
|
||||
elif op == JZ:
|
||||
x = bytes_to_int(code[pc:pc+word_size])[0]
|
||||
print("jz (%d) %d" % (x, pc + x));
|
||||
pc += word_size
|
||||
elif op == PRTC: print("prtc")
|
||||
elif op == PRTI: print("prti")
|
||||
elif op == PRTS: print("prts")
|
||||
elif op == HALT: print("halt")
|
||||
else: error("list_code: Unknown opcode %d", (op));
|
||||
|
||||
def load_ast():
|
||||
line = input_file.readline()
|
||||
line_list = shlex.split(line, False, False)
|
||||
|
||||
text = line_list[0]
|
||||
if text == ";":
|
||||
return None
|
||||
node_type = all_syms[text]
|
||||
|
||||
if len(line_list) > 1:
|
||||
value = line_list[1]
|
||||
if value.isdigit():
|
||||
value = int(value)
|
||||
return make_leaf(node_type, value)
|
||||
|
||||
left = load_ast()
|
||||
right = load_ast()
|
||||
return make_node(node_type, left, right)
|
||||
|
||||
#*** main driver
|
||||
input_file = sys.stdin
|
||||
if len(sys.argv) > 1:
|
||||
try:
|
||||
input_file = open(sys.argv[1], "r", 4096)
|
||||
except IOError as e:
|
||||
error("Can't open %s" % sys.argv[1])
|
||||
|
||||
n = load_ast()
|
||||
code_gen(n)
|
||||
code_finish()
|
||||
list_code()
|
||||
Loading…
Add table
Add a link
Reference in a new issue