6 CIntegerLiteral = collections.namedtuple(
13 CStringLiteral = collections.namedtuple(
21 CConstantExpression = collections.namedtuple(
22 'CConstantExpression',
28 CVariableExpression = collections.namedtuple(
29 'CVariableExpression',
35 CSymbolExpression = collections.namedtuple(
43 CNegationExpression = collections.namedtuple(
44 'CNegationExpression',
50 CFunctionCallForFurInfixOperator = collections.namedtuple(
51 'CFunctionCallForFurInfixOperator',
59 CFunctionCallExpression = collections.namedtuple(
60 'CFunctionCallExpression',
68 CSymbolAssignmentStatement = collections.namedtuple(
69 'CSymbolAssignmentStatement',
72 'target_symbol_list_index',
77 CArrayVariableInitializationStatement = collections.namedtuple(
78 'CArrayVariableInitializationStatement',
85 CVariableInitializationStatement = collections.namedtuple(
86 'CVariableInitializationStatement',
93 CVariableReassignmentStatement = collections.namedtuple(
94 'CVariableReassignmentStatement',
101 CExpressionStatement = collections.namedtuple(
102 'CExpressionStatement',
108 CIfElseStatement = collections.namedtuple(
111 'condition_expression',
117 CFunctionDeclaration = collections.namedtuple(
118 'CFunctionDeclaration',
124 CFunctionDefinition = collections.namedtuple(
125 'CFunctionDefinition',
132 CProgram = collections.namedtuple(
136 'function_definition_list',
138 'standard_libraries',
139 'string_literal_list',
144 EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING = {
147 '<=': 'lessThanOrEqual',
148 '>=': 'greaterThanOrEqual',
153 def transform_comparison_level_expression(accumulators, expression):
154 # Transform expressions like 1 < 2 < 3 into expressions like 1 < 2 && 2 < 3
155 if isinstance(expression.left, parsing.FurInfixExpression) and expression.left.order == 'comparison_level':
156 left = transform_comparison_level_expression(
163 right = transform_expression(
168 # TODO Don't evaluate the middle expression twice
169 return CFunctionCallForFurInfixOperator(
172 right=CFunctionCallForFurInfixOperator(
173 name=EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING[expression.operator],
179 return CFunctionCallForFurInfixOperator(
180 name=EQUALITY_LEVEL_OPERATOR_TO_FUNCTION_NAME_MAPPING[expression.operator],
181 left=transform_expression(accumulators, expression.left),
182 right=transform_expression(accumulators, expression.right),
188 'print': ['stdio.h'],
192 def transform_variable_expression(accumulators, expression):
193 return CVariableExpression(variable=expression.variable)
195 def transform_infix_expression(accumulators, expression):
196 if expression.order == 'comparison_level':
197 return transform_comparison_level_expression(accumulators, expression)
199 INFIX_OPERATOR_TO_FUNCTION_NAME = {
203 '//': 'integerDivide',
204 '%': 'modularDivide',
209 return CFunctionCallForFurInfixOperator(
210 name=INFIX_OPERATOR_TO_FUNCTION_NAME[expression.operator],
211 left=transform_expression(accumulators, expression.left),
212 right=transform_expression(accumulators, expression.right),
215 def transform_expression(accumulators, expression):
216 if isinstance(expression, parsing.FurParenthesizedExpression):
217 # Parentheses can be removed because everything in the C output is explicitly parenthesized
218 return transform_expression(accumulators, expression.internal)
220 if isinstance(expression, parsing.FurNegationExpression):
221 return transform_negation_expression(accumulators, expression)
223 if isinstance(expression, parsing.FurFunctionCallExpression):
224 return transform_function_call_expression(accumulators, expression)
226 if isinstance(expression, parsing.FurSymbolExpression):
227 if expression.value in ['true', 'false']:
228 return CConstantExpression(value=expression.value)
230 if expression.value not in accumulators.symbol_list:
231 symbol_list.append(expression.value)
233 return CSymbolExpression(
234 symbol=expression.value,
235 symbol_list_index=accumulators.symbol_list.index(expression.value),
238 if isinstance(expression, parsing.FurStringLiteralExpression):
239 value = expression.value
242 index = accumulators.string_literal_list.index(value)
244 index = len(accumulators.string_literal_list)
245 accumulators.string_literal_list.append(value)
247 return CStringLiteral(index=index, value=value)
249 LITERAL_TYPE_MAPPING = {
250 parsing.FurIntegerLiteralExpression: CIntegerLiteral,
253 if type(expression) in LITERAL_TYPE_MAPPING:
254 return LITERAL_TYPE_MAPPING[type(expression)](value=expression.value)
256 # TODO Handle all possible types in this form
258 parsing.FurInfixExpression: transform_infix_expression, # TODO Shouldn't need this
259 normalization.NormalFunctionCallExpression: transform_function_call_expression,
260 normalization.NormalInfixExpression: transform_infix_expression,
261 normalization.NormalNegationExpression: transform_negation_expression,
262 normalization.NormalVariableExpression: transform_variable_expression,
263 }[type(expression)](accumulators, expression)
265 def transform_symbol_assignment_statement(accumulators, assignment_statement):
266 # TODO Check that target is not a builtin
267 if assignment_statement.target not in accumulators.symbol_list:
268 accumulators.symbol_list.append(assignment_statement.target)
270 return CSymbolAssignmentStatement(
271 target=assignment_statement.target,
272 target_symbol_list_index=accumulators.symbol_list.index(assignment_statement.target),
273 expression=transform_expression(
275 assignment_statement.expression,
279 def transform_negation_expression(accumulators, expression):
280 return CNegationExpression(
281 value=transform_expression(accumulators, expression.internal_expression),
284 def transform_function_call_expression(accumulators, function_call):
285 if function_call.function.value in BUILTINS.keys():
286 # TODO Check that the builtin is actually callable
287 accumulators.builtin_set.add(function_call.function.value)
289 # TODO Use the symbol from SYMBOL LIST
290 return CFunctionCallExpression(
291 name=function_call.function.value,
292 argument_count=function_call.argument_count,
293 argument_items=transform_expression(accumulators, function_call.argument_items),
296 def transform_expression_statement(accumulators, statement):
297 # TODO At some point we can verify that all expression types are supported and just call transform_expression
299 parsing.FurFunctionCallExpression: transform_function_call_expression,
300 parsing.FurInfixExpression: transform_expression,
301 parsing.FurIntegerLiteralExpression: transform_expression,
302 parsing.FurSymbolExpression: transform_expression,
303 normalization.NormalFunctionCallExpression: transform_function_call_expression,
304 normalization.NormalVariableExpression: transform_expression,
305 }[type(statement.expression)](accumulators, statement.expression)
307 return CExpressionStatement(
308 expression=expression,
311 def transform_if_else_statement(accumulators, statement):
312 return CIfElseStatement(
313 condition_expression=transform_expression(accumulators, statement.condition_expression),
314 if_statements=tuple(transform_statement(accumulators, s) for s in statement.if_statements),
315 else_statements=tuple(transform_statement(accumulators, s) for s in statement.else_statements),
318 def transform_array_variable_initialization_statement(accumulators, statement):
319 return CArrayVariableInitializationStatement(
320 variable=statement.variable,
321 items=tuple(transform_expression(accumulators, i) for i in statement.items),
324 def transform_variable_initialization_statement(accumulators, statement):
325 return CVariableInitializationStatement(
326 variable=statement.variable,
327 expression=transform_expression(accumulators, statement.expression),
330 def transform_variable_reassignment_statement(accumulators, statement):
331 return CVariableReassignmentStatement(
332 variable=statement.variable,
333 expression=transform_expression(accumulators, statement.expression),
336 def transform_function_definition_statement(accumulators, statement):
337 # TODO Allow defining the same function in different contexts
338 if any(fd.name == statement.name for fd in accumulators.function_definition_list):
339 raise Exception('A function with name "{}" already exists'.format(statement.name))
341 accumulators.function_definition_list.append(CFunctionDefinition(
343 statement_list=tuple(transform_statement(accumulators, s) for s in statement.statement_list)
346 return CFunctionDeclaration(name=statement.name)
348 def transform_statement(accumulators, statement):
350 parsing.FurAssignmentStatement: transform_symbol_assignment_statement,
351 parsing.FurExpressionStatement: transform_expression_statement,
352 normalization.NormalArrayVariableInitializationStatement: transform_array_variable_initialization_statement,
353 normalization.NormalExpressionStatement: transform_expression_statement,
354 normalization.NormalFunctionDefinitionStatement: transform_function_definition_statement,
355 normalization.NormalIfElseStatement: transform_if_else_statement,
356 normalization.NormalVariableInitializationStatement: transform_variable_initialization_statement,
357 normalization.NormalVariableReassignmentStatement: transform_variable_reassignment_statement,
358 }[type(statement)](accumulators, statement)
361 Accumulators = collections.namedtuple(
365 'function_definition_list',
367 'string_literal_list',
371 def transform(program):
372 accumulators = Accumulators(
374 function_definition_list=[],
376 string_literal_list=[],
380 transform_statement(accumulators, statement) for statement in program.statement_list
383 standard_library_set = set()
384 for builtin in accumulators.builtin_set:
385 for standard_library in BUILTINS[builtin]:
386 standard_library_set.add(standard_library)
389 builtin_set=accumulators.builtin_set,
390 function_definition_list=accumulators.function_definition_list,
391 statements=statement_list,
392 standard_libraries=standard_library_set,
393 string_literal_list=accumulators.string_literal_list,
394 symbol_list=accumulators.symbol_list,
398 if __name__ == '__main__':