-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathtestKEY.out
234 lines (234 loc) · 3.19 KB
/
testKEY.out
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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
0 const
1 m = 7, n = 85;
1 var
1 i,x,y,z,q,r;
1 procedure multiply;
1 var
2 a,b;
2 begin
3 a := x; b := y; z := 0;
9 while b > 0 do
13 begin
13 if odd(b) then z := z+a;
20 a := 2*a; b := b/2;
28 end
28 end;
2 int 0 5
3 lod 1 4
4 sto 0 3
5 lod 1 5
6 sto 0 4
7 lit 0 0
8 sto 1 6
9 lod 0 4
10 lit 0 0
11 opr 0 12
12 jpc 0 29
13 lod 0 4
14 opr 0 6
15 jpc 0 20
16 lod 1 6
17 lod 0 3
18 opr 0 2
19 sto 1 6
20 lit 0 2
21 lod 0 3
22 opr 0 4
23 sto 0 3
24 lod 0 4
25 lit 0 2
26 opr 0 5
27 sto 0 4
28 jmp 0 9
29 ret 0 0
30
30 procedure divide;
30 var w;
31 begin
32 r := x; q := 0; w := y;
38 while w <= r do w := 2*w;
47 while w > y do
51 begin q := 2*q; w := w/2;
59 if w <= r then
62 begin
63 r := r-w; q := q+1;
71 end
71 end
71 end;
31 int 0 4
32 lod 1 4
33 sto 1 8
34 lit 0 0
35 sto 1 7
36 lod 1 5
37 sto 0 3
38 lod 0 3
39 lod 1 8
40 opr 0 13
41 jpc 0 47
42 lit 0 2
43 lod 0 3
44 opr 0 4
45 sto 0 3
46 jmp 0 38
47 lod 0 3
48 lod 1 5
49 opr 0 12
50 jpc 0 72
51 lit 0 2
52 lod 1 7
53 opr 0 4
54 sto 1 7
55 lod 0 3
56 lit 0 2
57 opr 0 5
58 sto 0 3
59 lod 0 3
60 lod 1 8
61 opr 0 13
62 jpc 0 71
63 lod 1 8
64 lod 0 3
65 opr 0 3
66 sto 1 8
67 lod 1 7
68 lit 0 1
69 opr 0 2
70 sto 1 7
71 jmp 0 47
72 ret 0 0
73
73 procedure gcd;
73 var
74 f,g;
74 begin
75 f := x; g := y;
79 while f # g do
83 begin if f<g then g := g-f;
91 if g<f then f := f-g;
99 end;
100 z := f;
102 end;
74 int 0 5
75 lod 1 4
76 sto 0 3
77 lod 1 5
78 sto 0 4
79 lod 0 3
80 lod 0 4
81 opr 0 9
82 jpc 0 100
83 lod 0 3
84 lod 0 4
85 opr 0 10
86 jpc 0 91
87 lod 0 4
88 lod 0 3
89 opr 0 3
90 sto 0 4
91 lod 0 4
92 lod 0 3
93 opr 0 10
94 jpc 0 99
95 lod 0 3
96 lod 0 4
97 opr 0 3
98 sto 0 3
99 jmp 0 79
100 lod 0 3
101 sto 1 6
102 ret 0 0
103
103 begin
104 i:=1;
106 while i#0 do
110 begin
110 x := m; y := n; call multiply;
115 x := 25; y := 3; call divide;
120 x := 84; y := 36; call gcd;
125 i:=i-1;
129 end;
130 end.
103 int 0 9
104 lit 0 1
105 sto 0 3
106 lod 0 3
107 lit 0 0
108 opr 0 9
109 jpc 0 130
110 lit 0 7
111 sto 0 4
112 lit 0 85
113 sto 0 5
114 cal 0 2
115 lit 0 25
116 sto 0 4
117 lit 0 3
118 sto 0 5
119 cal 0 31
120 lit 0 84
121 sto 0 4
122 lit 0 36
123 sto 0 5
124 cal 0 74
125 lod 0 3
126 lit 0 1
127 opr 0 3
128 sto 0 3
129 jmp 0 106
130 ret 0 0
Start PL/0
1
7
85
7
85
0
7
14
42
28
21
35
56
10
112
5
147
224
2
448
1
595
896
0
25
3
25
0
3
6
12
24
48
0
24
1
1
2
12
4
6
8
3
84
36
84
36
48
12
24
12
12
0
End PL/0