//: Arithmetic primitives :(before "End Primitive Recipe Declarations") ADD, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "add", ADD); :(before "End Primitive Recipe Checks") case ADD: { // primary goal of these checks is to forbid address arithmetic for (long long int i = 0; i < SIZE(inst.ingredients); ++i) { if (!is_mu_number(inst.ingredients.at(i))) { raise_error << maybe(get(Recipe, r).name) << "'add' requires number ingredients, but got " << inst.ingredients.at(i).original_string << '\n' << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise_error << maybe(get(Recipe, r).name) << "'add' yields exactly one product in '" << inst.to_string() << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { raise_error << maybe(get(Recipe, r).name) << "'add' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); break; } break; } :(before "End Primitive Recipe Implementations") case ADD: { double result = 0; for (long long int i = 0; i < SIZE(ingredients); ++i) { result += ingredients.at(i).at(0); } products.resize(1); products.at(0).push_back(result); break; } :(scenario add_literal) recipe main [ 1:number <- add 23, 34 ] +mem: storing 57 in location 1 :(scenario add) recipe main [ 1:number <- copy 23 2:number <- copy 34 3:number <- add 1:number, 2:number ] +mem: storing 57 in location 3 :(scenario add_multiple) recipe main [ 1:number <- add 3, 4, 5 ] +mem: storing 12 in location 1 :(scenario add_checks_type) % Hide_errors = true; recipe main [ 1:number <- add 2:boolean, 1 ] +error: main: 'add' requires number ingredients, but got 2:boolean :(scenario add_checks_return_type) % Hide_errors = true; recipe main [ 1:address:number <- add 2, 2 ] +error: main: 'add' should yield a number, but got 1:address:number :(before "End Primitive Recipe Declarations") SUBTRACT, :(before "End Primitive Recipe Numbers") put(Recipe_ordinal, "subtract", SUBTRACT); :(before "End Primitive Recipe Checks") case SUBTRACT: { if (inst.ingredients.empty()) { raise_error << maybe(get(Recipe, r).name) << "'subtract' has no ingredients\n" << end(); break; } for (long long int i = 0; i < SIZE(inst.ingredients); ++i) { if (is_raw(inst.ingredients.at(i))) continue; // permit address offset computations in tests if (!is_mu_number(inst.ingredients.at(i))) { raise_error << maybe(get(Recipe, r).name) << "'subtract' requires number ingredients, but got " << inst.ingredients.at(i).original_string << '\n' << end(); goto finish_checking_instruction; } } if (SIZE(inst.products) > 1) { raise_error << maybe(get(Recipe, r).name) << "'subtract' yields exactly one product in '" << inst.to_string() << "'\n" << end(); break; } if (!inst.products.empty() && !is_dummy(inst.products.at(0)) && !is_mu_number(inst.products.at(0))) { raise_error << maybe(get(Recipe, r).name) << "'subtract' should yield a number, but got " << inst.products.at(0).original_string << '\n' << end(); break; } break; } :(before "End Primitive Recipe Implementations") case SUBTRACT: { dou

#!/usr/bin/python3
"""Run all the tests inside the test/ directory as a test suite."""
if __name__ == '__main__':
	import unittest
	from test import *

	tests = []
	for key, val in vars().copy().items():
		if key.startswith('tc_'):
			tests.extend(v for