import collections
-import parsing
+import normalization
+import parsing # TODO Remove this import, as we should be normalizing everything before it gets here
CIntegerLiteral = collections.namedtuple(
'CIntegerLiteral',
CStringLiteral = collections.namedtuple(
'CStringLiteral',
[
+ 'index',
'value',
],
)
+CVariableExpression = collections.namedtuple(
+ 'CVariableExpression',
+ [
+ 'variable',
+ ],
+)
+
CSymbolExpression = collections.namedtuple(
'CSymbolExpression',
[
],
)
-CAdditionExpression = collections.namedtuple(
- 'CAdditionExpression',
+CFunctionCallForFurInfixOperator = collections.namedtuple(
+ 'CFunctionCallForFurInfixOperator',
[
+ 'name',
'left',
'right',
],
)
-CSubtractionExpression = collections.namedtuple(
- 'CSubtractionExpression',
+CFunctionCallExpression = collections.namedtuple(
+ 'CFunctionCallExpression',
[
- 'left',
- 'right',
+ 'function_expression',
+ 'argument_count',
+ 'argument_items',
],
)
-CMultiplicationExpression = collections.namedtuple(
- 'CMultiplicationExpression',
+# TODO We are currently not changing variables, just preventing them from being accessed.
+CSymbolAssignmentStatement = collections.namedtuple(
+ 'CSymbolAssignmentStatement',
[
- 'left',
- 'right',
+ 'target',
+ 'target_symbol_list_index',
+ 'expression',
],
)
-CIntegerDivisionExpression = collections.namedtuple(
- 'CIntegerDivisionExpression',
+CArrayVariableInitializationStatement = collections.namedtuple(
+ 'CArrayVariableInitializationStatement',
[
- 'left',
- 'right',
+ 'variable',
+ 'items',
],
)
-CModularDivisionExpression = collections.namedtuple(
- 'CModularDivisionExpression',
+CVariableInitializationStatement = collections.namedtuple(
+ 'CVariableInitializationStatement',
[
- 'left',
- 'right',
+ 'variable',
+ 'expression',
],
)
-CFunctionCallExpression = collections.namedtuple(
- 'CFunctionCallExpression',
+CVariableReassignmentStatement = collections.namedtuple(
+ 'CVariableReassignmentStatement',
[
- 'name',
- 'arguments',
+ 'variable',
+ 'expression',
],
)
-CAssignmentStatement = collections.namedtuple(
- 'CAssignmentStatement',
+CExpressionStatement = collections.namedtuple(
+ 'CExpressionStatement',
[
- 'target',
- 'target_symbol_list_index',
'expression',
],
)
+CIfElseStatement = collections.namedtuple(
+ 'CIfElseStatement',
+ [
+ 'condition_expression',
+ 'if_statement_list',
+ 'else_statement_list',
+ ],
+)
+
+CFunctionDeclaration = collections.namedtuple(
+ 'CFunctionDeclaration',
+ [
+ 'name',
+ ],
+)
+
+# TODO If a function definition doesn't end with an expression, we have issues currently because we try to return statement.
+# TODO Closures currently wrap entire defining environment, even symbols that are not used, which makes garbage collection ineffective.
+CFunctionDefinition = collections.namedtuple(
+ 'CFunctionDefinition',
+ [
+ 'name',
+ 'argument_name_list',
+ 'statement_list',
+ ],
+)
+
CProgram = collections.namedtuple(
'CProgram',
[
- 'builtins',
+ 'builtin_set',
+ 'function_definition_list',
+ 'operator_declarations',
'statements',
'standard_libraries',
+ 'string_literal_list',
'symbol_list',
],
)
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 BUILTINS:
+ accumulators.builtin_set.add(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_expression(builtin_dependencies, symbol_list, expression):
- if isinstance(expression, parsing.FurNegationExpression):
- return transform_negation_expression(builtin_dependencies, symbol_list, expression)
+def transform_comparison_level_expression(accumulators, expression):
+ accumulators.operator_set.add(INFIX_OPERATOR_TO_DECLARATION[expression.operator])
- if isinstance(expression, parsing.FurFunctionCallExpression):
- return transform_function_call_expression(builtin_dependencies, symbol_list, 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
- if isinstance(expression, parsing.FurSymbolExpression):
- if expression.value not in symbol_list:
- symbol_list.append(expression.value)
+ right = transform_expression(
+ accumulators,
+ expression.right,
+ )
- return CSymbolExpression(
- symbol=expression.value,
- symbol_list_index=symbol_list.index(expression.value),
+ # TODO Don't evaluate the middle expression twice
+ return CFunctionCallForFurInfixOperator(
+ name='and',
+ left=left,
+ right=CFunctionCallForFurInfixOperator(
+ name=INFIX_OPERATOR_TO_DECLARATION[expression.operator].name,
+ left=middle,
+ right=right,
+ ),
)
- 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,
- }
-
- return INFIX_TYPE_MAPPING[type(expression)](
- left=transform_expression(builtin_dependencies, symbol_list, expression.left),
- right=transform_expression(builtin_dependencies, symbol_list, expression.right),
+ return CFunctionCallForFurInfixOperator(
+ name=INFIX_OPERATOR_TO_DECLARATION[expression.operator].name,
+ left=transform_expression(accumulators, expression.left),
+ right=transform_expression(accumulators, expression.right),
)
-def transform_assignment_statement(builtin_dependencies, symbol_list, assignment_statement):
+def transform_infix_expression(accumulators, expression):
+ if expression.order == 'comparison_level':
+ return transform_comparison_level_expression(accumulators, expression)
+
+ accumulators.operator_set.add(INFIX_OPERATOR_TO_DECLARATION[expression.operator])
+
+ return CFunctionCallForFurInfixOperator(
+ name=INFIX_OPERATOR_TO_DECLARATION[expression.operator].name,
+ left=transform_expression(accumulators, expression.left),
+ right=transform_expression(accumulators, expression.right),
+ )
+
+def transform_integer_literal_expression(accumulators, expression):
+ return CIntegerLiteral(value=expression.integer)
+
+def transform_negation_expression(accumulators, expression):
+ return CNegationExpression(
+ value=transform_expression(accumulators, expression.internal_expression),
+ )
+
+def transform_expression(accumulators, expression):
+ # TODO Clean up handlers for parsing expressions
+ return {
+ 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 symbol_list:
- symbol_list.append(assignment_statement.target)
+ 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 CAssignmentStatement(
+ return CSymbolAssignmentStatement(
target=assignment_statement.target,
- target_symbol_list_index=symbol_list.index(assignment_statement.target),
+ target_symbol_list_index=symbol_list_index,
expression=transform_expression(
- builtin_dependencies,
- symbol_list,
+ accumulators,
assignment_statement.expression,
),
)
-def transform_negation_expression(builtin_dependencies, symbol_list, negation_expression):
- return CNegationExpression(
- value=transform_expression(builtin_dependencies, symbol_list, negation_expression.value),
+def transform_function_call_expression(accumulators, function_call):
+ # TODO Use the symbol from SYMBOL LIST
+ return CFunctionCallExpression(
+ function_expression=transform_expression(accumulators, function_call.function_expression),
+ argument_count=function_call.argument_count,
+ argument_items=transform_expression(accumulators, function_call.argument_items),
)
-def transform_function_call_expression(builtin_dependencies, symbol_list, function_call):
- if function_call.function.value in BUILTINS.keys():
- builtin_dependencies.add(function_call.function.value)
+def transform_expression_statement(accumulators, statement):
+ return CExpressionStatement(
+ expression=transform_expression(accumulators, statement.expression),
+ )
- return CFunctionCallExpression(
- name='builtin$' + function_call.function.value,
- arguments=tuple(
- transform_expression(builtin_dependencies, symbol_list, arg)
- for arg in function_call.arguments
- ),
- )
+def transform_if_else_statement(accumulators, statement):
+ return CIfElseStatement(
+ condition_expression=transform_expression(accumulators, statement.condition_expression),
+ if_statement_list=tuple(transform_statement(accumulators, s) for s in statement.if_statement_list),
+ else_statement_list=tuple(transform_statement(accumulators, s) for s in statement.else_statement_list),
+ )
- raise Exception()
+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_statement(builtin_dependencies, symbol_list, statement):
+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))
+
+ # 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_assignment_statement,
- parsing.FurFunctionCallExpression: transform_function_call_expression,
- }[type(statement)](builtin_dependencies, symbol_list, 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.NormalVariableInitializationStatement: transform_variable_initialization_statement,
+ normalization.NormalVariableReassignmentStatement: transform_variable_reassignment_statement,
+ }[type(statement)](accumulators, statement)
+
+
+Accumulators = collections.namedtuple(
+ 'Accumulators',
+ [
+ 'builtin_set',
+ 'function_definition_list',
+ 'operator_set',
+ 'symbol_list',
+ 'string_literal_list',
+ ],
+)
def transform(program):
- builtins = set()
- symbol_list = []
+ accumulators = Accumulators(
+ builtin_set=set(),
+ function_definition_list=[],
+ operator_set=set(),
+ symbol_list=[],
+ string_literal_list=[],
+ )
- c_statements = [
- transform_statement(builtins, symbol_list, 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:
+ # This prevents warnings about normalized variables being entire C statements
+ last_statement = statement_list[-1]
+ if isinstance(last_statement, normalization.NormalExpressionStatement) and isinstance(last_statement.expression, normalization.NormalVariableExpression):
+ del statement_list[-1]
+
+ 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,
- symbol_list=symbol_list,
+ 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,
+ symbol_list=accumulators.symbol_list,
)
projects / fur / blobdiff