X-Git-Url: https://code.kerkeslager.com/?a=blobdiff_plain;f=transformation.py;h=0249890e4e9bac2b968c0a8359b57fe45c1d01ab;hb=51b6cd6152e6311805b55e847ae9eb60f5c7c471;hp=b636286efa8ad2ae0ee052a69b2a3cfa0e1ebc81;hpb=0d43b38c70255f1bdb69ceede2b67ef4b293468b;p=fur diff --git a/transformation.py b/transformation.py index b636286..0249890 100644 --- a/transformation.py +++ b/transformation.py @@ -1,7 +1,7 @@ import collections import normalization -import parsing +import parsing # TODO Remove this import, as we should be normalizing everything before it gets here CIntegerLiteral = collections.namedtuple( 'CIntegerLiteral', @@ -114,10 +114,28 @@ CIfElseStatement = collections.namedtuple( ], ) +CFunctionDeclaration = collections.namedtuple( + 'CFunctionDeclaration', + [ + 'name', + ], +) + +CFunctionDefinition = collections.namedtuple( + 'CFunctionDefinition', + [ + 'name', + 'argument_name_list', + 'statement_list', + ], +) + CProgram = collections.namedtuple( 'CProgram', [ 'builtin_set', + 'function_definition_list', + 'operator_declarations', 'statements', 'standard_libraries', 'string_literal_list', @@ -125,16 +143,71 @@ CProgram = collections.namedtuple( ], ) -EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING = { - '==': 'equals', - '!=': 'notEquals', - '<=': 'lessThanOrEqual', - '>=': 'greaterThanOrEqual', - '<': 'lessThan', - '>': 'greaterThan', +BUILTINS = { + 'false': [], + 'pow': ['math.h'], + 'print': ['stdio.h'], + 'true': [], +} + +def transform_variable_expression(accumulators, expression): + return CVariableExpression(variable=expression.variable) + +def transform_string_literal_expression(accumulators, expression): + value = expression.string + + 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) + +def transform_symbol_expression(accumulators, expression): + if expression.symbol in ['true', 'false']: + return CConstantExpression(value=expression.symbol) + + try: + symbol_list_index = accumulators.symbol_list.index(expression.symbol) + except ValueError: + symbol_list_index = len(accumulators.symbol_list) + accumulators.symbol_list.append(expression.symbol) + + return CSymbolExpression( + symbol=expression.symbol, + symbol_list_index=symbol_list_index, + ) + +CInfixDeclaration = collections.namedtuple( + 'CInfixDeclaration', + [ + 'name', + 'in_type', + 'out_type', + 'operator', + ], +) + +INFIX_OPERATOR_TO_DECLARATION = { + '+': CInfixDeclaration(name='add', in_type='integer', out_type='integer', operator='+'), + '-': CInfixDeclaration(name='subtract', in_type='integer', out_type='integer', operator='-'), + '*': CInfixDeclaration(name='multiply', in_type='integer', out_type='integer', operator='*'), + '//': CInfixDeclaration(name='integerDivide', in_type='integer', out_type='integer', operator='/'), + '%': CInfixDeclaration(name='modularDivide', in_type='integer', out_type='integer', operator='%'), + 'and': CInfixDeclaration(name='and', in_type='boolean', out_type='boolean', operator='&&'), + 'or': CInfixDeclaration(name='or', in_type='boolean', out_type='boolean', operator='||'), + '==': CInfixDeclaration(name='equals', in_type='integer', out_type='boolean', operator='=='), + '!=': CInfixDeclaration(name='notEquals', in_type='integer', out_type='boolean', operator='!='), + '<=': CInfixDeclaration(name='lessThanOrEqual', in_type='integer', out_type='boolean', operator='<='), + '>=': CInfixDeclaration(name='greaterThanOrEqual', in_type='integer', out_type='boolean', operator='>='), + '<': CInfixDeclaration(name='lessThan', in_type='integer', out_type='boolean', operator='<'), + '>': CInfixDeclaration(name='greaterThan', in_type='integer', out_type='boolean', operator='>'), } def transform_comparison_level_expression(accumulators, expression): + accumulators.operator_set.add(INFIX_OPERATOR_TO_DECLARATION[expression.operator]) + # 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( @@ -154,139 +227,89 @@ def transform_comparison_level_expression(accumulators, expression): name='and', left=left, right=CFunctionCallForFurInfixOperator( - name=EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING[expression.operator], + name=INFIX_OPERATOR_TO_DECLARATION[expression.operator].name, left=middle, right=right, ), ) return CFunctionCallForFurInfixOperator( - name=EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING[expression.operator], + name=INFIX_OPERATOR_TO_DECLARATION[expression.operator].name, left=transform_expression(accumulators, expression.left), right=transform_expression(accumulators, expression.right), ) -BUILTINS = { - 'false': [], - 'pow': ['math.h'], - 'print': ['stdio.h'], - 'true': [], -} - -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', - } + accumulators.operator_set.add(INFIX_OPERATOR_TO_DECLARATION[expression.operator]) return CFunctionCallForFurInfixOperator( - name=INFIX_OPERATOR_TO_FUNCTION_NAME[expression.operator], + name=INFIX_OPERATOR_TO_DECLARATION[expression.operator].name, 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) +def transform_integer_literal_expression(accumulators, expression): + return CIntegerLiteral(value=expression.integer) - 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, - } - - if type(expression) in LITERAL_TYPE_MAPPING: - return LITERAL_TYPE_MAPPING[type(expression)](value=expression.value) +def transform_negation_expression(accumulators, expression): + return CNegationExpression( + value=transform_expression(accumulators, expression.internal_expression), + ) - # TODO Handle all possible types in this form +def transform_expression(accumulators, expression): + # TODO Clean up handlers for parsing expressions return { - parsing.FurInfixExpression: transform_infix_expression, # TODO Shouldn't need this + parsing.FurFunctionCallExpression: transform_function_call_expression, + parsing.FurInfixExpression: transform_infix_expression, + parsing.FurIntegerLiteralExpression: transform_integer_literal_expression, + parsing.FurNegationExpression: transform_negation_expression, + parsing.FurStringLiteralExpression: transform_string_literal_expression, normalization.NormalFunctionCallExpression: transform_function_call_expression, normalization.NormalInfixExpression: transform_infix_expression, + normalization.NormalIntegerLiteralExpression: transform_integer_literal_expression, normalization.NormalNegationExpression: transform_negation_expression, + normalization.NormalStringLiteralExpression: transform_string_literal_expression, + normalization.NormalSymbolExpression: transform_symbol_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: + try: + symbol_list_index = accumulators.symbol_list.index(assignment_statement.target) + except ValueError: + symbol_list_index = len(accumulators.symbol_list) accumulators.symbol_list.append(assignment_statement.target) return CSymbolAssignmentStatement( target=assignment_statement.target, - target_symbol_list_index=accumulators.symbol_list.index(assignment_statement.target), + target_symbol_list_index=symbol_list_index, expression=transform_expression( accumulators, assignment_statement.expression, ), ) -def transform_negation_expression(accumulators, expression): - return CNegationExpression( - value=transform_expression(accumulators, expression.internal_expression), - ) - 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), - ) - - raise Exception() + if isinstance(function_call.function, normalization.NormalSymbolExpression): + # TODO Move this check to transformation of symbol expressions so we can have builtins that aren't functions + if function_call.function.symbol in BUILTINS.keys(): + # TODO Check that the builtin is actually callable + accumulators.builtin_set.add(function_call.function.symbol) + + # TODO Use the symbol from SYMBOL LIST + return CFunctionCallExpression( + name=transform_expression(accumulators, function_call.function), + argument_count=function_call.argument_count, + argument_items=transform_expression(accumulators, function_call.argument_items), + ) def transform_expression_statement(accumulators, statement): - expression = { - parsing.FurFunctionCallExpression: transform_function_call_expression, - normalization.NormalFunctionCallExpression: transform_function_call_expression, - }[type(statement.expression)](accumulators, statement.expression) - return CExpressionStatement( - expression=expression, + expression=transform_expression(accumulators, statement.expression), ) def transform_if_else_statement(accumulators, statement): @@ -314,13 +337,28 @@ def transform_variable_reassignment_statement(accumulators, statement): 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)) + + # TODO Add argument names to the symbol table + accumulators.function_definition_list.append(CFunctionDefinition( + name=statement.name, + argument_name_list=statement.argument_name_list, + statement_list=tuple(transform_statement(accumulators, s) for s in statement.statement_list) + )) + + return CFunctionDeclaration(name=statement.name) + 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.NormalAssignmentStatement: transform_symbol_assignment_statement, normalization.NormalExpressionStatement: transform_expression_statement, + normalization.NormalFunctionDefinitionStatement: transform_function_definition_statement, normalization.NormalIfElseStatement: transform_if_else_statement, - normalization.NormalArrayVariableInitializationStatement: transform_array_variable_initialization_statement, normalization.NormalVariableInitializationStatement: transform_variable_initialization_statement, normalization.NormalVariableReassignmentStatement: transform_variable_reassignment_statement, }[type(statement)](accumulators, statement) @@ -330,6 +368,8 @@ Accumulators = collections.namedtuple( 'Accumulators', [ 'builtin_set', + 'function_definition_list', + 'operator_set', 'symbol_list', 'string_literal_list', ], @@ -338,6 +378,8 @@ Accumulators = collections.namedtuple( def transform(program): accumulators = Accumulators( builtin_set=set(), + function_definition_list=[], + operator_set=set(), symbol_list=[], string_literal_list=[], ) @@ -353,6 +395,8 @@ def transform(program): return CProgram( builtin_set=accumulators.builtin_set, + function_definition_list=accumulators.function_definition_list, + operator_declarations=tuple(sorted(accumulators.operator_set)), statements=statement_list, standard_libraries=standard_library_set, string_literal_list=accumulators.string_literal_list,