import collections
+import normalization
import parsing
CIntegerLiteral = collections.namedtuple(
],
)
+CVariableExpression = collections.namedtuple(
+ 'CVariableExpression',
+ [
+ 'variable',
+ ],
+)
+
CSymbolExpression = collections.namedtuple(
'CSymbolExpression',
[
],
)
-CAssignmentStatement = collections.namedtuple(
- 'CAssignmentStatement',
+CSymbolAssignmentStatement = collections.namedtuple(
+ 'CSymbolAssignmentStatement',
[
'target',
'target_symbol_list_index',
],
)
+CVariableInitializationStatement = collections.namedtuple(
+ 'CVariableInitializationStatement',
+ [
+ 'variable',
+ 'expression',
+ ],
+)
+
+CExpressionStatement = collections.namedtuple(
+ 'CExpressionStatement',
+ [
+ 'expression',
+ ],
+)
+
CProgram = collections.namedtuple(
'CProgram',
[
'>': 'greaterThan',
}
-def transform_equality_level_expression(accumulators, expression):
+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 == 'equality_level':
- left = transform_equality_level_expression(
+ if isinstance(expression.left, parsing.FurInfixExpression) and expression.left.order == 'comparison_level':
+ left = transform_comparison_level_expression(
accumulators,
expression.left
)
'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',
+ }
+
+ 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
if type(expression) in LITERAL_TYPE_MAPPING:
return LITERAL_TYPE_MAPPING[type(expression)](value=expression.value)
- if isinstance(expression, parsing.FurInfixExpression):
- if expression.order == 'equality_level':
- return transform_equality_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),
- )
-
- raise Exception('Could not transform expression "{}"'.format(expression))
+ # 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.NormalVariableExpression: transform_variable_expression,
+ }[type(expression)](accumulators, expression)
-def transform_assignment_statement(accumulators, assignment_statement):
+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 CAssignmentStatement(
+ return CSymbolAssignmentStatement(
target=assignment_statement.target,
target_symbol_list_index=accumulators.symbol_list.index(assignment_statement.target),
expression=transform_expression(
)
def transform_function_call_expression(accumulators, function_call):
+ # TODO Function should be a full expression
if function_call.function.value in BUILTINS.keys():
# TODO Check that the builtin is actually callable
accumulators.builtin_set.add(function_call.function.value)
raise Exception()
+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,
+ )
+
+def transform_variable_initialization_statement(accumulators, statement):
+ return CVariableInitializationStatement(
+ variable=statement.variable,
+ expression=transform_expression(accumulators, statement.expression),
+ )
+
def transform_statement(accumulators, statement):
return {
- parsing.FurAssignmentStatement: transform_assignment_statement,
- parsing.FurFunctionCallExpression: transform_function_call_expression,
+ parsing.FurAssignmentStatement: transform_symbol_assignment_statement,
+ parsing.FurExpressionStatement: transform_expression_statement,
+ normalization.NormalVariableInitializationStatement: transform_variable_initialization_statement,
+ normalization.NormalExpressionStatement: transform_expression_statement,
}[type(statement)](accumulators, statement)
string_literal_list=[],
)
- c_statements = [
+ statement_list = [
transform_statement(accumulators, statement) for statement in program.statement_list
]
- standard_libraries = set()
+ 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(
builtin_set=accumulators.builtin_set,
- statements=c_statements,
- standard_libraries=standard_libraries,
+ statements=statement_list,
+ standard_libraries=standard_library_set,
string_literal_list=accumulators.string_literal_list,
symbol_list=accumulators.symbol_list,
)