import re def preproc(program): #проходимся по программе for i in program.split('\n'): try: #директива инклуд, пример: #include где stdio.h название файла if i[0:8] == '#include': #проверка синтатикса if i.find('<') != -1 and i.find('>') != -1: name = i[i.index('<') + 1:i.index('>')] with open(name, 'r', -1, 'utf-8') as f: program = program.replace(i, f.read()) else: raise SyntaxError('invalid #include directive') except IndexError: #кажись это комментарий... pass except KeyError as err: #о, нет, это не найденный файл. raise err #ну ладно... иди дальше там. return program #функция лексинга def lex(characters, tokens_regex): pos = 0 tokens = [] while pos < len(characters): match = None for token_expr in token_exprs: pattern, tag = token_expr regex = re.compile(pattern) match = regex.match(characters, pos) if match: text = match.group(0) if tag == STRING: text1 = text[1:-1] text = text1.encode().decode('unicode_escape') text = '"' + text + '"' token = (text, tag) tokens.append(token) elif tag: token = (text, tag) tokens.append(token) break if not match: raise SyntaxError('Illegal character: %s' % characters[pos]) else: pos = match.end(0) return tokens #теги RESERVED = 'RESERVED' ID = 'ID' INT = 'INT' STRING = 'STRING' #регулярные выражения token_exprs = [ (r'[ \n\t]+', None), (r'--[^\n]*', None), (r'\(', RESERVED), (r'=', RESERVED), (r'while', RESERVED), (r'if', RESERVED), (r'do', RESERVED), (r'function', RESERVED), (r'else', RESERVED), (r'start', RESERVED), (r'int', RESERVED), (r'end', RESERVED), (r'\)', RESERVED), (r';', RESERVED), (r'\+', RESERVED), (r'-', RESERVED), (r'\*', RESERVED), (r'/', RESERVED), (r'<=', RESERVED), (r'<', RESERVED), (r'>=', RESERVED), (r'>', RESERVED), (r'!=', RESERVED), (r'==', RESERVED), (r',', RESERVED), (r'"(\\.|[^"\\])*"', STRING), (r'[0-9]+', INT), (r'[a-zA-Z][a-zA-Z0-9_]*', ID) ] def c_lexer(chars): return lex(chars, token_exprs) ''' Узёл AST для парсера. Класс Node - класс для узла. ''' class Node: def __init__(self, name, op1, op2, op3): """ Узёл AST для парсера :параметр name: имя узла :параметр op1: цифра, идентификатор или условие :параметр op2: выражение или блок кода :параметр op3: блок кода для необязательных конструкций или do-while """ self.name = name self.op1 = op1 self.op2 = op2 self.op3 = op3 def __repr__(self): return f'Node("{self.name}", {self.op1}, {self.op2}, {self.op3})' class Parser: def __init__(self): self.pos = 0 def term(self, value): if value.isdigit(): return Node('NUM', value, None, None) elif re.match('[a-zA-Z][a-zA-Z0-9_]*', value): return Node('ID', value, None, None) if value.startswith('"') and value.endswith('"'): content = value[1:-1] return Node('STRING', content.replace('\n', '\\n'), None, None) return Node('STRING', value, None, None) def expr(self, exp): d = exp.split(' ') try: if exp[0] == '"': return self.term(exp) left = self.term(d[0]) op = d[1] right = self.term(d[2]) if len(d) == 4 and d[1] + d[2] == '==': op = d[1] + d[2] right = self.term(d[3]) return Node(op, left, right, None) except: return self.term(exp) def paren_expr(self, tokens): if tokens[self.pos][0] == '(' and (')', 'RESERVED') in tokens: expr = '' self.pos += 1 while tokens[self.pos] != (')', 'RESERVED'): if tokens[self.pos + 1] == (')', 'RESERVED'): expr += tokens[self.pos][0] else: expr += tokens[self.pos][0] + ' ' self.pos += 1 return self.expr(expr) else: raise SyntaxError('Invalid paren expression') def semicolon_expr(self, tokens): if (';', 'RESERVED') in tokens: expr = '' self.pos += 1 while tokens[self.pos] != (';', 'RESERVED'): if tokens[self.pos + 1] == (';', 'RESERVED'): expr += tokens[self.pos][0] else: expr += tokens[self.pos][0] + ' ' self.pos += 1 return self.expr(expr) else: raise SyntaxError('Invalid expression with semicolon') def parse(self, toks, block=False): ast = [] astpos = 0 while self.pos < len(toks): token = toks[self.pos] if self.pos + 1 < len(toks) and toks[self.pos + 1][0] == '=': name = toks[self.pos][0] self.pos += 1 value = self.semicolon_expr(toks) ast.append(Node('assign', name, value, None)) elif token[0] == 'do': self.pos += 1 if toks[self.pos][0] == 'start': blockrr = [] self.pos += 1 while self.pos < len(toks): if toks[self.pos][0] == 'end': self.pos += 1 break parserzv = Parser() res = parserzv.parse(toks[self.pos:], block=True) blockrr.append(res[0]) self.pos += res[1] + 1 self.pos -= 1 self.pos += 1 if toks[self.pos][0] == 'while': self.pos += 1 condition = self.paren_expr(toks) self.pos += 1 if toks[self.pos][0] == ';': if block == True: return ([Node('do', condition, blockrr, None)], self.pos) ast.append(Node('do', condition, blockrr, None)) else: raise SyntaxError('invalid "do" statement') else: raise SyntaxError('invalid "do" statement') else: raise SyntaxError('invalid syntax') elif token[0] == 'while': self.pos += 1 condition = self.paren_expr(toks) self.pos += 1 if toks[self.pos][0] == 'start': block = [] self.pos += 1 while self.pos < len(toks): if toks[self.pos][0] == 'end': self.pos += 1 break parsere = Parser() res = parsere.parse(toks[self.pos:], block=True) block.append(res[0]) self.pos += res[1] + 1 self.pos -= 1 if block: return ([Node('while', condition, block, None)], self.pos) ast.append(Node('while', condition, block, None)) else: raise SyntaxError('invalid syntax') elif token[0] == 'function': self.pos += 1 name = toks[self.pos][0] self.pos += 1 if toks[self.pos][0] != '(': raise SyntaxError('invalid params') self.pos += 1 args = [] for i in toks[self.pos:]: if i[0] == ')': break d = Parser() argval = '' while self.pos < len(toks): if toks[self.pos][0] == ',' or toks[self.pos][0] == ')': if toks[self.pos][0] == ',': self.pos += 1 break argval += toks[self.pos][0] self.pos += 1 if d.expr(argval): args.append(d.expr(argval)) self.pos += 1 if toks[self.pos][0] == 'start': blocks = [] self.pos += 1 while self.pos < len(toks): if toks[self.pos][0] == 'end': self.pos += 1 break parser = Parser() res = parser.parse(toks[self.pos:], block=True) blocks.append(res[0]) self.pos += res[1] + 1 self.pos -= 1 ast.append(Node(token[0], name, args, blocks)) else: raise SyntaxError('invalid syntax') elif token[0] == 'if': self.pos += 1 condition = self.paren_expr(toks) self.pos += 1 if toks[self.pos][0] == 'start': blockrm = [] self.pos += 1 while self.pos < len(toks): if toks[self.pos][0] == 'end': self.pos += 1 break parserj = Parser() res = parserj.parse(toks[self.pos:], block=True) blockrm.append(res[0]) self.pos += res[1] + 1 self.pos -= 1 if block == True: self.pos += 1 if self.pos < len(toks) and toks[self.pos][0] == 'else': self.pos += 1 if toks[self.pos][0] == 'start': blockr = [] self.pos += 1 while self.pos < len(toks): if toks[self.pos][0] == 'end': self.pos += 1 break parserr = Parser() res = parserr.parse(toks[self.pos:], block=True) blockr.append(res[0]) self.pos += res[1] + 1 self.pos -= 1 return ([Node('else', condition, blockrm, blockr)], self.pos) return ([Node('if', condition, blockrm, None)], self.pos) ast.append(Node('if', condition, blockrm, None)) else: raise SyntaxError('invalid syntax') elif token[0] == 'else': if ast[astpos - 1].name == 'if': self.pos += 1 if toks[self.pos][0] == 'start': block = [] self.pos += 1 while self.pos < len(toks): if toks[self.pos][0] == 'end': self.pos += 1 break parserr = Parser() res = parserr.parse(toks[self.pos:], block=True) block.append(res[0]) self.pos += res[1] + 1 self.pos -= 1 ast[astpos - 1].name = 'else' ast[astpos - 1].op3 = block else: raise SyntaxError('invalid syntax') else: raise SyntaxError('invalid "else" statement') elif token[1] == 'ID' and self.pos + 1 < len(toks) and toks[self.pos + 1][0] == '(': args = [] name = token[0] self.pos += 2 for i in toks[self.pos:]: if i[0] == ')': break d = Parser() argval = '' while self.pos < len(toks): if toks[self.pos][0] == ',' or toks[self.pos][0] == ')': if toks[self.pos][0] == ',': self.pos += 1 break elif self.pos + 1 < len(toks) and toks[self.pos + 1][0] == ',' or toks[self.pos + 1][0] == ')': argval += toks[self.pos][0] else: argval += toks[self.pos][0] + ' ' self.pos += 1 if d.expr(argval): args.append(d.expr(argval)) self.pos += 1 if toks[self.pos][0] == ';': ast.append(Node('call', name, args, None)) else: raise SyntaxError('invalid syntax') if block == True: return (ast[0], self.pos) self.pos += 1 astpos += 1 return ast FETCH, STORE, ASTORE, PUSH, POP, ADD, SUB, MUL, DIV, LT, GT, EQ, NOTEQ, JZ, JNZ, JMP, RECV, SEND, CONNECT, EXIT_PID, LIST, DICT, INDEX, HALT = range(24) class Compiler: def __init__(self): self.program = [] self.pc = 0 self.funcs = {} def gen(self, command): self.program.append(command) self.pc = self.pc + 1 def compilenode(self, node): try: name = node.name except: name = node[0].name node = node[0] if name == 'NUM': self.gen(PUSH) self.gen(int(node.op1)) elif name == 'ID': self.gen(FETCH) self.gen(node.op1) elif name == 'STRING': self.gen(PUSH) self.gen(node.op1) elif name == '+': self.compilenode(node.op1) self.compilenode(node.op2) self.gen(ADD) elif name == '-': self.compilenode(node.op1) self.compilenode(node.op2) self.gen(SUB) elif name == '/': self.compilenode(node.op1) self.compilenode(node.op2) self.gen(DIV) elif name == '*': self.compilenode(node.op1) self.compilenode(node.op2) self.gen(MUL) elif name == '<': self.compilenode(node.op1) self.compilenode(node.op2) self.gen(LT) elif name == '>': self.compilenode(node.op1) self.compilenode(node.op2) self.gen(GT) elif name == '!=': self.compilenode(node.op1) self.compilenode(node.op2) self.gen(NOTEQ) elif name == '==': self.compilenode(node.op1) self.compilenode(node.op2) self.gen(EQ) elif name == 'assign': self.compilenode(node.op2) self.gen(STORE) self.gen(node.op1) elif name == 'do': addr = self.pc self.compilenode(node.op1) for i in node.op2: self.compilenode(i) self.gen(JNZ) self.gen(addr) elif name == 'if': self.compilenode(node.op1) self.gen(JZ) addr = self.pc self.gen(0) for i in node.op2: self.compilenode(i) self.program[addr] = self.pc elif name == 'function': func_name = node.op1 args = node.op2 body = node.op3 self.funcs[func_name] = { 'args': args, 'body': body, } elif name == 'call': if node.op1 == 'recv': for i in node.op2: self.compilenode(i) self.gen(RECV) elif node.op1 == 'exit': self.gen(EXIT_PID) elif node.op1 == 'send': for i in node.op2: self.compilenode(i) self.gen(SEND) elif node.op1 == 'list': count = 0 len_ = len(node.op2) for i in node.op2: if count == len_ - 1 and len_ != 1: break self.compilenode(i) count += 1 self.gen(PUSH) self.gen(len_ + 1 if len_ == 1 else len_) self.gen(LIST) elif node.op1 == 'dict': for i in node.op2: self.compilenode(i) self.gen(PUSH) self.gen(len(node.op2)) self.gen(DICT) elif node.op1 == 'get': self.compilenode(node.op2[0]) self.compilenode(node.op2[1]) self.gen(INDEX) elif node.op1 in self.funcs: cur = 0 for i in node.op2: self.compilenode(i) self.gen(STORE) self.gen(self.funcs[node.op1]['args'][cur].op1) cur += 1 for j in self.funcs[node.op1]['body']: self.compilenode(j) else: raise NameError('function '+str(node.op1)+' not found') elif name == 'while': addr1 = self.pc self.compilenode(node.op1) self.gen(JZ) addr2 = self.pc self.gen(1) for i in node.op2: self.compilenode(i) self.gen(JMP) self.gen(addr1) self.program[addr2] = self.pc elif name == 'else': self.compilenode(node.op1) self.gen(JZ) addr1 = self.pc self.gen(0) for i in node.op2: self.compilenode(i) self.gen(JMP) addr2 = self.pc self.gen(0) self.program[addr1] = self.pc for j in node.op3: self.compilenode(j) self.program[addr2] = self.pc def compileast(self, ast): for i in ast: self.compilenode(i) if 'main' in self.funcs: self.compilenode(Node('call', 'main', [], None)) self.gen(HALT) return self.program CLOSED, RUNNING = 1, 2 class VirtualMachine: def __init__(self, ipc, pid): self.ipc = ipc self.pid = pid self.program = [] self.pc = 0 self.stack = [] self.env = {'exitcode': 0} self.state = CLOSED self.i_closed = 0 def load_prog(self, bytecode): self.program = bytecode self.pc = 0 self.stack = [] self.env = {'exitcode': 0} def make_step(self, quantum=3): if self.i_closed: return 0 self.state = RUNNING pc = self.pc stack = self.stack env = self.env program = self.program if pc >= len(self.program): self.state = CLOSED self.program = [] return 0 for i in range(quantum): if pc >= len(self.program): self.state = CLOSED self.program = [] return 0 op = program[pc] if pc < len(program) - 1: arg = program[pc + 1] if op == FETCH: try: if env[arg]: stack.append(env[arg]) else: stack.append(0) except: stack.append(0) pc += 2 elif op == EXIT_PID: self.i_closed = 1 self.state = CLOSED return 0 elif op == STORE: value = stack.pop() env[arg] = value pc += 2 elif op == PUSH: stack.append(arg) pc += 2 elif op == ADD: stack[-2] += stack[-1] stack.pop() pc += 1 elif op == SUB: stack[-2] -= stack[-1] stack.pop() pc += 1 elif op == MUL: stack[-2] *= stack[-1] stack.pop() pc += 1 elif op == DIV: stack[-2] //= stack[-1] stack.pop() pc += 1 elif op == LT: if stack[-2] < stack[-1]: stack[-2] = 1 else: stack[-2] = 0 stack.pop() pc += 1 elif op == GT: if stack[-2] > stack[-1]: stack[-2] = 1 else: stack[-2] = 0 stack.pop() pc += 1 elif op == EQ: if stack[-2] == stack[-1]: stack[-2] = 1 else: stack[-2] = 0 stack.pop() pc += 1 elif op == NOTEQ: if stack[-2] != stack[-1]: stack[-2] = 1 else: stack[-2] = 0 stack.pop() pc += 1 elif op == POP: stack.append(arg) stack.pop() pc += 1 elif op == JZ: if stack.pop() == 0: pc = arg else: pc += 2 elif op == JNZ: if stack.pop() != 0: pc = arg else: pc += 2 elif op == JMP: pc = arg elif op == SEND: stack.pop() piid = stack.pop() val = stack.pop() self.ipc.send(self.pid, val, piid) pc += 1 elif op == RECV: piid = stack.pop() val = self.ipc.recv(self.pid, piid) self.env['res'] = val pc += 1 elif op == LIST: count = stack.pop() - 1 res = [] for i in range(count): val = stack.pop() if val == '': continue res.append(val) res = res[::-1] env['list'] = res pc += 1 elif op == DICT: count = stack.pop() raw_data = [] for _ in range(count): val = stack.pop() if val == '': continue raw_data.append(val) res = {} res = {} i = len(raw_data) - 1 while i > 0: key = raw_data[i] val = raw_data[i - 1] res[key] = val i -= 2 env['dict'] = res pc += 1 elif op == INDEX: idx = stack.pop() obj = stack.pop() try: res = obj[idx] except: res = 0 env['get'] = res pc += 1 elif op == HALT: return env['exitcode'] self.pc = pc self.stack = stack self.env = env return env.get('exitcode', 0) def clua_new(program, ipc, pid): parser = Parser() compiler = Compiler() ast = parser.parse(c_lexer(preproc(program))) bytecode = compiler.compileast(ast) vm = VirtualMachine(ipc, pid) vm.load_prog(bytecode) return vm