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
|
/*
* Structure of a tree node.
*/
typedef struct node *nodeptr;
#define YYSTYPE nodeptr
union field {
long n_val; /* integer-valued fields */
char *n_str; /* string-valued fields */
nodeptr n_ptr; /* subtree pointers */
};
struct node {
int n_type; /* node type */
char *n_file; /* name of file containing source program */
int n_line; /* line number in source program */
int n_col; /* column number in source program */
union field n_field[1]; /* variable-content fields */
};
#define NewNode(size) (struct node *)alloc(\
(sizeof(struct node) + (size-1) * sizeof(union field)))
/*
* Macros to access fields of parse tree nodes.
*/
#define TType(t) t->n_type
#define File(t) t->n_file
#define Line(t) t->n_line
#define Col(t) t->n_col
#define Tree0(t) t->n_field[0].n_ptr
#define Tree1(t) t->n_field[1].n_ptr
#define Tree2(t) t->n_field[2].n_ptr
#define Tree3(t) t->n_field[3].n_ptr
#define Val0(t) t->n_field[0].n_val
#define Val1(t) t->n_field[1].n_val
#define Val2(t) t->n_field[2].n_val
#define Val3(t) t->n_field[3].n_val
#define Val4(t) t->n_field[4].n_val
#define Str0(t) t->n_field[0].n_str
#define Str1(t) t->n_field[1].n_str
#define Str2(t) t->n_field[2].n_str
#define Str3(t) t->n_field[3].n_str
/*
* External declarations.
*/
extern nodeptr yylval; /* parser's current token value */
extern struct node tok_loc; /* "model" token holding current location */
/*
* Node types.
*/
#define N_Activat 1 /* activation control structure */
#define N_Alt 2 /* alternation operator */
#define N_Augop 3 /* augmented operator */
#define N_Bar 4 /* generator control structure */
#define N_Binop 5 /* other binary operator */
#define N_Break 6 /* break statement */
#define N_Case 7 /* case statement */
#define N_Ccls 8 /* case clause */
#define N_Clist 9 /* list of case clauses */
#define N_Conj 10 /* conjunction operator */
#define N_Create 11 /* create control structure */
#define N_Cset 12 /* cset literal */
#define N_Elist 14 /* list of expressions */
#define N_Empty 15 /* empty expression or statement */
#define N_Field 16 /* record field reference */
#define N_Id 17 /* identifier token */
#define N_If 18 /* if-then-else statement */
#define N_Int 19 /* integer literal */
#define N_Invok 20 /* invocation */
#define N_Key 21 /* keyword */
#define N_Limit 22 /* LIMIT control structure */
#define N_List 23 /* [ ... ] style list */
#define N_Loop 24 /* while, until, every, or repeat */
#define N_Not 25 /* not prefix control structure */
#define N_Next 26 /* next statement */
#define N_Op 27 /* operator token */
#define N_Proc 28 /* procedure */
#define N_Real 29 /* real literal */
#define N_Res 30 /* reserved word token */
#define N_Ret 31 /* fail, return, or succeed */
#define N_Scan 32 /* scan-using statement */
#define N_Sect 33 /* s[i:j] (section) */
#define N_Slist 34 /* list of statements */
#define N_Str 35 /* string literal */
#define N_Susp 36 /* suspend statement */
#define N_To 37 /* TO operator */
#define N_ToBy 38 /* TO-BY operator */
#define N_Unop 39 /* unary operator */
#define N_Apply 40 /* procedure application */
/*
* Macros for constructing basic nodes.
*/
#define CsetNode(a,b) i_str_leaf(N_Cset,&tok_loc,a,b)
#define IdNode(a) c_str_leaf(N_Id,&tok_loc,a)
#define IntNode(a) c_str_leaf(N_Int,&tok_loc,a)
#define OpNode(a) int_leaf(N_Op,&tok_loc,optab[a].tok.t_type)
#define RealNode(a) c_str_leaf(N_Real,&tok_loc,a)
#define ResNode(a) int_leaf(N_Res,&tok_loc,a)
#define StrNode(a,b) i_str_leaf(N_Str,&tok_loc,a,b)
|
