-
Notifications
You must be signed in to change notification settings - Fork 0
/
parse.cpp
1669 lines (1572 loc) · 70.9 KB
/
parse.cpp
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
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
#include <map>
#include <stack>
#include <ctype.h>
#include <fstream>
#include <stdio.h>
#include <sstream>
#include <regex>
#include <iterator>
#include <boost/algorithm/string/trim.hpp>
#include "stdc++.h"
#include <ctype.h>
using namespace std;
vector<string> split(string str, char separator) {
vector<string> tokens;
int startIndex = 0, endIndex = 0;
for (int i = 0; i <= str.size(); i++) {
// If we reached the end of the word or the end of the input.
if (str[i] == separator || i == str.size()) {
endIndex = i;
string temp;
temp.append(str, startIndex, endIndex - startIndex);
tokens.push_back(temp);
startIndex = endIndex + 1;
}
}
return tokens;
}
bool is_number(const string &s) {
string::const_iterator it = s.begin();
while (it != s.end() && isdigit(*it))
++it;
return !s.empty() && it == s.end();
}
class Parser
{
private:
/// a map of string and integer to keep track of the indices of the variables to be defined.
map<string, int> vars_indx;
/// An iterator over the vars_indx map
map<string, int>::iterator it;
/// variables counter -- start from index 2 as index 0 is reserved for 1 and index 1 is reserved for 1.
int vars_cntr;
int res_cntr;
/// The operations to be computed: +, *, -
string op;
/// The integer representation of operand 1
int op1;
/// The index of operand 1 to be stored in the vars_indx map
int op1_indx;
/// Operand 1 as read from the IR
string op1_tmp;
/// The integer representation of operand 2
int op2;
/// The index of operand 2 to be stored in the vars_indx map
int op2_indx;
/// Operand 2 as read from IR
string op2_tmp;
/// The index to which a result is stored as read from the IR (e.g., '0, '1, etc.)
string res_indx_tmp;
/// the integer representation of the result index
int res_indx;
/// A flag to indicate that the value to read from the IR is an array index.
bool arr_flag;
/// A map to store the array index label (string) and index value (int).
map<string, int> arr_indx;
/// It means the result of the next computation is an index in array, so store it in the arr_indx map.
bool next_is_indx = false;
string indx_lbl_arr_indx;
/// When we access a value from an array, we need to tell if the value is the first operand or the second operand.
bool is_op1 = true;
/// When we are storing values in an array, the IR uses consequetive calls of "store" instruction. The first store instruction has the array label in
/// in which we are storing the values. Next "store" instructions reference the previous store instruction; this like a recursive call until we reach the
/// target array. We use this flag to differentiate between the first "store" instruction and the others. If this is the first, then it references the target
/// array, otherwise, we igonre the array label provided with it and use the we save in the variable "store_array_lbl" below.
bool first_store_inst = true;
string store_array_lbl;
/// This map is used as an evaluted table of the compuation, it is similar to print of the arithimtic circuit (cir_print), but without variables
/// on the right-hand side of the equation. For example, if we have cir_print = $r3:=1, r4:=2, $r5:=r3+r4, then the table will have: $r3:=1, r4:=2, $r5:=3.
map<string, int> eval_table;
/// For perfroming the equlaity check, we will use fermat's little theorem: we subtract the two values, then exponentiate to plaintext modulus set in SEAL.
/// It should be a prime number, so assume it is 19 (It should be modified in modified in SEAL and Rino.)
int ptxt_mod = 13;
/// A flag to indicate if we processing if-then-else statement.
bool ite_flg = 0;
// This used for arrays that are defined inline with `store` opereation
string last_array_lbl;
//This to handle the new array name (typically, the index number of the line) after the store instruction.
map<string, string> array_nickname;
vector<string> split(string str, char separator)
{
vector<string> tokens;
int startIndex = 0, endIndex = 0;
for (int i = 0; i <= str.size(); i++)
{
// If we reached the end of the word or the end of the input.
if (str[i] == separator || i == str.size())
{
endIndex = i;
string temp;
temp.append(str, startIndex, endIndex - startIndex);
tokens.push_back(temp);
startIndex = endIndex + 1;
}
}
return tokens;
}
bool isStringEmptyOrWhitespace(const std::string &str)
{
// Check if the string is empty
if (str.empty())
{
return true;
}
// Check if all characters in the string are whitespace
return std::all_of(str.begin(), str.end(), [](unsigned char ch)
{ return std::isspace(ch); });
}
/**
* Reads the IR file and returns the tuple block.
* @param filename the IR file name.
* */
string readTuple(const string &filename)
{
string srch = "(tuple";
string line;
fstream file;
file.open(filename, ios::in);
if (file.is_open())
{
while (getline(file, line))
{
if (line.find(srch) != string::npos)
{
return line;
}
}
}
else
cout << "Couldn't access the file\n";
return "";
}
auto fromString(std::string str)
{
std::vector<std::string> elements;
std::regex r{R"([<\[" ]?([^<>\[\]" =\x0a\x0d]+)[>\[" ]?)"};
std::istringstream iss(str);
auto it = std::sregex_iterator(str.begin(), str.end(), r);
auto end = std::sregex_iterator();
for (; it != end; ++it)
{
auto match = *it;
auto element = match[1].str().append(" ");
elements.push_back(element);
}
return elements;
}
/**
* Remove the parentheses from a string.
* @param in the input string.
* */
string strip_parentheses(string in)
{
for (int i = 0; i < in.size(); i++)
{
if (in[0] == '(')
{
in = in.substr(1, in.size());
}
}
for (int i = 0; i < in.size(); i++)
{
if (in[in.size() - 1] == ')')
{
in = in.substr(0, in.size() - 1);
}
}
return in;
}
bool is_number(const string &s)
{
string::const_iterator it = s.begin();
while (it != s.end() && isdigit(*it))
++it;
return !s.empty() && it == s.end();
}
/**
* Reads the IR file and returns the let block.
* @param filename the IR file name.
* */
vector<string> readLet(string filename)
{
string srch = " (let";
string line;
fstream file;
vector<string> res;
int found = 0;
string l;
int brk;
file.open(filename, ios::in);
if (file.is_open())
{
while (getline(file, line))
{
if (line == srch)
{
found = 1;
}
if (found)
{
while (getline(file, l))
{
if (l.find("tuple") != string::npos)
{
return res;
}
res.push_back(l);
}
}
}
}
else
cout << "Couldn't access the file\n";
return res;
}
/**
* Parse the let block.
* @param filename the IR file name.
* */
string parse_let(string filename)
{
/// A stack for parsing nested operations between parentheses.
stack<string> st;
/// A temp variable.
string s;
/// A string vector that contains the instructions included in the Let block of the IR.
vector<string> vec = readLet(filename);
/// If the vector is empty, then there is no Let block.
if (vec.empty())
{
return "";
}
/// The first element is "(", which is useless.
vec.erase(vec.begin());
/// The arithmetic circuit created as a result of parsing the Let block.
string cir_print;
/// A string vector that holds the instruction's operation and operands.
vector<string> inst;
/// A stack that stores the result of the last instruction that may be used in next operations.
stack<string> pending;
/// Process each line from the vector. Each line can include more than one instruction.
for (auto line : vec)
{
s = line;
/// Remove the spaces at the beginning and at the end of the instruction.
boost::trim(s);
/// This loop is for processing nested parentheses and extracting the inner most operation
for (char const c : s)
{
if (c == '(')
{
st.push(string(&c, 1));
continue;
}
if (st.empty())
break;
st.top() += c;
/// Once we encounter a ")", it means we got an instruction. Push the instruction into the isnt vector.
if (c == ')')
{
// cout << st.top() << endl;
inst.push_back(st.top());
st.pop();
}
}
for (string line : inst)
{
/// Remove the parentheses from the instruction
line = strip_parentheses(line);
/// Remove extra spaces between the instruction's tokens.
line = removeSpaces(line);
// cout << line << endl;
/// Get the instruction's tokens: operation, operand1, operand2
auto tokens = split(line, ' ');
/// How many tokens determines what we are going to parse
size_t tokens_size = tokens.size();
/// Get the operation
if (tokens[0] == "bvmul")
{
op = "*";
}
else if (tokens[0] == "bvadd")
{
op = "+";
}
else if (tokens[0] == "bvsub")
{
op = "-";
}
/// This means that we are storing array variables into the vars_indx to be used during next operations.
else if (tokens[0][0] == '#' && arr_flag)
{
/// Get the array label (e.g., '0, '1, etc..)
string indx_lbl = removeSpaces(strip_parentheses(inst[inst.size() - 1]));
last_array_lbl = indx_lbl;
string tmp = indx_lbl;
array_nickname[tmp] = tmp;
/// Iterate over the array elements
for (int i = 0; i < tokens.size(); i++)
{
/// Convert the binary string to integer
string val = tokens[i];
int int_val = stoi(val.substr(2, val.size()), nullptr, 2);
/// Set the value name to its array label appended with the value index.
/// for example, if the value is in array 1 and its index is 0, then the label is '1'0
indx_lbl += "\'" + to_string((i));
vars_indx[indx_lbl] = vars_cntr;
/// create the arithmetic circuit print, increment the counter, reset the indx_lbl to the array label.
cir_print += "$r" + to_string(vars_cntr) + " := " + to_string(int_val) + "\n";
string ele = "r" + to_string(vars_cntr);
eval_table[ele] = int_val;
vars_cntr++;
indx_lbl = tmp;
}
/// Now we are done with array, set the flag to false.
arr_flag = false;
// break;
continue;
}
/// It may not be an operation, rather an index to store a value or
/// a result of a computation
else if (tokens[0][0] == '\'')
{
res_indx_tmp = tokens[0];
}
else if (tokens[0] == "bv2pf")
{
if (inst.size() == 3)
{ /// In case we have ('0 ((bv2pf plapla) #b0101)), we are storing a value at an index
/// get the array index
string indx_val = strip_parentheses(inst[1]);
boost::trim(indx_val);
indx_lbl_arr_indx = removeSpaces(strip_parentheses(inst[2]));
arr_indx[indx_lbl_arr_indx] = stoi(indx_val.substr(2, indx_val.size()), nullptr, 2);
/// Skip the rest as the next token is a modulu number.
break;
}
else if (inst.size() == 5 || inst.size() == 4)
{
bool is_select = false;
for (auto stmt : inst)
{
if (stmt.find("select") != string::npos)
{
is_select = true;
break;
}
}
if (!is_select)
{
indx_lbl_arr_indx = inst[inst.size() - 1];
indx_lbl_arr_indx = removeSpaces(strip_parentheses(indx_lbl_arr_indx));
next_is_indx = true;
}
continue;
}
else
{
cout << "Unknown instruction pattern!" << endl;
exit(5);
}
} /// Useless for the current application
else if (tokens[0] == "mod" || tokens[0] == "bv")
{
continue;
} /// Set the flag to indicate that the next step is to store the array elements.
else if (tokens[0] == "array")
{
first_store_inst = true;
arr_flag = true;
continue;
}
/// This indicates an array access
else if (tokens[0] == "select")
{
if (tokens_size == 2)
{ /// It means that we will read array label from the tokens, but the value index is read from the eval_table.
/// because the index in this case is computed during previous instructions.
string top = pending.top();
top = top.substr(1, top.size());
pending.pop();
string val_indx = to_string(eval_table[top]);
string op1_lbl = tokens[1] + "\'" + val_indx;
op1_indx = vars_indx[op1_lbl];
op1_tmp = "$r" + to_string(op1_indx);
pending.push(op1_tmp);
}
else
{
if (is_op1)
{
/// The label of operand is created by concatentaing its array label and its index within the array.
string op1_lbl = tokens[1] + "\'" + to_string(arr_indx[tokens[2]]);
if (vars_indx.find(op1_lbl) == vars_indx.end())
{
op1_lbl = store_array_lbl + "\'" + to_string(arr_indx[tokens[2]]);
}
is_op1 = false;
op1_indx = vars_indx[op1_lbl];
op1_tmp = "$r" + to_string(op1_indx);
pending.push(op1_tmp);
res_indx = op1_indx;
}
else
{
/// The label of operand is created by concatentaing its array label and its index within the array.
string op2_lbl = tokens[1] + "\'" + to_string(arr_indx[tokens[2]]);
if (vars_indx.find(op2_lbl) == vars_indx.end())
{
op2_lbl = store_array_lbl + "\'" + to_string(arr_indx[tokens[2]]);
}
is_op1 = true;
op2_indx = vars_indx[op2_lbl];
op2_tmp = "$r" + to_string(op2_indx);
/// Switch the order of the operands, so we pop the first operand then the second.
// string tmp_op1 = pending.top();
// pending.pop();
pending.push(op2_tmp);
// pending.push(tmp_op1);
res_indx = op2_indx;
}
}
continue;
}
else if (isStringEmptyOrWhitespace(tokens[0]))
{
continue;
}
else if (tokens[0] == "store")
{
string nickname = removeSpaces(strip_parentheses(inst[inst.size() - 1]));
string indx_lbl;
if (first_store_inst)
{ /// The firsr store instruction we encounter is the one that has the array label in which we store the result.
/// next store instructions points to an index that is not an array, but to an index in another array (which is the array
/// referenced by the first store instruction)
array_nickname[nickname] = tokens[1];
/// Toggle the flag
first_store_inst = false;
if (tokens.size() == 2)
{
store_array_lbl = last_array_lbl;
indx_lbl = store_array_lbl + "\'" + to_string(arr_indx[tokens[1]]);
}
else
{
/// Ge the target array label in which we will store the result
store_array_lbl = array_nickname[tokens[1]];
/// Get the index (in the target array) at which we store the result.
indx_lbl = store_array_lbl + "\'" + to_string(arr_indx[tokens[2]]);
}
}
else
{
array_nickname[nickname] = store_array_lbl;
/// Get the index (in the target array) at which we store the result.
if (tokens.size() == 3)
indx_lbl = store_array_lbl + "\'" + to_string(arr_indx[tokens[2]]);
else
indx_lbl = store_array_lbl + "\'" + to_string(arr_indx[tokens[1]]);
}
/// Get the last computation in the pending stack
string top = pending.top();
pending.pop();
/// retrive the index of the indx_lbl. (It must be registered in the vars_indx beforehand).
int store_indx = vars_indx[indx_lbl];
/// This is the left-side operand that we are modifying its value
string left = "r" + to_string(store_indx);
/// This is the new value to be assigned to the left-side.
string right = top.substr(1, top.size());
cir_print += "$" + left + " := " + right + "\n";
/// Re-assign the value in the eval_table
eval_table[left] = eval_table[right];
continue;
}
else
{
cout << "Unknown token >> " << tokens[0] << endl;
exit(4);
}
/// If the instruction size is 3, then we have operator, operand 1, operand 2
if (tokens_size == 3)
{
/// Read operand 1
op1_tmp = tokens[1];
/// If it starts with #, then it is a constant value encoded in binary (e.g., #b010101).
if (op1_tmp[0] == '#')
{
/// skip the first two chars (# and b) and convert the binary into integer.
op1 = stoi(op1_tmp.substr(2, op1_tmp.size()), nullptr, 2);
op1_indx = vars_cntr;
vars_cntr++;
cir_print += "$r" + to_string(op1_indx) + " := " + to_string(op1) + "\n";
string tmp = "r" + to_string(op1_indx);
eval_table[tmp] = op1;
}
/// If it starts with ' (single quotes), then it is an index to a value. Its index is retrieved
/// from the vars_indx map, or store it in the vars_indx map.
else if (op1_tmp[0] == '\'')
{
/// iterate over the map to find the op1
it = vars_indx.find(op1_tmp);
/// If it is not stored in the map, then ...
if (it == vars_indx.end())
{
/// ... get its value, and ...
if (op1_tmp.size() > 2)
{
op1_indx = stoi(op1_tmp.substr(2, op1_tmp.size())) + vars_cntr;
}
else
{
op1_indx = stoi(op1_tmp.substr(1, op1_tmp.size())) + vars_cntr;
}
/// ... store it in the map.
vars_cntr++;
vars_indx[op1_tmp] = op1_indx;
}
else
{
/// If found, retrieve its index value
op1_indx = vars_indx[op1_tmp];
}
}
/// If op1_tmp is all chars, then it is a variable name.
else if (all_of(op1_tmp.begin(), op1_tmp.end(), [](char ch)
{ return isalpha(ch); }))
{
/// Iterate over the vars_indx to retrieve its index.
it = vars_indx.find(op1_tmp);
/// If it is not found, then store it in the vars_indx map.
if (it == vars_indx.end())
{
op1_indx = vars_cntr;
vars_cntr++;
vars_indx[op1_tmp] = op1_indx;
cir_print += "$r" + to_string(op1_indx) + " := " + op1_tmp + "\n";
}
else
{ /// if it is found, retrieve its index.
op1_indx = vars_indx[op1_tmp];
}
}
else
{
cout << "Unknown operand1! >> " << op1_tmp << endl;
exit(3);
}
op2_tmp = tokens[2];
if (op2_tmp[0] == '#')
{
op2 = stoi(op2_tmp.substr(2, op2_tmp.size()), nullptr, 2);
op2_indx = vars_cntr;
vars_cntr++;
cir_print += "$r" + to_string(op2_indx) + " := " + to_string(op2) + "\n";
string tmp = "r" + to_string(op2_indx);
eval_table[tmp] = op2;
}
else if (op2_tmp[0] == '\'')
{
it = vars_indx.find(op2_tmp);
if (it == vars_indx.end())
{
if (op2_tmp.size() > 2)
{
op2_indx = stoi(op2_tmp.substr(2, op2_tmp.size())) + vars_cntr;
}
else
{
op2_indx = stoi(op2_tmp.substr(1, op2_tmp.size())) + vars_cntr;
}
vars_cntr++;
vars_indx[op2_tmp] = op2_indx;
}
else
{
op2_indx = vars_indx[op2_tmp];
}
}
else if (all_of(op2_tmp.begin(), op2_tmp.end(), [](char ch)
{ return isalpha(ch); }))
{
it = vars_indx.find(op2_tmp);
if (it == vars_indx.end())
{
op2_indx = vars_cntr;
vars_cntr++;
vars_indx[op2_tmp] = op2_indx;
cir_print += "$r" + to_string(op2_indx) + " := " + op2_tmp + "\n";
}
else
{
op2_indx = vars_indx[op2_tmp];
}
}
else
{
cout << "Unknown operand2! >> " << op2_tmp << endl;
exit(3);
}
res_indx = vars_cntr;
cir_print += "$r" + to_string(res_indx) + " := r" + to_string(op1_indx) + " " + op + " r" + to_string(op2_indx) + "\n";
string tmp1 = "r" + to_string(res_indx);
string tmp2 = "r" + to_string(op1_indx);
string tmp3 = "r" + to_string(op2_indx);
if (eval_table.find(tmp2) != eval_table.end())
{
if (eval_table.find(tmp3) != eval_table.end())
{
if (op == "+")
eval_table[tmp1] = eval_table[tmp2] + eval_table[tmp3];
else if (op == "*")
eval_table[tmp1] = eval_table[tmp2] * eval_table[tmp3];
else if (op == "-")
eval_table[tmp1] = eval_table[tmp2] - eval_table[tmp3];
}
else
{
cout << tmp3 << " (op2 --- Line 618) does not exist in eval_table" << endl;
}
}
else
{
cout << tmp2 << " (op1 --- Line 623) does not exist in eval_table" << endl;
}
}
/// If the instruction size is 2, then we have operator, operand 1 only, operand 2 will be popped
/// from the pending stack
else if (tokens_size == 2)
{
/// read operand1
op1_tmp = tokens[1];
/// If it starts with #, then it is a constant value encoded in binary (e.g., #b010101).
if (op1_tmp[0] == '#')
{
op1 = stoi(op1_tmp.substr(2, op1_tmp.size()), nullptr, 2);
op1_indx = vars_cntr;
vars_cntr++;
cir_print += "$r" + to_string(op1_indx) + " := " + to_string(op1) + "\n";
string tmp = "r" + to_string(op1_indx);
eval_table[tmp] = op1;
}
else if (op1_tmp[0] == '\'')
{
/// If it starts with ', it is an index
it = vars_indx.find(op1_tmp);
if (it == vars_indx.end())
{
if (op1_tmp.size() > 2)
{
op1_indx = stoi(op1_tmp.substr(2, op1_tmp.size())) + vars_cntr;
}
else
{
op1_indx = stoi(op1_tmp.substr(1, op1_tmp.size())) + vars_cntr;
}
vars_cntr++;
vars_indx[op1_tmp] = op1_indx;
}
else
{
op1_indx = vars_indx[op1_tmp];
}
} /// If it is all chars, then it is a variable
else if (all_of(op1_tmp.begin(), op1_tmp.end(), [](char ch)
{ return isalpha(ch); }))
{
it = vars_indx.find(op1_tmp);
if (it == vars_indx.end())
{
op1_indx = vars_cntr;
vars_cntr++;
vars_indx[op1_tmp] = op1_indx;
cir_print += "$r" + to_string(op1_indx) + " := " + op1_tmp + "\n";
}
else
{
op1_indx = vars_indx[op1_tmp];
}
}
else
{
cout << "Unknown operand1! >> " << op1_tmp << endl;
exit(3);
}
if (pending.empty())
{
break;
}
/// get the result of the previous operation from the pending stack.
/// This is considered operand2
string next = pending.top();
pending.pop();
/***This is part was errorouns!*/
/// read from the letter "r" until the ":" symbol
/// next = next.substr(1, next.find(":"));
/***END*/
// Trim the $ and r
next = next.substr(1, next.size());
res_indx = vars_cntr;
cir_print += "$r" + to_string(res_indx) + " := " + "r" + to_string(op1_indx) + " " + op + " " + next + "\n";
string tmp1 = "r" + to_string(res_indx);
string tmp2 = next; //"r" + next;
string tmp3 = "r" + to_string(op1_indx);
if (eval_table.find(tmp2) != eval_table.end())
{
if (eval_table.find(tmp3) != eval_table.end())
{
if (op == "+")
eval_table[tmp1] = eval_table[tmp2] + eval_table[tmp3];
else if (op == "*")
eval_table[tmp1] = eval_table[tmp2] * eval_table[tmp3];
else if (op == "-")
eval_table[tmp1] = eval_table[tmp3] - eval_table[tmp2];
}
else
{
cout << tmp3 << " (op1 -- Line 715) does not exist in eval_table" << endl;
}
}
else
{
cout << tmp2 << " (op2 -- Line 720) does not exist in eval_table" << endl;
}
} /// it is either an operation (bvadd, bvmul, bvsub) or a result index
else if (tokens_size == 1)
{
/// the operands are the top two elements in stack
string token = tokens[0];
if (token == "bvmul")
{
if (pending.size() >= 2)
{
op1_tmp = pending.top();
pending.pop();
op2_tmp = pending.top();
pending.pop();
res_indx = vars_cntr;
cir_print += "$r" + to_string(res_indx) + " := " + op1_tmp.substr(1, op1_tmp.size()) + " * " + op2_tmp.substr(1, op2_tmp.size()) + "\n";
string tmp1 = "r" + to_string(res_indx);
string tmp2 = op1_tmp.substr(1, op1_tmp.size());
string tmp3 = op2_tmp.substr(1, op2_tmp.size());
if (eval_table.find(tmp2) != eval_table.end())
{
if (eval_table.find(tmp3) != eval_table.end())
{
eval_table[tmp1] = eval_table[tmp2] * eval_table[tmp3];
}
else
{
cout << tmp3 << " (op1 --- Line 751) does not exist in eval_table" << endl;
}
}
else
{
cout << tmp2 << " (op2 --- Line 756) does not exist in eval_table" << endl;
}
}
else
{
cout << "There isn't enough operands in the pending stack for bvmul!" << endl;
}
}
else if (token == "bvadd")
{
if (pending.size() >= 2)
{
op1_tmp = pending.top();
pending.pop();
op2_tmp = pending.top();
pending.pop();
res_indx = vars_cntr;
cir_print +=
"$r" + to_string(res_indx) + " := " + op1_tmp.substr(1, op1_tmp.size()) + " + " +
op2_tmp.substr(1, op2_tmp.size()) + "\n";
string tmp1 = "r" + to_string(res_indx);
string tmp2 = op1_tmp.substr(1, op1_tmp.size());
string tmp3 = op2_tmp.substr(1, op2_tmp.size());
if (eval_table.find(tmp2) != eval_table.end())
{
if (eval_table.find(tmp3) != eval_table.end())
{
eval_table[tmp1] = eval_table[tmp2] + eval_table[tmp3];
}
else
{
cout << tmp3 << " (op2 -- Line 790) does not exist in eval_table" << endl;
}
}
else
{
cout << tmp2 << " (op1 -- Line 793) does not exist in eval_table" << endl;
}
}
else
{
cout << "There isn't enough operands in the pending stack for bvadd!" << endl;
}
}
else if (token == "bvsub")
{
if (pending.size() >= 2)
{
op1_tmp = pending.top();
pending.pop();
op2_tmp = pending.top();
pending.pop();
res_indx = vars_cntr;
cir_print +=
"$r" + to_string(res_indx) + " := " + op1_tmp.substr(1, op1_tmp.size()) + " - " +
op2_tmp.substr(1, op2_tmp.size()) + "\n";
string tmp1 = "r" + to_string(res_indx);
string tmp2 = op1_tmp.substr(1, op1_tmp.size());
string tmp3 = op2_tmp.substr(1, op2_tmp.size());
if (eval_table.find(tmp2) != eval_table.end())
{
if (eval_table.find(tmp3) != eval_table.end())
{
eval_table[tmp1] = eval_table[tmp2] - eval_table[tmp3];
}
else
{
cout << tmp3 << " (op2 --- Line 827) does not exist in eval_table" << endl;
}
}
else
{
cout << tmp2 << " (op1 --- Line 830) does not exist in eval_table" << endl;
}
}
else
{
cout << "There isn't enough operands in the pending stack for bvsub!" << endl;
}
}
else if (token[0] == '\'')
{
vars_indx[token] = res_indx;
vars_cntr--;
}
}
else
{
cout << "Skipping >> " << op1_tmp << endl;
continue;
}
/// push the current operation into the pending stack.
string pen = "$r" + to_string(res_indx);
pending.push(pen);
vars_cntr++;
if (next_is_indx)
{
next_is_indx = false;
string name = "r" + to_string(res_indx);
arr_indx[indx_lbl_arr_indx] = eval_table[name];
}
}
/// Clear the inst vector to get the next instruction.
inst.clear();
}
return cir_print;
}
/**
* Parse the tuple block.
* @param filename the IR file name.
* */
string parse_tuple(const string &filename)
{
/// Reset op1 turn to parse the select operation.
is_op1 = true;
/// A stack for parsing the IR, given that the operations are organized in nested parentheses
stack<string> st;
/// Read the IR output and return the code which starts with "(tuple"
string zok_ir = readTuple(filename);
if (zok_ir[0] == ' ')
{
zok_ir.erase(0);
}
// cout << zok_ir << endl;
/// convert the code into an equation
string eqn = "";
/// Transform the IR into a simpler form for creating and executing the circuit.
string cir_print = "";
/// If an instruction is missing an operand, it means that the second operand is the one resulting from the
/// previous computation. The result of the previous computation is stored in this stack.
stack<string> pending;
/// Loop over the code and parse strip the parentheses
for (char const c : zok_ir)
{
if (c == '(')
{ /// The start of an operation
st.push(string(&c, 1));
continue;
}
if (st.empty())
{
break;
}
st.top() += c;
if (c == ')')
{
bool is_select = false;
/// The end of an operation
/// get an instruction
auto inst = st.top();
/// remove the first and last parentheses
inst = inst.substr(1, inst.size() - 2);
/// remove additional spaces between each word
inst = removeSpaces(inst);
/// split the instructions into tokens: operation operand1 operand2 OR operation operand1
auto tokens = split(inst, ' ');
/// The first token is the operation
string token = tokens[0];
int tokens_size = tokens.size();
if (token == "bvadd")
{
op = "+";
}
else if (token == "bvmul")
{
op = "*";
}
else if (token == "bvsub")
{