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
|
#include <stdio.h>
#include <stdlib.h>
#include "grap.h"
#include "y.tab.h"
typedef struct {
Obj *var; /* index variable */
double to; /* limit */
double by;
int op; /* operator */
char *str; /* string to push back */
} For;
#define MAXFOR 10
For forstk[MAXFOR]; /* stack of for loops */
For *forp = forstk; /* pointer to current top */
void forloop(Obj *var, double from, double to, int op, double by, char *str) /* set up a for loop */
{
fprintf(tfd, "# for %s from %g to %g by %c %g \n",
var->name, from, to, op, by);
if (++forp >= forstk+MAXFOR)
ERROR "for loop nested too deep" FATAL;
forp->var = var;
forp->to = to;
forp->op = op;
forp->by = by;
forp->str = str;
setvar(var, from);
nextfor();
unput('\n');
}
void nextfor(void) /* do one iteration of a for loop */
{
/* BUG: this should depend on op and direction */
if (forp->var->fval > SLOP * forp->to) { /* loop is done */
free(forp->str);
if (--forp < forstk)
ERROR "forstk popped too far" FATAL;
} else { /* another iteration */
pushsrc(String, "\nEndfor\n");
pushsrc(String, forp->str);
}
}
void endfor(void) /* end one iteration of for loop */
{
switch (forp->op) {
case '+':
case ' ':
forp->var->fval += forp->by;
break;
case '-':
forp->var->fval -= forp->by;
break;
case '*':
forp->var->fval *= forp->by;
break;
case '/':
forp->var->fval /= forp->by;
break;
}
nextfor();
}
char *ifstat(double expr, char *thenpart, char *elsepart)
{
dprintf("if %g then <%s> else <%s>\n", expr, thenpart, elsepart? elsepart : "");
if (expr) {
unput('\n');
pushsrc(Free, thenpart);
pushsrc(String, thenpart);
unput('\n');
if (elsepart)
free(elsepart);
return thenpart; /* to be freed later */
} else {
free(thenpart);
if (elsepart) {
unput('\n');
pushsrc(Free, elsepart);
pushsrc(String, elsepart);
unput('\n');
}
return elsepart;
}
}
|