-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathturing_machine_main.cpp
More file actions
495 lines (434 loc) · 13.5 KB
/
Copy pathturing_machine_main.cpp
File metadata and controls
495 lines (434 loc) · 13.5 KB
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
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
// turing_test.cpp : Definiert den Einstiegspunkt für die Konsolenanwendung.
// C 2016 Marcel Ochsendorf
//Github: RBEGamer
/*
Turing Coding Challange
RULES (inspirated by github/wridgers)
->singlefile
->determanistic 1 tape machine
->alphabet -> -1=blank, 0-int normal chars
->states 0-int
STATE DESC
->see sample program below for syntax
*/
#include <iostream>
#include <string.h>
//DEFINITIONS
struct STATE_DESC;
struct STATE_RULE;
struct TAPE_DESC;
//STATE CONTROL DESC
enum STATE_CONTROL
{
NORMAL = 0,START = 1, END = 2
};
//STATE RULE DESC
struct STATE_RULE
{
STATE_CONTROL rule_type;
int switch_on_char; // id char on tape pos, -1 blank, 0,1,....
int move_tape_dir; //0 no movement, -1 left, 1 right -> rule type = H
int write_new_char; //writes the new char to the cell
int new_state_id;
STATE_DESC* parent_state_desc;
//simple debug function
void print_step(){
std::cout << "ON:" << switch_on_char << "->" << write_new_char << ",MOVE:" << move_tape_dir << " GOTO:"<< new_state_id << std::endl;
}
};
//STATE SET DESC
struct STATE_DESC
{
int state_id;
STATE_RULE* state_rules;
unsigned int state_rules_count;
//CLEANUP
~STATE_DESC() {
delete state_rules;
state_rules = NULL;
state_rules_count = 0;
}
};
//TAPE DESC
struct TAPE_DESC
{
unsigned int tape_size;
int* tape_cells;
unsigned int current_head_position;
unsigned int max_reached_tape_position;
void create_tape() {
if (tape_size == 0) {
tape_size = 128;
}
current_head_position = 0;
tape_cells = new int[tape_size];
if (tape_cells == nullptr) { throw; }
for (size_t i = 0; i < tape_size; i++)
{
tape_cells[i] = -1; //BLANK
}
max_reached_tape_position = 1;
}
~TAPE_DESC() {
delete tape_cells;
tape_cells = NULL;
}
void move_tape(int _move_by) {
current_head_position += _move_by;
if (current_head_position < 0) {
current_head_position = 0;
throw;
}
else if (current_head_position > tape_size - 1) {
current_head_position = tape_size - 1;
throw;
}
if (max_reached_tape_position < current_head_position) {
max_reached_tape_position = current_head_position;
}
}
void print_tape() {
for (size_t i = 0; i < max_reached_tape_position+1 ; i++)
{
if (max_reached_tape_position + 1 > tape_size) {
break;
}
if (tape_cells[i] == -1) {
std::cout << "#";
}
else {
std::cout << tape_cells[i];
}
}
std::cout << std::endl;
}
};
//VARIABLES
STATE_DESC* states;
TAPE_DESC tape;
/*
PROGRAM : ADD ONE TO BINARY
syntax:
tape_size,<size of tape> //size of tape
start_head_pos,<start of the rw head> //start pos of the head
start_rule,<rule set id>
tape_conf,<char -1=blank >= 0 alphabet>,<tape_pos>,<tape_pos>,...
rule_set,<rule_set_id>,<char to react>,<new char>,<tape movedir (-1,0,1),<rule_type 0=normal 1=start 2=end>,<next rule_set id>
*/
const char* turing_add_one_program = "tape_size,32\n"
"start_head_pos,3\n"
"start_rule,0\n"
"tape_conf,1,1,2,3\n" //zelle 1,2,3 auf 1 setzten//RULESET 1 df
"rule_set,0,0,1,-1,1,1\n" //<- START RULE
"rule_set,0,1,0,-1,0,0\n"
"rule_set,0,-1,1,0,2,-1\n"//RULESET 2
"rule_set,1,0,0,-1,0,1\n"
"rule_set,1,1,1,-1,0,1\n"
"rule_set,1,-1,-1,1,2,0\n";//eig kommt noch ein zweites aber durch die 2 wird direkt abgebrochen
int main()
{
//PARSE TEXT INPUT
if (turing_add_one_program == nullptr) {
throw;
}
const char* start_needle = NULL;
const char* end_needle = NULL;
//READ TAPE SIZE
int read_tape_size = 1024;
start_needle = strstr(turing_add_one_program, "tape_size,");
if (start_needle == nullptr) {
read_tape_size = 1024;
}
else {
start_needle += strlen("tape_size,");
end_needle = strstr(start_needle, "\n");
std::string tape_size = "";
tape_size.append(start_needle, end_needle);
read_tape_size = atoi(tape_size.c_str());
}
//READ START HEAD POS
start_needle = NULL;
end_needle = NULL;
int read_start_head_pos = 0;
start_needle = strstr(turing_add_one_program, "start_head_pos,");
if (start_needle == nullptr) {
read_start_head_pos = 0;
}
else {
start_needle += strlen("start_head_pos,");
end_needle = strstr(start_needle, "\n");
std::string start_head_pos = "";
start_head_pos.append(start_needle, end_needle);
read_start_head_pos = atoi(start_head_pos.c_str());
}
//READ START RULE
start_needle = NULL;
end_needle = NULL;
int read_start_rule = -1;
start_needle = strstr(turing_add_one_program, "start_rule,");
if (start_needle == nullptr) {
read_start_rule = -1;
}
else {
start_needle += strlen("start_rule,");
end_needle = strstr(start_needle, "\n");
std::string start_rule = "";
start_rule.append(start_needle, end_needle);
read_start_rule = atoi(start_rule.c_str());
}
//PARSE tape_conf
//BUT FIRST WE NEE TO SETUP THE TAPE SO WE DONT NEED A LIST OR ARRAY
tape.tape_size = read_tape_size; //TAPE SIZE
tape.create_tape();
tape.current_head_position = read_start_head_pos;
//for print
if (tape.current_head_position + 1 > tape.max_reached_tape_position) {
tape.max_reached_tape_position = tape.current_head_position + 1;
}
//GET A TAPE CONF LINE
start_needle = strstr(turing_add_one_program, "tape_conf,");
const char* start_needle_file = start_needle;
const char* end_needle_line = strstr(start_needle, "\n");
std::string tpcong_line = "";
tpcong_line.append(start_needle, end_needle_line);
start_needle = strstr(tpcong_line.c_str(), "tape_conf,");
end_needle = NULL;
bool was_char_pos = false;
std::string tmp_string = "";
int* selected_char = NULL;
while (start_needle_file != nullptr)
{
if (!was_char_pos) {
start_needle += strlen("tape_conf,");
was_char_pos = true;
end_needle = strstr(start_needle, ",");
tmp_string = "";
tmp_string.append(start_needle, end_needle);
selected_char = new int();
*selected_char = atoi(tmp_string.c_str()); //damit wir auf 0 prüfen können ob ein valides char drin ist
start_needle += tmp_string.size() + strlen(",");
//std::cout << *selected_char << std::endl;
}
else if(was_char_pos && selected_char != nullptr){
if (start_needle == nullptr || strcmp(start_needle, "\n") == 0) {
//GET NEXT LINE IN FILE
start_needle = strstr(end_needle_line, "tape_conf,");
if (start_needle == nullptr) { break; }
end_needle_line = strstr(start_needle, "\n");
tpcong_line = "";
tpcong_line.append(start_needle, end_needle_line);
start_needle = strstr(tpcong_line.c_str(), "tape_conf,");
was_char_pos = false;
tmp_string = "";
selected_char = NULL;
end_needle = NULL;
continue;
}
else {
tmp_string = "";
end_needle = strstr(start_needle, ",");
if (end_needle == nullptr) {
tmp_string.append(start_needle);
tape.tape_cells[atoi(tmp_string.c_str())] = *selected_char; //SET CHAR ON TAPE
//GET NEXT LINE IN FILE
start_needle = strstr(end_needle_line, "tape_conf,");
if (start_needle == nullptr) { break; }
end_needle_line = strstr(start_needle, "\n");
tpcong_line = "";
tpcong_line.append(start_needle, end_needle_line);
start_needle = strstr(tpcong_line.c_str(), "tape_conf,");
was_char_pos = false;
tmp_string = "";
selected_char = NULL;
end_needle = NULL;
continue;
}
else {
tmp_string = "";
tmp_string.append(start_needle,end_needle);
tape.tape_cells[atoi(tmp_string.c_str())] = *selected_char; //SET CHAR ON TAPE
start_needle += tmp_string.size() + strlen(",");
}
}
}
else {
//FAIL BREAK SHIT
throw;
}
}
//andere vorgehensweise zur demonstration
//hier zuerst all
//ja ich war
const char* rule_set_counter = strstr(turing_add_one_program, "rule_set,");
int tileset_array_size = 0;
while (true) {
rule_set_counter = strstr(rule_set_counter, "rule_set,");
if (rule_set_counter != 0) {
rule_set_counter += strlen("rule_set,"); //skip rule_set,
tileset_array_size++;
}
else {
break;
}
}
//NOW CREARTE ID ARRAY
int* found_id_count = new int[tileset_array_size];
std::string* found_rule_sets = new std::string[tileset_array_size];
for (size_t i = 0; i < tileset_array_size; i++)
{
found_id_count[i] = 0;
}
rule_set_counter = strstr(turing_add_one_program, "rule_set,");
const char* rule_set_id_seperator = NULL;
const char* rule_set_id_line = NULL;
int std_counter = 0;
std::string tmp_id = "";
int tileset_array_size_id = 0;
while (true) {
rule_set_counter = strstr(rule_set_counter, "rule_set,");
if (rule_set_counter != 0) {
rule_set_counter += strlen("rule_set,"); //skip rule_set,
rule_set_id_seperator = strstr(rule_set_counter, ",");
rule_set_id_seperator++;
found_rule_sets[std_counter] = "";
rule_set_id_line = strstr(rule_set_id_seperator, "\n");
found_rule_sets[std_counter].append(rule_set_counter, rule_set_id_line);
tmp_id = "";
tmp_id.append(rule_set_counter, rule_set_id_seperator);
found_id_count[atoi(tmp_id.c_str())]++; //mit der id 0 gibt es so viele sets
tileset_array_size_id++;
std_counter++;
}
else {
break;
}
}
//jetzt anzahlder uniquen rule sets_counten
int rs_u_id_counter = 0;
for (size_t i = 0; i < tileset_array_size; i++)
{
if (found_id_count[i] > 0) {
rs_u_id_counter++;
}
}
if (rs_u_id_counter <= 0) {
throw;
}
//WENN READ START RULE NOT EXISTS nach der 1 bei type schauen !!! bzw wen read start rule = -1
states = new STATE_DESC[rs_u_id_counter]; //PROGRAM STATES
if (states == nullptr) {
throw;
}
STATE_RULE rule; //TMP RULE STRUCT
std::string tmp_str = "";
int st_id_counter = 0;
//NOW PARSE THE STRING AARAY AND CREATE STATES
for (size_t i = 0; i < rs_u_id_counter; i++)
{
//ALLOCATE STATE_RULES ARRAY
states[i].state_id = i;
states[i].state_rules_count = found_id_count[i];
if (found_id_count[i] <= 0) { continue; }
states[i].state_rules = new STATE_RULE[states[i].state_rules_count];
//PARSE STRING TO ARRAY
st_id_counter = 0;
for (size_t j = 0; j <tileset_array_size; j++)
{
const char* start_rule_needle = found_rule_sets[j].c_str();
const char* end_rule_needle = NULL;
if (start_rule_needle == nullptr) { throw; }
//start_rule_needle++;
end_rule_needle = strstr(start_rule_needle, ",");
tmp_str = "";
tmp_str.append(start_rule_needle, end_rule_needle);
//id correct ?
if (atoi(tmp_str.c_str()) == states[i].state_id) {
//PARSE SWITCH ON CHAR
start_rule_needle = end_rule_needle + 1;
if (start_rule_needle == nullptr) { throw; }
end_rule_needle = strstr(start_rule_needle, ",");
if (end_rule_needle == nullptr) { throw; }
tmp_id = "";
tmp_id.append(start_rule_needle, end_rule_needle);
states[i].state_rules[st_id_counter].switch_on_char = atoi(tmp_id.c_str());
//PARSE SET CHAR
start_rule_needle = end_rule_needle + 1;
if (start_rule_needle == nullptr) { throw; }
end_rule_needle = strstr(start_rule_needle, ",");
if (end_rule_needle == nullptr) { throw; }
tmp_id = "";
tmp_id.append(start_rule_needle, end_rule_needle);
states[i].state_rules[st_id_counter].write_new_char = atoi(tmp_id.c_str());
//PARSE MOVE DIR
start_rule_needle = end_rule_needle + 1;
if (start_rule_needle == nullptr) { throw; }
end_rule_needle = strstr(start_rule_needle, ",");
if (end_rule_needle == nullptr) { throw; }
tmp_id = "";
tmp_id.append(start_rule_needle, end_rule_needle);
states[i].state_rules[st_id_counter].move_tape_dir = atoi(tmp_id.c_str());
//PARSE TYPE
start_rule_needle = end_rule_needle + 1;
if (start_rule_needle == nullptr) { throw; }
end_rule_needle = strstr(start_rule_needle, ",");
if (end_rule_needle == nullptr) { throw; }
tmp_id = "";
tmp_id.append(start_rule_needle, end_rule_needle);
switch (atoi(tmp_id.c_str()))
{
case 0:
states[i].state_rules[st_id_counter].rule_type = STATE_CONTROL::NORMAL;
break;
case 1:
states[i].state_rules[st_id_counter].rule_type = STATE_CONTROL::START;
break;
case 2:
states[i].state_rules[st_id_counter].rule_type = STATE_CONTROL::END;
break;
default:
states[i].state_rules[st_id_counter].rule_type = STATE_CONTROL::NORMAL;
break;
}
//PARSE NEXT STATE
start_rule_needle = end_rule_needle + 1;
if (start_rule_needle == nullptr) { throw; }
tmp_id = "";
tmp_id.append(start_rule_needle);
states[i].state_rules[st_id_counter].new_state_id = atoi(tmp_id.c_str());
//parse next shit
st_id_counter++; //++ for the next STATE slot
}
else {
continue;
}
int k = 0;
}
int j = 0;
}
unsigned int current_state_pos = 0;
current_state_pos = read_start_rule;
STATE_CONTROL last_rule_state_flag = STATE_CONTROL::START;
tape.print_tape();
while (last_rule_state_flag != STATE_CONTROL::END )
{
for (size_t i = 0; i < states[current_state_pos].state_rules_count; i++) //fuer jede rule im aktuellen ruleset
{
if (states[current_state_pos].state_rules[i].switch_on_char == tape.tape_cells[tape.current_head_position]) { //wenn das char des lesekopfs dem rule char enspricht
states[current_state_pos].state_rules[i].print_step(); //debug ausgabe
tape.tape_cells[tape.current_head_position] = states[current_state_pos].state_rules[i].write_new_char; //setzte das neue char
tape.move_tape(states[current_state_pos].state_rules[i].move_tape_dir); //bewege das band
last_rule_state_flag = states[current_state_pos].state_rules[i].rule_type; //setzte neuen typ für schelifenabbruch
tape.print_tape(); //draw debug tabe
current_state_pos = states[current_state_pos].state_rules[i].new_state_id; //setze neue state id für den nächsten durchgang
break; //beende die schleife
}
}
}
//CLEANUP SHIT
delete[] states;
states = NULL;
delete[] found_id_count;
char a = 0;
std::cin >> a;
return 0;
}