GoStack/executor.go at main · Pacsfury/GoStack · GitHub

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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
package main

import "fmt"

func execute(op int) {
	switch op {
	case PUSH:
		stack = append(stack, program[pc+1])
		pc += 1
	case ADD:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		stack = stack[:len(stack)-2]
		stack = append(stack, a+b)
	case SUB:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		stack = stack[:len(stack)-2]
		stack = append(stack, a-b)
	case MUL:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		stack = stack[:len(stack)-2]
		stack = append(stack, a*b)
	case DIV:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		if b == 0 {
			return
		}
		stack = stack[:len(stack)-2]
		stack = append(stack, a/b)
	case OUT:
		fmt.Println(stack)
	case JMP:
		pc = program[pc+1]
	case JNZ:
		condition := stack[len(stack)-1]
		stack = stack[:len(stack)-1]
		if condition != 0 {
			pc = program[pc+1] - 1
		} else {
			pc += 1
		}

	case JIZ:
		condition := stack[len(stack)-1]
		stack = stack[:len(stack)-1]
		if condition == 0 {
			pc = program[pc+1] - 1
		} else {
			pc += 1
		}

	case POP:
		stack = stack[:len(stack)-1]
	case DUP:
		stack = append(stack, stack[len(stack)-1])
	case COUT:
		fmt.Print(string(rune(stack[len(stack)-1])))
	case EQ:
		var result int = 0
		if stack[len(stack)-1] == stack[len(stack)-2] {
			result = 1
		} else {
			result = 0
		}
		stack = stack[:len(stack)-1]
		stack = stack[:len(stack)-1]
		stack = append(stack, result)
	case NEQ:
		var result int = 1
		if stack[len(stack)-1] == stack[len(stack)-2] {
			result = 0
		} else {
			result = 1
		}
		stack = stack[:len(stack)-1]
		stack = stack[:len(stack)-1]
		stack = append(stack, result)
	case LT:
		var result int = 1
		if stack[len(stack)-1] < stack[len(stack)-2] {
			result = 0
		} else {
			result = 1
		}
		stack = stack[:len(stack)-1]
		stack = stack[:len(stack)-1]
		stack = append(stack, result)
	case GT:
		var result int = 1
		if stack[len(stack)-1] > stack[len(stack)-2] {
			result = 0
		} else {
			result = 1
		}
		stack = stack[:len(stack)-1]
		stack = stack[:len(stack)-1]
		stack = append(stack, result)
	case LTE:
		var result int = 1
		if stack[len(stack)-1] <= stack[len(stack)-2] {
			result = 0
		} else {
			result = 1
		}
		stack = stack[:len(stack)-1]
		stack = stack[:len(stack)-1]
		stack = append(stack, result)
	case GTE:
		var result int = 1
		if stack[len(stack)-1] >= stack[len(stack)-2] {
			result = 0
		} else {
			result = 1
		}
		stack = stack[:len(stack)-1]
		stack = stack[:len(stack)-1]
		stack = append(stack, result)
	case AND:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		stack = stack[:len(stack)-2]
		stack = append(stack, a&b)
	case OR:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		stack = stack[:len(stack)-2]
		stack = append(stack, a|b)
	case XOR:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		stack = stack[:len(stack)-2]
		stack = append(stack, a^b)
	case NOT:
		if len(stack) < 1 {
			return
		}
		a := stack[len(stack)-1]
		stack = stack[:len(stack)-1]
		stack = append(stack, ^a)
	case SHL:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		stack = stack[:len(stack)-2]
		stack = append(stack, a<<b)
	case SHR:
		if len(stack) < 2 {
			return
		}
		a := stack[len(stack)-1]
		b := stack[len(stack)-2]
		stack = stack[:len(stack)-2]
		stack = append(stack, a>>b)
	}
}