-
Notifications
You must be signed in to change notification settings - Fork 1
/
hw4compiler.c
2552 lines (2373 loc) · 82.1 KB
/
hw4compiler.c
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
// Team Leader: Tyler Crawford
// Member: Nelson Herrera Gamboa
// Class: COP3402
// Date of Last Edit: 4/11/2023
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#define CMAX 11 // maximum number of chars for idents
#define STRMAX 125 // Assuming max codeline length is 50
#define MAX_NAME_TABLE_SIZE 500
//==================================================================================================================================================================//
//==================================================================================================================================================================//
//==================================================================================================================================================================//
char *lexicalParse(char *codeLine);
int numberOfFileLines(char *filename);
int characterInSymbolTableBS(char c, char *symTbl);
int isStatementReserved(char *word);
char *subString(int start, int end, char *line);
int isWordValid(char *word);
void PROGRAM();
int BLOCK();
void printSourceCode(char *filename);
char *GET_Token();
int Get_TokenInteger();
void CONST_DECLARATION();
void PROC_DECLARATION();
void VAR_DECLARATION(int *dx);
int SYMBOLTABLECHECK(char *name);
void SYMBOLTABLEDELETELEVEL(int level);
int SYMBOLTABLECHECKLEVEL(char *name);
void EXPRESSION();
void STATEMENT();
void CONDITION();
void TERM();
void FACTOR();
void printSymTbl();
void printAssCodes();
char *assemblyConvertOP(int OP, int M);
void freeAll();
// All this for recursive functions
void addNewFunctionCallToFunctionTable(char *name, int jpxIdx);
void ulitmateUpdateAllAddresses();
int base(int BP, int L);
void mainVM();
//==========================================================================================================================HW1 NO TOUCH
int pas[MAX_NAME_TABLE_SIZE];
// arBarZeroOne array is used to mark where
// the activation bars on print go
int arBarZeroOne[MAX_NAME_TABLE_SIZE];
// instruction register
int IR[3]; // IR = 0 0 0
// pointer and halt initalization
int BP = 499;
int SP = 500;
int PC = 0;
int OP = 0;
int M = 0;
int L = 0;
int halt = 1;
void mainVM()
{
// Reads in input file from cmd line
FILE *fp;
fp = fopen("./elf.txt", "r");
// Initial values: 0 499 500
while (1)
{
fscanf(fp, "%d %d %d", &OP, &L, &M);
pas[PC] = OP;
pas[PC + 1] = L;
pas[PC + 2] = M;
PC = PC + 3;
// upon finding the halt code, scanning stops
if (OP == 9 && M == 3)
break;
}
fclose(fp);
printf("\n");
PC = 0;
printf(" PC BP SP stack\n");
printf("inital values: %d %d %d\n", PC, BP, SP);
while (halt)
{
// Fetch Cycle
IR[0] = pas[PC]; // OP
IR[1] = pas[PC + 1]; // L
IR[2] = pas[PC + 2]; // M
PC = PC + 3;
// use nested swtich statements for instuctions
switch (IR[0])
{
// LIT, Pushes a constant value (literal) M onto the stack
case 1:
SP = SP - 1;
pas[SP] = IR[2];
printf(" LIT 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
// for loop to print stack with check for activation bars
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
case 2:
// Operation to be performed on the data at the top of the stack.(or return from function)
switch (IR[2])
{
// RTN Returns from a subroutine is encoded 0 0 0 and restores the caller’s AR
case 0:
SP = BP + 1;
BP = pas[SP - 2];
PC = pas[SP - 3];
printf(" RTN 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// ADD addition
case 1:
pas[SP + 1] = pas[SP + 1] + pas[SP];
SP = SP + 1;
printf(" ADD 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// SUB subtraction
case 2:
pas[SP + 1] = pas[SP + 1] - pas[SP];
SP = SP + 1;
printf(" SUB 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// MUL multiplication
case 3:
pas[SP + 1] = pas[SP + 1] * pas[SP];
SP = SP + 1;
printf(" MUL 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// DIV division
case 4:
pas[SP + 1] = pas[SP + 1] / pas[SP];
SP = SP + 1;
printf(" DIV 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// EQL equality
case 5:
pas[SP + 1] = (pas[SP + 1] == pas[SP]);
SP = SP + 1;
printf(" EQL 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// NEQ not equal
case 6:
pas[SP + 1] = (pas[SP + 1] != pas[SP]);
SP = SP + 1;
printf(" NEQ 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// LSS less than
case 7:
pas[SP + 1] = (pas[SP + 1] < pas[SP]);
SP = SP + 1;
printf(" LSS 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// LEQ less than or equal to
case 8:
pas[SP + 1] = (pas[SP + 1] <= pas[SP]);
SP = SP + 1;
printf(" LEQ 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// GTR greater than
case 9:
pas[SP + 1] = (pas[SP + 1] > pas[SP]);
SP = SP + 1;
printf(" GTR 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
// GEQ greater than or equal to
case 10:
pas[SP + 1] = (pas[SP + 1] >= pas[SP]);
SP = SP + 1;
printf(" GEQ 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
break;
}
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
// LOD load value to top of the stack from location at offset M from L
// lexicographical levels down of the stack
case 3:
SP = SP - 1;
pas[SP] = pas[base(BP, IR[1]) - IR[2]];
printf(" LOD%2d%5d%5d%6d%5d", IR[1], IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
// Store value at top of stack in the stack location at offset M
// from L lexicographical levels down
case 4:
pas[base(BP, IR[1]) - IR[2]] = pas[SP];
SP = SP + 1;
printf(" STO%2d%5d%5d%6d%5d", IR[1], IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
// CAL Call the procedure at code index p,
// generating a new activation record and
// setting PC to M
case 5:
pas[SP - 1] = base(BP, IR[1]);
pas[SP - 2] = BP;
pas[SP - 3] = PC;
BP = SP - 1;
PC = IR[2];
arBarZeroOne[BP + 1] = 1;
printf(" CAL%2d%5d%5d%6d%5d", IR[1], IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
// INC Allocate M memory words (increment SP by M). First four
// are reserved to Static Link (SL), Dynamic Link (DL),
// and Return Address (RA)
case 6:
SP = SP - IR[2];
printf(" INC 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
// JMP Jump to instruction M (PC <- M)
case 7:
PC = IR[2];
printf(" JMP 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
// JPC jump conditionally, Jump to instruction M
// if top stack element is 0
case 8:
if (pas[SP] == 0)
{
PC = IR[2];
}
SP = SP + 1;
printf(" JPC 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
// GENERAL SYSTEM [SYS]
case 9:
// Output of the value in stack[SP] to standard
// output as a character and pop:
if (IR[2] == 1)
{
printf("Output result is: %d\n", pas[SP]);
SP = SP + 1;
printf(" SOU 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
}
// Read in input from the user and store it on top of the stack
else if (IR[2] == 2)
{
SP = SP - 1;
printf("Please Enter an integer: ");
scanf("%d", &pas[SP]);
printf(" SIN 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
break;
}
// End of program (Set “eop” flag to zero)
if (IR[2] == 3)
{
halt = 0; //"eop" flag ?? how do this, exit() is not allowed
printf(" EOP 0%5d%5d%6d%5d", IR[2], PC, BP, SP);
for (int i = 499; i > SP - 1; i--)
{
if (pas[i] < 10)
{
printf("%3d", pas[i]);
}
else if (pas[i] < 100)
{
printf("%4d", pas[i]);
}
else
{
printf("%5d", pas[i]);
}
if (arBarZeroOne[i])
{
printf(" | ");
}
}
printf("\n");
}
}
}
}
int base(int BP, int L)
{
int arb = BP; // arb = activation record base
while (L > 0) // find base L levels down
{
arb = pas[arb];
L--;
}
return arb;
}
//==========================================================================================================================DO NOT TOUCH THE ABOVE
char *global_Lexeme;
int universialIndex = 0;
int tokencount = 0;
int universalCodeText = 0; // This keeps track of how many opcodes we have (This should be "Line" in the terminal)
int variableCount = 0; // This keeps track of how many Variables have been stored into the Symbol table
int universalSymbolIndex = 2; // This keeps track of what index we must store into next. This also is where we start our search. Searching starts at universal Symbol Index and decrements until 0.
int universalLevel = 0;
int universalRecursiveTableIdx = 1;
typedef struct
{
int kind; // const = 1, var = 2, proc = 3. -- proc is not in use for now.
char name[12]; // name up to 11 chars not including '\0'.(identifer)
int val; // number (ASCII value)
int level; // L level -- assume 0 for the most part
int adr; // M address
int mark; // 0 = in use for code generation, 1 = unavailable.
} namerecord_t;
// This struct will be used to store the opcodes as be "emit" them to the screen for processing later.
typedef struct
{
int OP; // name up to 11 chars.(identifer)
int L; // number (ASCII value)
int M; // L level
} assembly_Node;
typedef struct
{
char name[12];
int nameInstancesJmpIdx[MAX_NAME_TABLE_SIZE];
int adr;
} recursiveNameRecord;
// Function Signitures for functions that will insert structs into the arrays below.
namerecord_t *initializeNameRecord(int _kind, char *_name, int _val, int _level, int _adr, int _mark);
assembly_Node *initializeAssemblyRecord(int OP, int L, int M);
recursiveNameRecord *initializeRecursiveNameRecord(char *_name, int _adr);
// Arrays that will hold the structs.
namerecord_t *symbol_Table[MAX_NAME_TABLE_SIZE];
assembly_Node *assembly_Code[MAX_NAME_TABLE_SIZE]; // this is where we will be storing the the assembly code
recursiveNameRecord *functionCall_Table[MAX_NAME_TABLE_SIZE];
int TOKEN = -1;
//==========================================================================================================================
//==========================================================================================================================
typedef enum
{
identsym = 2,
numbersym = 3,
plussym = 4,
minussym = 5,
multsym = 6,
slashsym = 7,
oddsym = 8,
eqsym = 9,
neqsym = 10,
lessym = 11,
leqsym = 12,
gtrsym = 13,
geqsym = 14,
lparentsym = 15,
rparentsym = 16,
commasym = 17,
semicolonsym = 18,
periodsym = 19,
becomessym = 20,
beginsym = 21,
endsym = 22,
ifsym = 23,
thensym = 24,
whilesym = 25,
dosym = 26,
callsym = 27,
constsym = 28,
varsym = 29,
procsym = 30,
writesym = 31,
readsym = 32,
} token_type;
//==================================================================================================================================================================//
//==================================================================================================================================================================//
//==================================================================================================================================================================//
char *resWords[] = {"odd", "begin", "end", "if", "then", "while", "do", "call", "const", "var", "procedure", "write", "read"};
int resWordsTokens[] = {oddsym, beginsym, endsym, ifsym, thensym, whilesym, dosym, callsym, constsym, varsym, procsym, writesym, readsym};
// Symbol table is in order of ascii value, can be used with binary search
char symbolTableOrdered[] = {'\t', '\r', ' ', '(', ')', '*', '+', ',', '-', '.', '/', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', ':', ';', '<',
'=', '>', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W',
'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u',
'v', 'w', 'x', 'y', 'z'};
// Symbols which are essentially breakpoints and line enders // is not in here, a lookahead check is necessary for that one
char specialTerminalSymbolsOrdered[] = {'\t', '\r', ' ', '(', ')', '*', '+', ',', '-', '.', '/', ':', ';', '<', '=', '>', '~'}; // ' ' isn't a term sym, it was put here
int specialTerminalSymbolsTokens[] = {-3, -2, -1, lparentsym, rparentsym, multsym, plussym, commasym, minussym, periodsym, slashsym, 0, semicolonsym, lessym, eqsym, gtrsym, 0}; // -1 is for spaces and 0 is for colons and -2 for tabs,
int halt_flag = 1;
int EndProgramFlag = 1;
int conditionFlag = 0;
//==================================================================================================================================================================//
//==================================================================================================================================================================//
//==================================================================================================================================================================//
char *lexicalParse(char *codeLine)
{
// Copy space of parent string
char *parsedString = malloc(sizeof(codeLine));
parsedString[0] = '\0';
// Start is set to zero as no special characters have been detected yet
int start = 0;
for (int i = 0; i < strlen(codeLine); i++)
{
// Check if character is valid within the symbol table
// Check if the next character from current index is a special symbol
int lookAheadPlus = characterInSymbolTableBS(codeLine[i + 1], symbolTableOrdered);
int lookAhead = characterInSymbolTableBS(codeLine[i + 1], specialTerminalSymbolsOrdered);
// Check if the current character from current index is a special symbol
int specialIndex = characterInSymbolTableBS(codeLine[i], specialTerminalSymbolsOrdered);
int current = characterInSymbolTableBS(codeLine[i], symbolTableOrdered);
// reserved index set to -1, used only if a reserved word is detected in deeper code
// where it would take up the index of a reserved word in resWords that connects to
// resWordsTokens in a 1 to 1 relationship.
int reservedIndex = -1;
// If look ahead is a special character or i is on the last iteration
// try to make a word from indexes start to i+1 exclusively (i+1 is where the
// special char is)
if (current == -1)
{
char invalid_string[4];
invalid_string[0] = '2';
invalid_string[1] = ' ';
invalid_string[2] = codeLine[i];
invalid_string[3] = '\0';
strcat(parsedString, invalid_string);
strcat(parsedString, " ");
start = start + 1;
// continue;
}
else if ((lookAhead != -1 || lookAheadPlus == -1) || i == strlen(codeLine) - 1 || (lookAhead == -1 && (specialIndex != -1)))
{
// asdfas % *
// Substring attempts to create a word that is either a reserved word or
// identifier. The substring will return null if the start is a special character
char *word = subString(start, i + 1, codeLine);
// token is set as default to the identifier token value
int token = identsym;
// If the word exists check if the word is both valid or a reserved word.
// If it is a resseved word, tokenize it, if it is not valid, stop the parse,
// free the WIP parse string and entirely and return null from the entire function
// to indicate an error occured. Prints out to console on what type of error occured
// on the given line, before exiting on error.
if (word != NULL)
{
// checks if word is valid, errors will return null
int valid = isWordValid(word);
// printf("%s\n",word);
reservedIndex = isStatementReserved(word);
if (reservedIndex != -1)
{
token = resWordsTokens[reservedIndex];
}
if (valid == 2 || valid == -3)
{
token = numbersym;
}
start = i + 1;
// if(lookAheadPlus == -1) start = start + 1;
}
else
{
// Take the index of the special character in the codeline (that failed to create a word) and
// find what special char token it corresponds to
specialIndex = characterInSymbolTableBS(codeLine[start], specialTerminalSymbolsOrdered);
token = specialTerminalSymbolsTokens[specialIndex];
// printf("TOKEN LOOKING FOR 13 %d\n",token);
// if(specialIndex == -1)
// {
// token = -1;
// }
// Some tokens can merge with other tokens to create special cases.
// This checks for those and merges the tokens accordingly and shifts the
// start and i by 1, as in this case we "truncate" the string by one char
// when completeing a merge.
// The switch also tests for comments to ignore when tokenizing, IT DOESN'T CHECK CONTENT
// of comments. Invalid characters could be inside the commments. Also, it doesn't assume
// there to be nested comments like: /*/**/*/
switch (token)
{
case 0:
if (codeLine[start + 1] == '=')
{
token = becomessym; // :=
start = start + 1;
i++;
}
break;
case lessym:
if (codeLine[start + 1] == '=')
{
token = leqsym; // <=
start = start + 1;
i++;
}
else if (codeLine[start + 1] == '>')
{
token = neqsym; // <>
start = start + 1;
i++;
}
break;
case gtrsym:
if (codeLine[start + 1] == '=')
{
token = geqsym; // >=
start = start + 1;
i++;
}
break;
case slashsym: // Slashsym is for /
if (codeLine[start + 1] == '*') // checks for a /* case to indicate a comment start
{
token = -1; // From comment start onwards is to be ignored, so token is set to -1
int commentError = 1;
// Check to see if based on where the comment start is, if it would be
// possible to have a */ in the remaining space of the codeLine passed in
if ((strlen(codeLine) - (i + 1)) >= 2)
{
// Loop through and check to find if a corresponding */ exists
for (int x = start + 2; x < strlen(codeLine) - 1; x++)
{
char twoChars[] = {codeLine[x], codeLine[x + 1]}; // probably needs to change to checking only last two chars,
if (twoChars[0] == '*' && twoChars[1] == '/') // instead of checking whole thing
{
commentError = 0;
// if the comment ends on the last character of the codeLine
// break out and end the parse.
if (x + 1 == strlen(codeLine) - 1)
{
halt_flag = 0;
}
else
{
start = x + 1;
i = x + 1;
}
break;
}
}
}
if (commentError) // no end of comment was found, return an error
{
token = -5;
start = start + 1;
i++;
// printf("Code line: '%s' has an unresolved comment, not ended with '*/' \n", codeLine);
// free(parsedString);
// return NULL;
}
}
break;
}
if (halt_flag == 0)
{
halt_flag = 1; // reset the halt flag
break;
}
start = start + 1; // increment start
}
// Negative tokens are to be ignored, only positive are to be added on the string
if (token > 0 || token == -5)
{
char int_string[4];
sprintf(int_string, "%d ", token);
strcat(parsedString, int_string);
if (token == identsym || token == numbersym || reservedIndex != -1)
{
if (reservedIndex == -1)
{
strcat(parsedString, word);
strcat(parsedString, " ");
}
}
}
}
}
return parsedString;
}
int isStatementReserved(char *word)
{
int retval = -1;
for (int x = 0; x < 13; x++)
{
if (strcmp(word, resWords[x]) == 0)
{
retval = x;
break;
}
}
return retval;
}
int isWordValid(char *word)
{
int retval = 1;
// If it starts with an integer make sure it only has integers
if (word[0] >= '0' && word[0] <= '9')
{
for (int x = 1; x < strlen(word); x++)
{
if (word[x] < '0' || word[x] > '9')
{
retval = -2;
break;
}
}
// If the integer is longer than 5 digits
if (retval != -2)
{
if (strlen(word) > 5)
{
retval = -3;
}
else
{
retval = 2;
}
}
}
// If the word is longer than CMAX characters
if (strlen(word) > CMAX && retval == 1)
{
retval = -1;
}
return retval;
}
char *subString(int start, int end, char *line)
{
if (characterInSymbolTableBS(line[start], specialTerminalSymbolsOrdered) != -1 && characterInSymbolTableBS(line[start], symbolTableOrdered) != -1)
return NULL;
char *word = malloc(sizeof(char) * (end - start + 1));
word[0] = '\0';
for (int i = start; i < end; i++)
{
if (characterInSymbolTableBS(line[i], symbolTableOrdered) != -1)
{
word[strlen(word)] = line[i];
word[strlen(word) + 1] = '\0';
}
if (characterInSymbolTableBS(line[i], symbolTableOrdered) == -1)
{
break;
}
}
if (word[0] == '\0')
{
return NULL;
}
else
{
return word;
}
}
int numberOfFileLines(char *filename)
{
FILE *fp = fopen(filename, "r");
int numLines = 1;
char ch = ' ';
while ((ch = fgetc(fp)) != EOF)
{
if (ch == '\n')
{
numLines++;
}
}
fclose(fp);
return numLines;
}
int characterInSymbolTableBS(char c, char *symTbl)
{
int low = 0;
int high = strlen(symTbl) - 1;
while (low <= high)
{
int mid = (high + low) / 2;
if (symTbl[mid] == c)
return mid;
else if (symTbl[mid] > c)
high = mid - 1;
else
low = mid + 1;
}
return -1;
}
int binarySearch(int arr[], int left, int right, int x)
{
while (left <= right)
{
int mid = left + (right - left) / 2;
// Check if x is present at mid
if (arr[mid] == x)
return mid;
// If x greater, ignore left half
if (arr[mid] < x)
left = mid + 1;
// If x is smaller, ignore right half
else
right = mid - 1;
}
// If we reach here, then element was not present
return -1;
}
void freeAll()
{
for (int i = 0; i < MAX_NAME_TABLE_SIZE; i++)
{
if (symbol_Table[i] != NULL)
{
free(symbol_Table[i]);
}
if (assembly_Code[i] != NULL)
{
free(assembly_Code[i]);
}
if (functionCall_Table[i] != NULL)
{
free(functionCall_Table[i]);
}
if (assembly_Code[i] == NULL && symbol_Table[i] == NULL && functionCall_Table[i] != NULL)
{
break;
}
}
}
//==================================================================================================================================================================//
//==================================================================================================================================================================//
//==================================================================================================================================================================//
void outputAssemblyToFile()
{
// printf("\nPRINTING TO \"outputAssemblyCode.txt\" ...\n");
FILE *file = fopen("elf.txt", "w");
if (file == NULL)
{
printf("Failed to pen File!\n");
return;
}
for (int i = 0; i < universalCodeText; i++)
{
fprintf(file, "%d %d %d\n", assembly_Code[i]->OP, assembly_Code[i]->L, assembly_Code[i]->M);
}
fclose(file);
// printf("SUCCESS!\n");
}
char *GET_Token()
{
// printf("\n\nEntering the GET_Token\n");
// initializing variables
char *RETVAL = (char *)malloc(sizeof(char) * 12);
// printf("This is Global Lexeme: %s\n", global_Lexeme);
int length = strlen(global_Lexeme);
int foundIt = 0;
// initializing token and word
char *token = (char *)malloc(sizeof(char) * 1000);
token[0] = '\0';
char specialCharacter;
int index = 0;
int tokenToInt;
char stopChar = ' ';
if (universialIndex == length - 1)
{
RETVAL = NULL;
return RETVAL;
}
// printf("This is universalIndex: %d\n", universialIndex);
for (int i = universialIndex; i < length; i++, universialIndex++)
{
// printf("We have entered the for loop\n");
// if we see a space then we continue.
if (global_Lexeme[i] == ' ')
{
continue;
}
strncat(token, global_Lexeme + i, 1);
// printf("When i is %d token is %s\n", i, token);