-
Notifications
You must be signed in to change notification settings - Fork 0
/
node.c
executable file
·68 lines (54 loc) · 1.27 KB
/
node.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
/*
Name: node.c
Purpose: Parse tree data structure for wxBasic
Author: David Cuny
Copyright: (c) 2001 David Cuny <dcuny@lanset.com>
Licence: LGPL
*/
Node *opNode( int op, Node *left, Node *right )
{
Node *node;
node = (Node *) eMalloc( sizeof( Node ) );
node->op = op;
node->left = left;
node->right = right;
node->next = NULL;
node->trace = -1;
return node;
}
Node *intNode( int op, int value, Node *left, Node *right )
{
Node *node;
node = opNode( op, left, right );
node->value.iValue = value;
return node;
}
Node *floatNode( int op, Number value, Node *left, Node *right )
{
Node *node;
node = opNode( op, left, right );
node->value.fValue = value;
return node;
}
Node *stringNode( int op, char *string, Node *left, Node *right )
{
Node *node;
node = opNode( op, left, right );
node->value.string = string;
return node;
}
Node *symbolNode( int op, Symbol *symbol, Node *left, Node *right )
{
Node *node;
node = opNode( op, left, right );
node->value.symbol = symbol;
return node;
}
void freeNode( Node *node )
{
if (node != NULL) {
freeNode( node->left );
freeNode( node->right );
}
free( node );
}