aboutsummaryrefslogtreecommitdiff
path: root/source/primitives/core.d
blob: ce3eee2097c67527e3b99948ccfffca5ff8a4ef7 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
module primitives.core;

import std.stdio;
import std.variant;

import state.stack;

bool handle(Token token) {
	return token.visit!(
		(int        ) => false,
		(bool       ) => false,
		(string word) => handle(word)
	);
}

private {

bool handle(string word) {
	switch ( word ) {
		case     "+"     : binary_op_add;                break;
		case     "*"     : binary_op_multiply;           break;
		case     "/"     : binary_op_divide;             break;
		case     "%"     : binary_op_modulo;             break;
		case     "."     : unary_op_io_print;            break;
		case     "pop"   : unary_op_stack_pop;           break;
		case     "dup"   : unary_op_stack_dup;           break;
		case     "swp"   : binary_op_stack_swp;          break;
		case     "over"  : binary_op_stack_over;         break;
		case     "rot"   : ternary_op_stack_rot;         break;
		case     "true"  : nullary_op_value_bool(true);  break;
		case     "false" : nullary_op_value_bool(false); break;
		case     "<"     : binary_cond_lt;               break;
		case     "="     : binary_cond_eq;               break;
		default          : return false;
	}

	return true;
}

void binary_op_add() {
	int b = stack.pop.get!int;
	int a = stack.pop.get!int;

	stack.push(a + b);
}

void binary_op_multiply() {
	int b = stack.pop.get!int;
	int a = stack.pop.get!int;

	stack.push(a * b);
}

void binary_op_divide() {
	int b = stack.pop.get!int;
	int a = stack.pop.get!int;

	if ( b == 0 ) {
		throw new Exception("division by 0 undefined");
	} else {
		stack.push(a / b);
	}
}

void binary_op_modulo() {
	int b = stack.pop.get!int;
	int a = stack.pop.get!int;

	if ( b == 0 ) {
		throw new Exception("modulo 0 undefined");
	} else {
		stack.push(a % b);
	}
}

void unary_op_io_print() {
	writeln(stack.top);
}

void unary_op_stack_pop() {
	stack.pop;
}

void unary_op_stack_dup() {
	stack.push(stack.top);
}

void binary_op_stack_swp() {
	auto b = stack.pop;
	auto a = stack.pop;

	stack.push(b);
	stack.push(a);
}

void binary_op_stack_over() {
	auto b = stack.pop;
	auto a = stack.pop;

	stack.push(a);
	stack.push(b);
	stack.push(a);
}

void ternary_op_stack_rot() {
	auto c = stack.pop;
	auto b = stack.pop;
	auto a = stack.pop;

	stack.push(b);
	stack.push(c);
	stack.push(a);
}

void nullary_op_value_bool(bool value) {
	stack.push(Token(value));
}

void binary_cond_lt() {
	int b = stack.pop.get!int;
	int a = stack.pop.get!int;

	stack.push(a < b);
}

void binary_cond_eq() {
	auto b = stack.pop;
	auto a = stack.pop;

	stack.push(a == b);
}

}