BasicCompiler/semantic.c at main · BaseMax/BasicCompiler · 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
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "semantic.h"

NODE *create_node(token instruction, value value, NODE *program)
{
	NODE *pn = (NODE *)malloc(sizeof(NODE));
	if (pn == NULL)
	{
		fprintf(stderr, "malloc error\n");
	}
	pn->intstruction = instruction;
	pn->val = value;
	pn->program = program;
	return pn;
}

NODE *append_node(NODE *pn1, NODE *pn2)
{
	if (pn1 == NULL)
	{
		pn1 = pn2;
	}
	else
	{
		if (pn2->intstruction == IF_TOKEN)
		{
			if (pn2->program == NULL)
			{
				pn2->program = pn1;
			}
			else
			{
				NODE *cur = pn2->program;
				while (cur->next != NULL)
				{
					cur = cur->next;
				}
				cur->next = pn1;
			}
		}
		else if (pn2->intstruction == FOR_TOKEN || pn2->intstruction == GOSUB_TOKEN)
		{
			if (pn2->program == NULL)
			{
				pn2->program = pn1;
			}
			else
			{
				NODE *cur = pn2->program;
				while (cur->next != NULL)
				{
					cur = cur->next;
				}
				cur->next = pn1;
			}
		}
		else
		{
			NODE *cur = pn1;
			while (cur->next != NULL)
			{
				cur = cur->next;
			}
			cur->next = pn2;
		}
	}
	return pn1;
}

void free_node(NODE **pn)
{
	if (*pn == NULL)
		return;
	free_node(&(**pn).next);
	free_node(&(**pn).program);
	free(*pn);
}

void print_node(NODE *pn, int *tab)
{
	if (pn == NULL)
		return;
	else
	{
		switch (pn->intstruction)
		{
		case HOME_TOKEN:
			printf("HOME ");
			printf("%s", pn->val.string_value);
			break;
		case INPUT_TOKEN:
			printf("INPUT ");
			printf("%d", pn->val.int_value);
			break;
		case LET_TOKEN:
			printf("LET ");
			printf("%d", pn->val.int_value);
			break;
		case FOR_TOKEN:
			printf("FOR ");
			printf("%d", pn->val.int_value);
			break;
		case IF_TOKEN:
			printf("IF ");
			printf("%d", pn->val.int_value);
			break;
		case THEN_TOKEN:
			printf("THEN ");
			break;
		case TO_TOKEN:
			printf("TO ");
			printf("%d", pn->val.int_value);
			break;
		case NEXT_TOKEN:
			printf("NEXT ");
			printf("%s", pn->val.string_value);
			break;
		case PRINT_TOKEN:
			printf("PRINT ");
			printf("%s", pn->val.string_value);
			break;
		case END_TOKEN:
			printf("END ");
			break;
		case RETURN_TOKEN:
			printf("RETURN ");
			break;
		case GOSUB_TOKEN:
			printf("GOSUB ");
			break;
		default:
			printf("Unkown instruction");
			break;
		}
		printf("\n");
		print_node(pn->next, tab);
		return;
	}
}