-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtranslate.y
351 lines (327 loc) · 8.77 KB
/
translate.y
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
%{
#include <ctype.h>
#include <stdio.h>
#include <string.h>
#include "lex.yy.c"
#include <math.h>
#define YYSTYPE int
int yyparse(void);
int yyerror(char *s);
int count_id = 0;
int count_node = 0;
int all_node = 0;
enum OP {zs,ROOT,ID,NU,PL,MN,UMN,DI,MU,P,L,C,S,EX};
typedef struct Node{
double diff;
double val;
char name[10];
enum OP op;
struct Node *reverse[10];
}node;
node *chain[40];
node* CreateNode();
void calcVal(node *n);
int FindID(char name[]);
void ReverseAutoDiff(node *chain[]);
%}
%token EQUA
%left PLUS MINUS
%left MUL DIV
%token COS SIN
%left LN EXP POW
%token NUMBER IDENT FUNC LEFTPA RIGHTPA COMMA COLON EOL
%%
Start : REV_AutoDiff
| REV_AutoDiff Start
;
REV_AutoDiff : func_def EOL
{
printf("val = %lf\n",chain[all_node-1]->val);
ReverseAutoDiff(chain);
}
;
func_def : FUNC LEFTPA var_list RIGHTPA COLON expr
{
node *x = CreateNode();
chain[all_node++] = x;
count_node++;
x->op = ROOT;
x->reverse[0] = chain[$6];
// printf("x->reverse[0]: %d, val: %lf\n",$6, chain[$6]->val);
calcVal(x);
}
;
var_init : IDENT
{
node *x = CreateNode();
chain[all_node++] = x;
count_id++;
x->op = ID;
strcpy(x->name,yytext);
// printf("yytext: %s, x->name: %s\n",yytext, x->name);
}
EQUA NUMBER
{
node *x = chain[all_node-1];
// printf("ident name:%s, ident val:%d\n",x->name,$4);
x->val = $4;
}
;
var_list : var_init
| var_list COMMA var_init
;
expr : IDENT
{
int x = FindID(yytext);
// printf("x value: %d\n",x);
$$ = x;
}
| NUMBER
{
node *x = CreateNode();
chain[all_node++] = x;
count_node++;
$$ = all_node-1;
x->op = NU;
x->val = $1;
}
| expr PLUS expr
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = PL;
x->reverse[0] = chain[$1];
x->reverse[1] = chain[$3];
calcVal(x);
}
| expr MINUS expr
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = MN;
x->reverse[0] = chain[$1];
x->reverse[1] = chain[$3];
calcVal(x);
}
| expr MUL expr
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = MU;
x->reverse[0] = chain[$1];
x->reverse[1] = chain[$3];
calcVal(x);
}
| expr DIV expr
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = DI;
x->reverse[0] = chain[$1];
x->reverse[1] = chain[$3];
calcVal(x);
}
| MINUS expr
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = UMN;
x->reverse[0] = chain[$2];
calcVal(x);
}
| LEFTPA expr RIGHTPA
{
$$ = $2;
}
| expr POW expr
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = P;
x->reverse[0] = chain[$1];
x->reverse[1] = chain[$3];
calcVal(x);
}
| EXP LEFTPA expr RIGHTPA
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = EX;
x->reverse[0] = chain[$3];
calcVal(x);
}
| LN LEFTPA expr RIGHTPA
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = L;
x->reverse[0] = chain[$3];
calcVal(x);
}
| SIN LEFTPA expr RIGHTPA
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = S;
x->reverse[0] = chain[$3];
calcVal(x);
}
| COS LEFTPA expr RIGHTPA
{
node *x = CreateNode();
chain[all_node++] = x;
$$ = all_node-1;
count_node++;
x->op = C;
x->reverse[0] = chain[$3];
calcVal(x);
}
;
%%
#include <stdio.h>
extern FILE *yyin;
int main()
{
yyin = stdin;
return yyparse();
}
yyerror(s)
char *s;
{
fprintf(stderr, "%s\n", s );
}
int yywrap(){
return 1;
}
node* CreateNode(){
node* x = (node*)malloc(sizeof(node));
x->diff = x->val = 0;
for(int i = 0; i < 10; i++){
x->name[i] = '\0';
x->reverse[i] = NULL;
}
/* printf("Build node: %d\n",all_node); */
return x;
}
int FindID(char name[]){
int i = 0;
for(;i < count_id; i++){
if(!strcmp(chain[i]->name,name)){
return i;
}
}
}
void calcVal(node *n){
switch(n->op){
case ROOT:
n->val = n->reverse[0]->val;
break;
case PL:
n->val = n->reverse[0]->val + n->reverse[1]->val;
break;
case MN:
n->val = n->reverse[0]->val - n->reverse[1]->val;
break;
case UMN:
n->val = -n->reverse[0]->val;
break;
case DI:
n->val = n->reverse[0]->val / n->reverse[1]->val;
break;
case MU:
n->val = n->reverse[0]->val * n->reverse[1]->val;
break;
case P:
n->val = pow(n->reverse[0]->val,n->reverse[1]->val);
break;
case L:
n->val = log(n->reverse[0]->val);
break;
case C:
n->val = cos(n->reverse[0]->val);
break;
case S:
n->val = sin(n->reverse[0]->val);
break;
case EX:
n->val = pow(2.71828,n->reverse[0]->val);
break;
}
/* printf("Now opr:%d, value: %lf\n",n->op,n->val); */
}
void Reset(){
count_id = 0;
count_node = 0;
all_node = 0;
}
void ReverseAutoDiff(node *chain[]){
int n = count_id + count_node;
while(count_node--){
node *x = chain[n-1];
if(x->reverse[0]){
switch(x->op){
case ROOT:
x->reverse[0]->diff = 1;
break;
case PL:
x->reverse[0]->diff += x->diff;
x->reverse[1]->diff += x->diff;
break;
case MN:
x->reverse[0]->diff += x->diff;
x->reverse[1]->diff += -x->diff;
break;
case DI:
x->reverse[0]->diff += x->diff / x->reverse[1]->val;
x->reverse[1]->diff += x->diff * x->reverse[0]->val /pow(x->reverse[1]->val,2);
break;
case MU:
x->reverse[0]->diff += x->diff * x->reverse[1]->val;
x->reverse[1]->diff += x->diff * x->reverse[0]->val;
break;
case P:
x->reverse[0]->diff += x->diff * x->reverse[1]->val * pow(x->reverse[0]->val,x->reverse[1]->val-1);
x->reverse[1]->diff += x->diff * log(x->reverse[0]->val) * pow(x->reverse[0]->val,x->reverse[1]->val);
break;
case L:
x->reverse[0]->diff += x->diff / x->reverse[0]->val;
break;
case C:
x->reverse[0]->diff += -sin(x->reverse[0]->val) * x->diff;
break;
case S:
x->reverse[0]->diff += cos(x->reverse[0]->val) * x->diff;
break;
case EX:
x->reverse[0]->diff += pow(2.7182818284590,x->reverse[0]->val) * x->diff;
break;
default:break;
}
}
n--;
}
int c = 0;
while(count_id > c){
node *x = chain[c++];
printf("f-PDF@%s = %lf\n",x->name, x->diff);
}
Reset();
}