-
Notifications
You must be signed in to change notification settings - Fork 1
/
CMEXPR.c
152 lines (129 loc) · 2.4 KB
/
CMEXPR.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
#include <stdio.h>
#define MAX_SIZE 512
struct Node_t
{
char oper;
struct Node_t * left;
struct Node_t * right;
};
struct Node_t nodes[MAX_SIZE];
char last;
struct Node_t * free_node;
char GetNextChar(void)
{
char ret;
do
{
ret = getchar();
} while ((ret == ' ') || (ret == '\t'));
return ret;
}
struct Node_t * E(void);
struct Node_t * T(void)
{
struct Node_t * ret_node;
if (last == '(')
{
last = GetNextChar();
ret_node = E();
last = GetNextChar(); /* preskocit ')' */
return ret_node;
}
free_node->oper = last;
last = GetNextChar(); /* preskocit terminator */
return free_node++;
}
/*struct Node_t * Ec(struct Node_t * left);*/
struct Node_t * Fc(struct Node_t * left)
{
struct Node_t * node;
if ((last == '*') || (last == '/'))
{
node = free_node++;
node->oper = last;
last = GetNextChar();
node->left = left;
node->right = T();
return Fc(node);
}
return left;
}
struct Node_t * F(void)
{
struct Node_t * left_node;
left_node = T();
return Fc(left_node);
}
struct Node_t * Ec(struct Node_t * left)
{
struct Node_t * node;
if ((last == '+') || (last == '-'))
{
node = free_node++;
node->oper = last;
last = GetNextChar();
node->left = left;
node->right = F();
return Ec(node);
}
node = Fc(left);
if ((last == '+') || (last == '-'))
return Ec(node);
return node;
}
struct Node_t * E(void)
{
struct Node_t * left_node;
left_node = T();
return Ec(left_node);
}
void Print(struct Node_t * node, int prior)
{
int lpri, rpri;
/*printf("[node: %p], prior: %d\n", node, prior);*/
/*printf(" {left: %p, oper: \'%c\', right: %p}\n", node->left, node->oper, node->right);*/
switch(node->oper)
{
case '+':
lpri = rpri = 2;
break;
case '-':
lpri = 2;
rpri = 1;
break;
case '*':
lpri = rpri = 1;
break;
case '/':
lpri = 1;
rpri = 0;
break;
default:
putchar(node->oper);
return;
}
if (lpri > prior)
putchar('(');
Print(node->left, lpri);
putchar(node->oper);
Print(node->right, rpri);
if (lpri > prior)
putchar(')');
/*printf("\n");*/
}
int main(void)
{
struct Node_t * node;
int n;
scanf("%d\n", &n);
while (n--)
{
last = GetNextChar();
free_node = nodes;
node = E();
Print(node, 4);
printf("\n");
/*printf("###########done############(posledni znak \'%c\')\n", last);*/
}
return 0;
}