X-Git-Url: https://code.kerkeslager.com/?a=blobdiff_plain;f=transformation.py;h=5fb853c40a86d62ea2f6be4b7e0d8583e5ee53c8;hb=e5e0dba41edce39475f839e29650007b37641be9;hp=cdf81551c20d0bfec6de52f52fd933f219e9f5e4;hpb=fd918259dd949c8fababcf49ced426ab3c39da38;p=fur diff --git a/transformation.py b/transformation.py index cdf8155..5fb853c 100644 --- a/transformation.py +++ b/transformation.py @@ -1,5 +1,6 @@ import collections +import normalization import parsing CIntegerLiteral = collections.namedtuple( @@ -12,121 +13,385 @@ CIntegerLiteral = collections.namedtuple( CStringLiteral = collections.namedtuple( 'CStringLiteral', [ + 'index', 'value', ], ) -CAdditionExpression = collections.namedtuple( - 'CAdditionExpression', +CConstantExpression = collections.namedtuple( + 'CConstantExpression', [ - 'left', - 'right', + 'value' ], ) -CSubtractionExpression = collections.namedtuple( - 'CSubtractionExpression', +CVariableExpression = collections.namedtuple( + 'CVariableExpression', [ - 'left', - 'right', + 'variable', ], ) -CMultiplicationExpression = collections.namedtuple( - 'CMultiplicationExpression', +CSymbolExpression = collections.namedtuple( + 'CSymbolExpression', [ - 'left', - 'right', + 'symbol', + 'symbol_list_index', ], ) -CIntegerDivisionExpression = collections.namedtuple( - 'CIntegerDivisionExpression', +CNegationExpression = collections.namedtuple( + 'CNegationExpression', [ - 'left', - 'right', + 'value', ], ) -CModularDivisionExpression = collections.namedtuple( - 'CModularDivisionExpression', +CFunctionCallForFurInfixOperator = collections.namedtuple( + 'CFunctionCallForFurInfixOperator', [ + 'name', 'left', 'right', ], ) -CFunctionCallStatement = collections.namedtuple( - 'CFunctionCallStatement', +CFunctionCallExpression = collections.namedtuple( + 'CFunctionCallExpression', + [ + 'name', + 'argument_count', + 'argument_items', + ], +) + +CSymbolAssignmentStatement = collections.namedtuple( + 'CSymbolAssignmentStatement', + [ + 'target', + 'target_symbol_list_index', + 'expression', + ], +) + +CArrayVariableInitializationStatement = collections.namedtuple( + 'CArrayVariableInitializationStatement', + [ + 'variable', + 'items', + ], +) + +CVariableInitializationStatement = collections.namedtuple( + 'CVariableInitializationStatement', + [ + 'variable', + 'expression', + ], +) + +CVariableReassignmentStatement = collections.namedtuple( + 'CVariableReassignmentStatement', + [ + 'variable', + 'expression', + ], +) + +CExpressionStatement = collections.namedtuple( + 'CExpressionStatement', + [ + 'expression', + ], +) + +CIfElseStatement = collections.namedtuple( + 'CIfElseStatement', + [ + 'condition_expression', + 'if_statements', + 'else_statements', + ], +) + +CFunctionDeclaration = collections.namedtuple( + 'CFunctionDeclaration', + [ + 'name', + ], +) + +CFunctionDefinition = collections.namedtuple( + 'CFunctionDefinition', [ 'name', - 'arguments', + 'statement_list', ], ) CProgram = collections.namedtuple( 'CProgram', [ - 'builtins', + 'builtin_set', + 'function_definition_list', 'statements', 'standard_libraries', + 'string_literal_list', + 'symbol_list', ], ) +EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING = { + '==': 'equals', + '!=': 'notEquals', + '<=': 'lessThanOrEqual', + '>=': 'greaterThanOrEqual', + '<': 'lessThan', + '>': 'greaterThan', +} + +def transform_comparison_level_expression(accumulators, expression): + # Transform expressions like 1 < 2 < 3 into expressions like 1 < 2 && 2 < 3 + if isinstance(expression.left, parsing.FurInfixExpression) and expression.left.order == 'comparison_level': + left = transform_comparison_level_expression( + accumulators, + expression.left + ) + + middle = left.right + + right = transform_expression( + accumulators, + expression.right, + ) + + # TODO Don't evaluate the middle expression twice + return CFunctionCallForFurInfixOperator( + name='and', + left=left, + right=CFunctionCallForFurInfixOperator( + name=EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING[expression.operator], + left=middle, + right=right, + ), + ) + + return CFunctionCallForFurInfixOperator( + name=EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING[expression.operator], + left=transform_expression(accumulators, expression.left), + right=transform_expression(accumulators, expression.right), + ) + BUILTINS = { - 'print': ['stdio.h.'], + 'false': [], + 'pow': ['math.h'], + 'print': ['stdio.h'], + 'true': [], } -def transform_expression(builtin_dependencies, expression): +def transform_variable_expression(accumulators, expression): + return CVariableExpression(variable=expression.variable) + +def transform_infix_expression(accumulators, expression): + if expression.order == 'comparison_level': + return transform_comparison_level_expression(accumulators, expression) + + INFIX_OPERATOR_TO_FUNCTION_NAME = { + '+': 'add', + '-': 'subtract', + '*': 'multiply', + '//': 'integerDivide', + '%': 'modularDivide', + 'and': 'and', + 'or': 'or', + } + + return CFunctionCallForFurInfixOperator( + name=INFIX_OPERATOR_TO_FUNCTION_NAME[expression.operator], + left=transform_expression(accumulators, expression.left), + right=transform_expression(accumulators, expression.right), + ) + +def transform_expression(accumulators, expression): + if isinstance(expression, parsing.FurParenthesizedExpression): + # Parentheses can be removed because everything in the C output is explicitly parenthesized + return transform_expression(accumulators, expression.internal) + + if isinstance(expression, parsing.FurNegationExpression): + return transform_negation_expression(accumulators, expression) + + if isinstance(expression, parsing.FurFunctionCallExpression): + return transform_function_call_expression(accumulators, expression) + + if isinstance(expression, parsing.FurSymbolExpression): + if expression.value in ['true', 'false']: + return CConstantExpression(value=expression.value) + + if expression.value not in accumulators.symbol_list: + symbol_list.append(expression.value) + + return CSymbolExpression( + symbol=expression.value, + symbol_list_index=accumulators.symbol_list.index(expression.value), + ) + + if isinstance(expression, parsing.FurStringLiteralExpression): + value = expression.value + + try: + index = accumulators.string_literal_list.index(value) + except ValueError: + index = len(accumulators.string_literal_list) + accumulators.string_literal_list.append(value) + + return CStringLiteral(index=index, value=value) LITERAL_TYPE_MAPPING = { parsing.FurIntegerLiteralExpression: CIntegerLiteral, - parsing.FurStringLiteralExpression: CStringLiteral, } if type(expression) in LITERAL_TYPE_MAPPING: return LITERAL_TYPE_MAPPING[type(expression)](value=expression.value) - INFIX_TYPE_MAPPING = { - parsing.FurAdditionExpression: CAdditionExpression, - parsing.FurSubtractionExpression: CSubtractionExpression, - parsing.FurMultiplicationExpression: CMultiplicationExpression, - parsing.FurIntegerDivisionExpression: CIntegerDivisionExpression, - parsing.FurModularDivisionExpression: CModularDivisionExpression, - } + # TODO Handle all possible types in this form + return { + parsing.FurInfixExpression: transform_infix_expression, # TODO Shouldn't need this + normalization.NormalFunctionCallExpression: transform_function_call_expression, + normalization.NormalInfixExpression: transform_infix_expression, + normalization.NormalNegationExpression: transform_negation_expression, + normalization.NormalVariableExpression: transform_variable_expression, + }[type(expression)](accumulators, expression) + +def transform_symbol_assignment_statement(accumulators, assignment_statement): + # TODO Check that target is not a builtin + if assignment_statement.target not in accumulators.symbol_list: + accumulators.symbol_list.append(assignment_statement.target) - return INFIX_TYPE_MAPPING[type(expression)]( - left=transform_expression(builtin_dependencies, expression.left), - right=transform_expression(builtin_dependencies, expression.right), + return CSymbolAssignmentStatement( + target=assignment_statement.target, + target_symbol_list_index=accumulators.symbol_list.index(assignment_statement.target), + expression=transform_expression( + accumulators, + assignment_statement.expression, + ), ) -def transform_function_call_statement(builtin_dependencies, function_call): - if function_call.name in BUILTINS.keys(): - builtin_dependencies.add(function_call.name) +def transform_negation_expression(accumulators, expression): + return CNegationExpression( + value=transform_expression(accumulators, expression.internal_expression), + ) - return CFunctionCallStatement( - name='builtin$' + function_call.name, - arguments=tuple(transform_expression(builtin_dependencies, arg) for arg in function_call.arguments), - ) +def transform_function_call_expression(accumulators, function_call): + if function_call.function.value in BUILTINS.keys(): + # TODO Check that the builtin is actually callable + accumulators.builtin_set.add(function_call.function.value) + + # TODO Use the symbol from SYMBOL LIST + return CFunctionCallExpression( + name=function_call.function.value, + argument_count=function_call.argument_count, + argument_items=transform_expression(accumulators, function_call.argument_items), + ) + +def transform_expression_statement(accumulators, statement): + # TODO At some point we can verify that all expression types are supported and just call transform_expression + expression = { + parsing.FurFunctionCallExpression: transform_function_call_expression, + parsing.FurInfixExpression: transform_expression, + parsing.FurIntegerLiteralExpression: transform_expression, + parsing.FurSymbolExpression: transform_expression, + normalization.NormalFunctionCallExpression: transform_function_call_expression, + normalization.NormalVariableExpression: transform_expression, + }[type(statement.expression)](accumulators, statement.expression) + + return CExpressionStatement( + expression=expression, + ) + +def transform_if_else_statement(accumulators, statement): + return CIfElseStatement( + condition_expression=transform_expression(accumulators, statement.condition_expression), + if_statements=tuple(transform_statement(accumulators, s) for s in statement.if_statements), + else_statements=tuple(transform_statement(accumulators, s) for s in statement.else_statements), + ) + +def transform_array_variable_initialization_statement(accumulators, statement): + return CArrayVariableInitializationStatement( + variable=statement.variable, + items=tuple(transform_expression(accumulators, i) for i in statement.items), + ) + +def transform_variable_initialization_statement(accumulators, statement): + return CVariableInitializationStatement( + variable=statement.variable, + expression=transform_expression(accumulators, statement.expression), + ) + +def transform_variable_reassignment_statement(accumulators, statement): + return CVariableReassignmentStatement( + variable=statement.variable, + expression=transform_expression(accumulators, statement.expression), + ) + +def transform_function_definition_statement(accumulators, statement): + # TODO Allow defining the same function in different contexts + if any(fd.name == statement.name for fd in accumulators.function_definition_list): + raise Exception('A function with name "{}" already exists'.format(statement.name)) + + accumulators.function_definition_list.append(CFunctionDefinition( + name=statement.name, + statement_list=tuple(transform_statement(accumulators, s) for s in statement.statement_list) + )) + + return CFunctionDeclaration(name=statement.name) - raise Exception() +def transform_statement(accumulators, statement): + return { + parsing.FurAssignmentStatement: transform_symbol_assignment_statement, + parsing.FurExpressionStatement: transform_expression_statement, + normalization.NormalArrayVariableInitializationStatement: transform_array_variable_initialization_statement, + normalization.NormalExpressionStatement: transform_expression_statement, + normalization.NormalFunctionDefinitionStatement: transform_function_definition_statement, + normalization.NormalIfElseStatement: transform_if_else_statement, + normalization.NormalVariableInitializationStatement: transform_variable_initialization_statement, + normalization.NormalVariableReassignmentStatement: transform_variable_reassignment_statement, + }[type(statement)](accumulators, statement) + + +Accumulators = collections.namedtuple( + 'Accumulators', + [ + 'builtin_set', + 'function_definition_list', + 'symbol_list', + 'string_literal_list', + ], +) def transform(program): - builtins = set() + accumulators = Accumulators( + builtin_set=set(), + function_definition_list=[], + symbol_list=[], + string_literal_list=[], + ) - c_statements = [ - transform_function_call_statement(builtins, statement) for statement in program.statement_list + statement_list = [ + transform_statement(accumulators, statement) for statement in program.statement_list ] - standard_libraries = set() - for builtin in builtins: + standard_library_set = set() + for builtin in accumulators.builtin_set: for standard_library in BUILTINS[builtin]: - standard_libraries.add(standard_library) + standard_library_set.add(standard_library) return CProgram( - builtins=builtins, - statements=c_statements, - standard_libraries=standard_libraries, + builtin_set=accumulators.builtin_set, + function_definition_list=accumulators.function_definition_list, + statements=statement_list, + standard_libraries=standard_library_set, + string_literal_list=accumulators.string_literal_list, + symbol_list=accumulators.symbol_list, )