+ return referenced_entry_list, instruction_list
+
+def escape_name(name):
+ return name.replace('$','$$').replace('_','$')
+
+def generate_lambda_expression(counters, expression):
+ if expression.name is None:
+ name = '__lambda__'
+ else:
+ name = escape_name(expression.name)
+
+ name_counter = counters.get(name, 0)
+ counters[expression.name] = name_counter + 1
+ label = '{}${}'.format(name, name_counter)
+
+ referenced_entry_list_list = []
+ instruction_list_list = []
+
+ for statement in expression.statement_list:
+ referenced_entry_list, instruction_list = generate_statement(counters, statement)
+ referenced_entry_list_list.append(referenced_entry_list)
+ instruction_list_list.append(instruction_list)
+
+ # Pop from the stack in reversed order, because arguments were pushed onto
+ # the stack in order
+ argument_bindings = tuple(
+ CIRInstruction(instruction='pop', argument='sym({})'.format(arg))
+ for arg in reversed(expression.argument_name_list)
+ )
+
+ lambda_body = flatten(instruction_list_list)
+ assert lambda_body[-1].instruction == 'drop'
+ lambda_body = argument_bindings + lambda_body[:-1] + (CIRInstruction(instruction='return', argument=None),)
+
+ referenced_entry_list_list.append(
+ (CIRLabel(label=label),) + lambda_body,
+ )
+
+ instruction_list = (
+ CIRInstruction(instruction='close', argument=label),
+ )
+
+ return flatten(referenced_entry_list_list), instruction_list
+
+def generate_list_construct_expression(counters, expression):
+ referenced_entry_list = ()
+ instruction_list = (CIRInstruction(
+ instruction='list',
+ argument=2,
+ ),)
+ return referenced_entry_list, instruction_list
+
+def generate_string_literal_expression(counters, expression):
+ referenced_entry_list = ()
+ instruction_list = (CIRInstruction(
+ instruction='push_string',