def build_translation_unit(self, tree: grammerParser.RContext): if tree.getChildCount() == 2: function_list = self.build_translation_unit(tree.getChild(0)) function_list += self.build_function_definition(tree.getChild(1)) return function_list elif tree.getChildCount() == 1: return self.build_function_definition(tree.getChild(0))
def build_function_declarator(self, tree: grammerParser.RContext): if tree.getChildCount() == 3: function_name = self.build_function_name(tree.getChild(0)) return function_name, [] if tree.getChildCount() == 4: function_name = self.build_function_name(tree.getChild(0)) self.current_function = function_name parameter_type_list = self.build_parameter_list(tree.getChild(2)) return function_name, parameter_type_list
def build_init_declarator_list(self, tree: grammerParser.RContext, type): if tree.getChildCount() == 3: expression_list = self.build_init_declarator_list( tree.getChild(0), type) expression_list += [ self.build_init_declarator(tree.getChild(2), type) ] return expression_list if tree.getChildCount() == 1: return [self.build_init_declarator(tree.getChild(0), type)]
def build_declarator(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: identifier = tree.getText() return identifier, [] elif tree.getChildCount() == 4 and tree.getChild( 0).getRuleIndex() == grammerParser.RULE_declarator: identifier, size_list = self.build_declarator(tree.getChild(0)) expression = self.build_logical_or_expression(tree.getChild(2)) if isinstance( expression, ConstantExpression) and expression.get_type() == 'int': size_list.append(expression.get_value()) return identifier, size_list
def build_unary_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return self.build_postfix_expression(tree.getChild(0)) elif tree.getChild(0).getChildCount() > 0: op = self.build_unary_operator(tree.getChild(0)) expression = self.build_cast_expression(tree.getChild(1)) if op == '!': if expression.get_type() == 'bool': if isinstance(expression, ConstantExpression): expression.not_value() return expression else: return UnaryExpression(expression, op) else: raise CompilerError('! except bool') elif op == '-': if expression.get_type() != 'bool': if isinstance(expression, ConstantExpression): expression.negetive_value() return expression else: return UnaryExpression(expression, op) else: raise CompilerError('- except int or real') else: expression = self.build_unary_expression(tree.getChild(1)) if isinstance( expression, VariableExpression) and expression.get_type() == 'int': return SelfIncrementUnaryExpression(expression, tree.getChild(0).getText()) else: raise CompilerError('type error')
def build_primary_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 3: return self.build_assignment_expression(tree.getChild(1)) elif tree.getChild(0).getChildCount() != 0: identifier, expression_list = self.build_variable_expression( tree.getChild(0)) if self.symbol_table.is_function_existed(identifier) and len( expression_list) == 0: return identifier if self.symbol_table.is_variable_existed(identifier): symbol = self.symbol_table.get_variable(identifier) if len(expression_list) > 0: variable_expression = VariableExpression( symbol, expression_list) else: variable_expression = VariableExpression(symbol) return variable_expression else: raise CompilerError('variable is not defined') elif tree.getChild(0).getPayload().type == grammerLexer.INT_CONSTANT: return ConstantExpression(tree.getText(), 'int') elif tree.getChild(0).getPayload().type == grammerLexer.BOOL_CONSTANT: return ConstantExpression(tree.getText(), 'bool') elif tree.getChild(0).getPayload().type == grammerLexer.REAL_CONSTANT: return ConstantExpression(tree.getText(), 'real')
def build_additive_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return self.build_multiplicative_expression(tree.getChild(0)) else: left_expression = self.build_additive_expression(tree.getChild(0)) right_expression = self.build_multiplicative_expression( tree.getChild(2)) op = tree.getChild(1).getText() if left_expression.get_type() == right_expression.get_type( ) and left_expression.get_type() != 'bool': if isinstance(left_expression, ConstantExpression) and isinstance( right_expression, ConstantExpression): if op == '+': return ConstantExpression( left_expression.get_value() + right_expression.get_value(), left_expression.get_type()) if op == '-': return ConstantExpression( left_expression.get_value() - right_expression.get_value(), left_expression.get_type()) else: return ArithmeticExpression(left_expression, right_expression, op) else: raise CompilerError('type error')
def build_variable_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return tree.getText(), [] else: identifier, expression_list = self.build_variable_expression( tree.getChild(0)) expression_list.append( self.build_assignment_expression(tree.getChild(2))) return identifier, expression_list
def build_argument_expression_list(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return [self.build_assignment_expression(tree.getChild(0))] else: argument_expression_list = self.build_argument_expression_list( tree.getChild(0)) argument_expression_list += [ self.build_assignment_expression(tree.getChild(2)) ] return argument_expression_list
def build_parameter_list(self, tree: grammerParser.RContext): parameter_type_list = [] if tree.getChildCount() == 3: parameter_type_list = self.build_parameter_list(tree.getChild(0)) parameter_type_list += self.build_parameter_declaration( tree.getChild(2)) else: parameter_type_list += self.build_parameter_declaration( tree.getChild(0)) return parameter_type_list
def build_statement_list(self, tree: grammerParser.RContext): if tree.getChildCount() == 2: statement_list = self.build_statement_list(tree.getChild(0)) statement_list += self.build_statement(tree.getChild(1)) return statement_list else: try: return self.build_statement(tree.getChild(0)) except CompilerError as e: print('\033[93m' + 'Error: ' + str(e)) return []
def build_postfix_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: expression = self.build_primary_expression(tree.getChild(0)) return expression elif tree.getChildCount() == 2: expression = self.build_postfix_expression(tree.getChild(0)) if isinstance( expression, VariableExpression) and expression.get_type() == 'int': return SelfIncrementPostfixExpression( expression, tree.getChild(1).getText()) else: raise CompilerError('++ except variable') elif tree.getChildCount() == 3: function_name = self.build_postfix_expression(tree.getChild(0)) if self.symbol_table.is_function_existed(function_name): function_symbol = self.symbol_table.get_function_symbol( function_name) if function_symbol.is_argument_right([]): return FunctionCallExpression(function_symbol, []) else: raise CompilerError('parameter error') else: raise CompilerError('function is not defined') else: function_name = self.build_postfix_expression(tree.getChild(0)) argument_expression_list = self.build_argument_expression_list( tree.getChild(2)) if self.symbol_table.is_function_existed(function_name): function_symbol = self.symbol_table.get_function_symbol( function_name) if function_symbol.is_argument_right(argument_expression_list): return FunctionCallExpression(function_symbol, argument_expression_list) else: raise CompilerError('parameter error') else: raise CompilerError('function is not defined')
def build_logical_or_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return self.build_logical_and_expression(tree.getChild(0)) else: left_expression = self.build_logical_or_expression( tree.getChild(0)) right_expression = self.build_logical_and_expression( tree.getChild(2)) op = tree.getChild(1).getText() if left_expression.get_type() == right_expression.get_type( ) and left_expression.get_type() == 'bool': return ComparisonExpression(left_expression, right_expression, op)
def build_equality_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return self.build_relational_expression(tree.getChild(0)) else: left_expression = self.build_equality_expression(tree.getChild(0)) right_expression = self.build_relational_expression( tree.getChild(2)) op = tree.getChild(1).getText() if left_expression.get_type() == right_expression.get_type(): return ComparisonExpression(left_expression, right_expression, op) else: raise CompilerError('you can only compiler same type')
def build_logical_and_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return self.build_equality_expression(tree.getChild(0)) else: left_expression = self.build_logical_and_expression( tree.getChild(0)) right_expression = self.build_equality_expression(tree.getChild(2)) op = tree.getChild(1).getText() if left_expression.get_type() == right_expression.get_type( ) and left_expression.get_type() == 'bool': return ComparisonExpression(left_expression, right_expression, op) else: raise CompilerError("&& only can calculate bool")
def build_cast_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return self.build_unary_expression(tree.getChild(0)) else: expression = self.build_cast_expression(tree.getChild(3)) type = self.build_declaration_specifiers(tree.getChild(1)) if expression.get_type() != type: if type == 'bool' or expression.get_type() == 'bool': raise CompilerError('you can not cast bool') else: if isinstance(expression, ConstantExpression): expression.change_type() return expression else: return CastExpression(expression, type)
def build_init_declarator(self, tree: grammerParser.RContext, type): if tree.getChildCount() == 3: identifier, size_list = self.build_declarator(tree.getChild(0)) if len(size_list) > 0: raise CompilerError('you can init a array') else: self.symbol_table.add_variable_name(identifier, type) variable_expression = VariableExpression( self.symbol_table.get_variable(identifier)) expression = self.build_assignment_expression(tree.getChild(2)) if variable_expression.get_type() != expression.get_type(): raise CompilerError('type error') return AssignmentExpression(variable_expression, expression, '=') else: identifier, size_list = self.build_declarator(tree.getChild(0)) if len(size_list) > 0: self.symbol_table.add_variable_name(identifier, type, size_list) symbol = self.symbol_table.get_variable(identifier) code = [] length = reduce(lambda x, y: x * y, size_list) for i in range(length): code += [f'lda 0 {symbol.get_address()}'] code += [f'ldc i {i}'] code += [f'ixa 1'] if symbol.get_type() == 'int': code += [f'ldc i 0'] code += [f'sto i'] elif symbol.get_type() == 'real': code += [f'ldc r 0.0'] code += [f'sto r'] elif symbol.get_type() == 'bool': code += [f'ldc b f'] code += [f'sto b'] return PcodeExpression(code) else: self.symbol_table.add_variable_name(identifier, type) variable_expression = VariableExpression( self.symbol_table.get_variable(identifier)) if type == 'int': expression = ConstantExpression('0', 'int') elif type == 'real': expression = ConstantExpression('0.0', 'real') else: expression = ConstantExpression('false', 'bool') return AssignmentExpression(variable_expression, expression, '=')
def build_multiplicative_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return self.build_cast_expression(tree.getChild(0)) else: left_expression = self.build_multiplicative_expression( tree.getChild(0)) right_expression = self.build_cast_expression(tree.getChild(2)) op = tree.getChild(1).getText() if left_expression.get_type() == right_expression.get_type( ) and left_expression.get_type() != 'bool': if isinstance(left_expression, ConstantExpression) and isinstance( right_expression, ConstantExpression): if op == '*': return ConstantExpression( left_expression.get_value() * right_expression.get_value(), left_expression.get_type()) if left_expression.get_type() == 'int': if op == '/': return ConstantExpression( left_expression.get_value() // right_expression.get_value(), left_expression.get_type()) elif op == '%': return ConstantExpression( left_expression.get_value() % right_expression.get_value(), left_expression.get_type()) else: if op == '/': return ConstantExpression( left_expression.get_value() / right_expression.get_value(), left_expression.get_type()) else: raise CompilerError('type error') if op != '%' and left_expression.get_type() == 'real': raise CompilerError('you can mod real') else: return ArithmeticExpression(left_expression, right_expression, op) else: raise CompilerError('you can\'t calculate bool')
def build_seletion_statement(self, tree: grammerParser.RContext): condition = self.build_assignment_expression(tree.getChild(2)) if condition.get_type() != 'bool': raise CompilerError('condition must be bool') then_statement = self.build_statement(tree.getChild(4)) if not isinstance(then_statement, list): then_statement = [then_statement] if tree.getChildCount() == 7: else_statement = self.build_statement(tree.getChild(6)) if not isinstance(else_statement, list): else_statement = [else_statement] self.label += 2 return SelectionStatement(condition, then_statement, 'label' + str(self.label - 2), else_statement, 'label' + str(self.label - 1)) else: self.label += 1 return SelectionStatement(condition, then_statement, 'label' + str(self.label - 1))
def build_assignment_expression(self, tree: grammerParser.RContext): if tree.getChildCount() == 1: return self.build_logical_or_expression(tree.getChild(0)) else: identifier, expression_list = self.build_variable_expression( tree.getChild(0)) op = self.build_assignment_operator(tree.getChild(1)) expression = self.build_assignment_expression(tree.getChild(2)) if self.symbol_table.is_variable_existed(identifier): symbol = self.symbol_table.get_variable(identifier) if symbol.get_type() == expression.get_type(): if len(expression_list) > 0: variable_expression = VariableExpression( symbol, expression_list) else: variable_expression = VariableExpression(symbol) return AssignmentExpression(variable_expression, expression, op) else: raise CompilerError('type error') else: raise CompilerError('variable is not defined')
def build_expression_statement(self, tree: grammerParser.RContext): if tree.getChildCount() == 2: return self.build_assignment_expression(tree.getChild(0)) else: return PcodeExpression([])
def build_iteration_statement(self, tree: grammerParser.RContext): if tree.getChild(0).getText() == 'while': condition = self.build_assignment_expression(tree.getChild(2)) if condition.get_type() != 'bool': raise CompilerError('condition must be bool') after_start = self.build_statement(tree.getChild(4)) if not isinstance(after_start, list): after_start = [after_start] self.label += 2 return IterationStatement(condition, f'label{self.label - 2}', f'label{self.label - 1}', [], after_start, []) if tree.getChild(0).getText() == 'do': condition = self.build_assignment_expression(tree.getChild(4)) if condition.get_type() != 'bool': raise CompilerError('condition must be bool') after_start = self.build_statement(tree.getChild(1)) if not isinstance(after_start, list): after_start = [after_start] self.label += 2 return IterationStatement(condition, f'label{self.label - 2}', f'label{self.label - 1}', after_start, after_start, []) if tree.getChild(0).getText() == 'repeat': condition = self.build_assignment_expression(tree.getChild(4)) if condition.get_type() != 'bool': raise CompilerError('condition must be bool') condition = UnaryExpression(condition, '!') after_start = self.build_statement(tree.getChild(1)) if not isinstance(after_start, list): after_start = [after_start] self.label += 2 return IterationStatement(condition, f'label{self.label - 2}', f'label{self.label - 1}', after_start, after_start, []) if tree.getChild(0).getText() == 'for' and tree.getChildCount() == 7: condition = self.build_expression_statement(tree.getChild(3)) if condition.get_type() != 'bool': raise CompilerError('condition must be bool') after_start = self.build_statement(tree.getChild(6)) if not isinstance(after_start, list): after_start = [after_start] before_end = self.build_assignment_expression(tree.getChild(4)) if not isinstance(before_end, list): before_end = [before_end] before_start = self.build_expression_statement(tree.getChild(2)) if not isinstance(before_start, list): before_start = [before_start] self.label += 2 return IterationStatement(condition, f'label{self.label - 2}', f'label{self.label - 1}', before_start, after_start, before_end) else: condition = self.build_expression_statement(tree.getChild(3)) if condition.get_type() != 'bool': raise CompilerError('condition must be bool') after_start = self.build_statement(tree.getChild(5)) if not isinstance(after_start, list): after_start = [after_start] before_start = self.build_expression_statement(tree.getChild(2)) if not isinstance(before_start, list): before_start = [before_start] self.label += 2 return IterationStatement(condition, f'label{self.label - 2}', f'label{self.label - 1}', before_start, after_start, [])
def build_declaration_statement(self, tree: grammerParser.RContext): if tree.getChildCount() == 3: type = self.build_declaration_specifiers(tree.getChild(0)) return self.build_init_declarator_list(tree.getChild(1), type)
def build_parameter_declarator(self, tree: grammerParser.RContext): if tree.getChildCount() != 1: pass # TODO 函数参数出错 else: return tree.getText()
def build_compound_statement(self, tree: grammerParser.RContext): if tree.getChildCount() == 3: return self.build_statement_list(tree.getChild(1)) else: pass # TODO 语句为空所做的事情