-
Notifications
You must be signed in to change notification settings - Fork 0
/
ast.c
642 lines (584 loc) · 24.3 KB
/
ast.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
#include "ast.h"
#include "symboles.h"
//void generateDigraphNameNode(nodeType *n,FILE *fout);
// Cette variable globale vaut au depart 0, et est incrementee a chaque fois
int countDigraph;
// Cette variable permet de declarer des etiquettes a la volee
int currentLabel;
int table_ret[NBRE_FONCTIONS_MAX];
int level=0;
int num_func;
nodeType *createNumericNode(float v)
{
nodeType *p;
if ((p=(nodeType*)malloc(sizeof(nodeType))) == NULL)
{
printf("out of memory error\n");
exit(1);
}
p->type=typeNumeric;
p->t_numeric.valeur=v;
return p;
}
nodeType *createOperatorNode(int oper, int nops, ...)
{
va_list ap;
nodeType *p;
int i;
/* allocate node */
if ((p = (nodeType*)malloc(sizeof(nodeType))) == NULL)
{
printf("out of memory error\n");
exit(1);
}
if ((p->t_oper.op = (nodeType**)malloc(nops * sizeof(nodeType))) == NULL)
{
printf("out of memory error\n");
exit(1);
}
/* copy information */
p->type = typeOperator;
p->t_oper.oper = oper;
p->t_oper.nOperands = nops;
va_start(ap, nops);
for (i = 0; i < nops; i++)
p->t_oper.op[i] = va_arg(ap, nodeType*);
va_end(ap);
return p;
}
nodeType *createIdentifierNode(char *id, int funcNum, int index)
{
nodeType *p;
if ((p=malloc(sizeof(nodeType))) == NULL)
{
printf("out of memory error\n");
exit(1);
}
p->type=typeIdentifier;
p->t_identifier.ident=strdup(id);
p->t_identifier.funcNum=funcNum;
p->t_identifier.index=index;
return p;
}
void generateAsmRec(nodeType *n, FILE *fout, char* nom)
{
int label1, label2; // variables locales de la fonction recursive
char tmpstr[256];
sprintf(tmpstr,"%s_%d",nom,level++);
nom=tmpstr;
if (n==NULL)
return;
//printf("ENFANT DU NOEUD: %s\n", nom);
switch(n->type)
{
case typeNumeric:
{
fprintf(fout, "\tpushr %f\n", n -> t_numeric.valeur);
break;
}
case typeOperator:
{
switch (n -> t_oper.oper)
{
case OPER_ADD:
{
//printf("DANS OPER_ADD\n");
generateAsmRec(n -> t_oper.op[0],fout, "OPER_ADD gauche");
generateAsmRec(n -> t_oper.op[1],fout, "OPER_ADD droite");
fprintf(fout, "\tadd\n");
break;
}
case OPER_SUB:
{
generateAsmRec(n -> t_oper.op[0],fout, "OPER_SUB gauche");
generateAsmRec(n -> t_oper.op[1],fout, "OPER_SUB droite");
fprintf(fout, "\tsub\n");
break;
}
case OPER_MULT:
{
generateAsmRec(n -> t_oper.op[0],fout, "OPER_MULT gauche");
generateAsmRec(n -> t_oper.op[1],fout, "OPER_MULT droite");
fprintf(fout, "\tmult\n");
break;
}
case OPER_DIV:
{
int i;
for(i=0; i < n -> t_oper.nOperands; i++)
{
generateAsmRec(n -> t_oper.op[i],fout, "");
}
fprintf(fout, "\tdiv\n");
break;
}
case OPER_WRITE:
{
//printf("DANS WRITE\n");
generateAsmRec(n -> t_oper.op[0],fout, "OPER_WRITE");
fprintf(fout, "\toutput\n");
break;
}
case OPER_ASSIGN:
{
//printf("DANS OPER_ASSIGN\n");
switch (table_ident_fonctions[n -> t_oper.op[0] -> t_identifier.funcNum][n -> t_oper.op[0] -> t_identifier.index].typv)
{
case TYPE_VARIABLE_GLOBALE:
{
fprintf(fout, "\tpush %d\n", n -> t_oper.op[0] -> t_identifier.index);
generateAsmRec(n -> t_oper.op[1],fout, "OPER_ASSIGN droite");
fprintf(fout, "\tstm\n");
break;
}
case TYPE_VARIABLE_LOCALE:
{
fprintf(fout, "\tlibp %d\n", - table_nbre_formels[n -> t_oper.op[0] -> t_identifier.funcNum] + n -> t_oper.op[0] -> t_identifier.index);
generateAsmRec(n -> t_oper.op[1],fout, "OPER_ASSIGN droite");
fprintf(fout,"\tstm\n");
break;
}
case TYPE_PARAMETRE:
{
fprintf(fout, "\tlibp %d\n", -1 - table_nbre_formels[n -> t_oper.op[0] -> t_identifier.funcNum] + n -> t_oper.op[0] -> t_identifier.index);
generateAsmRec(n -> t_oper.op[1],fout, "OPER_ASSIGN droite");
fprintf(fout,"\tstm\n");
break;
}
}
break;
}
case OPER_SEQUENCE:
{
//printf("DANS OPER_SEQUENCE: %d\n", n -> t_oper.nOperands);
generateAsmRec(n -> t_oper.op[0],fout, "OPER_SEQUENCE gauche");
generateAsmRec(n -> t_oper.op[1],fout, "OPER_SEQUENCE droite");
break;
}
case OPER_RESERVE_SPACE:
{
//printf("DANS RESERVE_SPACE\n");
break;
}
case OPER_MAIN:
{
//printf("DANS MAIN: %d\n", n-> t_oper.nOperands);
fprintf(fout, "main :\n");
generateAsmRec( n -> t_oper.op[0], fout, "MAIN");
break;
}
case OPER_DEF_FONCTION:
{
//printf("DANS MAIN: %d\n", n-> t_oper.nOperands);
fprintf(fout, "%s :\n",table_ident_fonctions[0][num_func].ident);
generateAsmRec( n -> t_oper.op[1], fout, table_ident_fonctions[0][num_func++].ident);
if (table_ret[num_func-1] != 1)
fprintf(fout, "\tret\n");
break;
}
case OPER_APPEL_FONCTION:
{
fprintf(fout, "\tinc 1\n");
generateAsmRec(n -> t_oper.op[1], fout, "");
fprintf(fout, "\tsavebp\n");
fprintf(fout, "\tinc %d\n",table_nbre_variables_locales[table_ident_fonctions[0][n->t_oper.op[0]->t_identifier.index].funcNum] );
fprintf(fout, "\tcall %s\n", n -> t_oper.op[0]->t_identifier.ident);
fprintf(fout, "\tdec %d\n",table_nbre_variables_locales[table_ident_fonctions[0][n->t_oper.op[0]->t_identifier.index].funcNum] );
fprintf(fout, "\trstrbp\n");
fprintf(fout, "\tdec %d\n", table_nbre_formels[table_ident_fonctions[0][n->t_oper.op[0]->t_identifier.index].funcNum]);
break;
}
case OPER_RETURN:
{
fprintf(fout, "\tlibp %d\n", - 2 - table_nbre_formels[table_ident_fonctions[0][num_func-1].funcNum]);
generateAsmRec( n -> t_oper.op[1], fout, "RETURN");
fprintf(fout, "\tstm\n\tret\n");
table_ret[num_func-1] = 1;
break;
}
case OPER_INF:
{
generateAsmRec(n -> t_oper.op[0],fout, "OPER_INF gauche");
generateAsmRec(n -> t_oper.op[1],fout, "OPER_INF droite");
fprintf(fout, "\tls\n");
break;
}
case OPER_SUP:
{
//printf("DANS OPER_SUP\n");
generateAsmRec(n -> t_oper.op[0],fout, "OPER_SUP gauche");
generateAsmRec(n -> t_oper.op[1],fout, "OPER_SUP droite");
fprintf(fout, "\tgt\n");
break;
}
case OPER_EQ:
{
int i;
for(i=0; i < n -> t_oper.nOperands; i++)
{
generateAsmRec(n -> t_oper.op[i],fout, "OPER_EQ");
}
fprintf(fout, "\teq\n");
break;
}
case OPER_NE:
{
generateAsmRec(n -> t_oper.op[0],fout,"");
generateAsmRec(n -> t_oper.op[1],fout,"");
fprintf(fout, "\tnot\n");
break;
}
case OPER_IF:
{
label1 = currentLabel;
generateAsmRec(n -> t_oper.op[0],fout, "OPER_IF gauche");
fprintf(fout, "\tjf L%.3d\n",currentLabel++);
generateAsmRec(n -> t_oper.op[1],fout, "OPER_IF milieu");
label2 = currentLabel;
if (n -> t_oper.op[2] && n -> t_oper.op[1] -> t_oper.oper != OPER_RETURN)
fprintf(fout, "\tjp L%.3d\n",currentLabel++);
fprintf(fout, "L%.3d :\n",label1);
generateAsmRec(n -> t_oper.op[2],fout, "OPER_IF droite");
if (n -> t_oper.op[2] && n -> t_oper.op[1] -> t_oper.oper != OPER_RETURN)
fprintf(fout, "L%.3d :\n",label2);
break;
}
case OPER_WHILE:
{
//printf("DANS BOUCLE WHILE\n");
label1 = currentLabel;
fprintf(fout, "L%.3d :\n",currentLabel++);
generateAsmRec(n -> t_oper.op[0],fout, "OPER_WHILE gauche");
label2 = currentLabel;
fprintf(fout, "\tjf L%.3d\n",currentLabel++);
generateAsmRec(n -> t_oper.op[1],fout, "OPER_WHILE droite");
fprintf(fout, "\tjp L%.3d\n",label1);
fprintf(fout, "L%.3d :\n", label2);
break;
}
case OPER_FOR:
{
//printf("DANS BOUCLE WHILE\n");
generateAsmRec(n -> t_oper.op[0],fout, "OPER_FOR");
label1 = currentLabel;
fprintf(fout, "L%.3d :\n",currentLabel++);
generateAsmRec(n -> t_oper.op[1],fout, "");
label2 = currentLabel;
fprintf(fout, "\tjf L%.3d\n",currentLabel++);
generateAsmRec(n -> t_oper.op[3],fout, "");
generateAsmRec(n -> t_oper.op[2],fout, "");
fprintf(fout, "\tjp L%.3d\n",label1);
fprintf(fout, "L%.3d :\n", label2);
break;
}
case OPER_DO_WHILE:
{
//printf("DANS BOUCLE WHILE\n");
generateAsmRec(n -> t_oper.op[1], fout, "OPER_DO_WHILE");
label1 = currentLabel;
fprintf(fout, "L%.3d :\n",currentLabel++);
generateAsmRec(n -> t_oper.op[0],fout, "OPER_WHILE gauche");
label2 = currentLabel;
fprintf(fout, "\tjf L%.3d\n",currentLabel++);
generateAsmRec(n -> t_oper.op[1],fout, "OPER_WHILE droite");
fprintf(fout, "\tjp L%.3d\n",label1);
fprintf(fout, "L%.3d :\n", label2);
break;
}
default:
{
printf("operation: %d\n", n -> t_oper.oper );
printf("OPERATION INCONNUE!\n");
exit(1);
}
}
break;
}
case typeIdentifier:
{
switch (table_ident_fonctions[n->t_identifier.funcNum][n->t_identifier.index].typv)
{
case TYPE_VARIABLE_GLOBALE:
{
fprintf(fout, "\tpush %d\n", n -> t_identifier.index);
fprintf(fout,"\tmts\n");
break;
}
case TYPE_VARIABLE_LOCALE:
{
fprintf(fout, "\tlibp %d\n", - table_nbre_formels[n->t_identifier.funcNum] + n -> t_identifier.index);
fprintf(fout,"\tmts\n");
break;
}
case TYPE_PARAMETRE:
{
fprintf(fout, "\tlibp %d\n", -1 - table_nbre_formels[n->t_identifier.funcNum] + n -> t_identifier.index);
fprintf(fout,"\tmts\n");
break;
}
}
break;
}
default:
{
printf("ERREUR INCONNUE!\n");
exit(1);
}
}
//printf("FIN DU NOEUD %s\n \n", nom);
level--;
}
void generateAsmExpression(nodeType *n, FILE *fout)
{
if (n==NULL)
return;
}
void generateAsm(nodeType *n, char *filename)
{
FILE *fout;
int i;
num_func = table_nbre_variables_globales[0];
currentLabel=0;
for (i = 0; i < NBRE_FONCTIONS_MAX; i++)
table_ret[i] = 0;
fout=fopen(filename,"w");
fprintf(fout, "\tinc %d\n", table_nbre_variables_globales[0]);
fprintf(fout, "\tjp main\n");
generateAsmRec(n,fout, "");
fprintf(fout,"\thalt\n");
fprintf(fout,"\tend\n");
fclose(fout);
}
void generateDigraphNameNode(nodeType *n,FILE *fout)
{
if (n==NULL)
return;
switch (n->type)
{
case typeNumeric:
{
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"%f\"]\n",n->digraphNode,n->t_numeric.valeur);
}
break;
case typeIdentifier:
{
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"%s\"]\n",n->digraphNode,n->t_identifier.ident);
}
break;
case typeOperator:
{
switch (n->t_oper.oper)
{
case OPER_APPEL_FONCTION:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"appel fonc\"]\n",n->digraphNode);
break;
case OPER_ADD:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"+\"]\n",n->digraphNode);
break;
case OPER_SUB:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"-\"]\n",n->digraphNode);
break;
case OPER_MULT:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"*\"]\n",n->digraphNode);
break;
case OPER_DIV:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"/\"]\n",n->digraphNode);
break;
case OPER_INF:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"<\"]\n",n->digraphNode);
break;
case OPER_SUP:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\">\"]\n",n->digraphNode);
break;
case OPER_EQ:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"==\"]\n",n->digraphNode);
break;
case OPER_NE:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"!=\"]\n",n->digraphNode);
break;
case OPER_NOT:
generateDigraphNameNode(n->t_oper.op[0],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"not\"]\n",n->digraphNode);
break;
case OPER_SKIP:
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"skip\"]\n",n->digraphNode);
break;
case OPER_RETURN:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"return\"]\n",n->digraphNode);
break;
case OPER_WRITE:
generateDigraphNameNode(n->t_oper.op[0],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"write\"]\n",n->digraphNode);
break;
case OPER_DEF_FONCTION:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"def_fonction\"]\n",n->digraphNode);
break;
case OPER_ASSIGN:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"=\"]\n",n->digraphNode);
break;
case OPER_WHILE:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"while\"]\n",n->digraphNode);
break;
case OPER_DO_WHILE:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"do_while\"]\n",n->digraphNode);
break;
case OPER_FOR:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
generateDigraphNameNode(n->t_oper.op[2],fout);
generateDigraphNameNode(n->t_oper.op[3],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"for\"]\n",n->digraphNode);
break;
case OPER_IF:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
if (n->t_oper.nOperands==3)
generateDigraphNameNode(n->t_oper.op[2],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"if\"]\n",n->digraphNode);
break;
case OPER_SEQUENCE:
generateDigraphNameNode(n->t_oper.op[0],fout);
generateDigraphNameNode(n->t_oper.op[1],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\";\"]\n",n->digraphNode);
break;
case OPER_RESERVE_SPACE:
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"reserve_space\"]\n",n->digraphNode);
break;
case OPER_MAIN:
generateDigraphNameNode(n->t_oper.op[0],fout);
n->digraphNode=countDigraph++;
fprintf(fout,"\tA%3.3d [label=\"main\"]\n",n->digraphNode);
break;
default:
break;
}
}
break;
}
}
void generateDigraphEdges(nodeType *n,FILE *fout)
{
if (n==NULL)
return;
switch (n->type)
{
case typeNumeric:
case typeIdentifier:
break;
case typeOperator:
{
//printf("oper=%d\n",n->t_oper.oper);
switch (n->t_oper.oper)
{
case OPER_ADD:
case OPER_SUB:
case OPER_MULT:
case OPER_DIV:
case OPER_INF:
case OPER_SUP:
case OPER_EQ:
case OPER_NE:
case OPER_WHILE:
case OPER_DO_WHILE:
case OPER_FOR:
case OPER_APPEL_FONCTION:
case OPER_DEF_FONCTION:
case OPER_ASSIGN:
case OPER_SEQUENCE:
case OPER_RETURN:
fprintf(fout,"\tA%3.3d -> A%3.3d\n", n->digraphNode,n->t_oper.op[0]->digraphNode);
fprintf(fout,"\tA%3.3d -> A%3.3d\n", n->digraphNode,n->t_oper.op[1]->digraphNode);
generateDigraphEdges(n->t_oper.op[0],fout);
generateDigraphEdges(n->t_oper.op[1],fout);
break;
case OPER_IF:
fprintf(fout,"\tA%3.3d -> A%3.3d\n", n->digraphNode,n->t_oper.op[0]->digraphNode);
fprintf(fout,"\tA%3.3d -> A%3.3d\n", n->digraphNode,n->t_oper.op[1]->digraphNode);
if (n->t_oper.nOperands==3)
fprintf(fout,"\tA%3.3d -> A%3.3d\n", n->digraphNode,n->t_oper.op[2]->digraphNode);
generateDigraphEdges(n->t_oper.op[0],fout);
generateDigraphEdges(n->t_oper.op[1],fout);
if (n->t_oper.nOperands==3)
generateDigraphEdges(n->t_oper.op[2],fout);
break;
case OPER_WRITE:
case OPER_NOT:
case OPER_MAIN:
fprintf(fout,"\tA%3.3d -> A%3.3d\n", n->digraphNode,n->t_oper.op[0]->digraphNode);
generateDigraphEdges(n->t_oper.op[0],fout);
break;
case OPER_SKIP:
case OPER_RESERVE_SPACE:
break;
default:
break;
}
}
break;
}
}
void generateDigraph(nodeType *n)
{
FILE *fout;
fout=fopen("res.dot","w");
countDigraph=0;
fprintf(fout,"digraph {\n");
printf("generateDigraphNameNode\n");
generateDigraphNameNode(n,fout);
printf("generateDigraphEdges\n");
generateDigraphEdges(n,fout);
fprintf(fout,"}\n");
fclose(fout);
system("dot -Tpng res.dot -o res.png");
}