blob: fa60f5113d820e11d3fce524751361b1d4531194 [file] [log] [blame]
Guido van Rossumf70e43a1991-02-19 12:39:46 +00001/***********************************************************
Guido van Rossum5113f5f1992-04-05 14:20:22 +00002Copyright 1991, 1992 by Stichting Mathematisch Centrum, Amsterdam, The
Guido van Rossumf70e43a1991-02-19 12:39:46 +00003Netherlands.
4
5 All Rights Reserved
6
7Permission to use, copy, modify, and distribute this software and its
8documentation for any purpose and without fee is hereby granted,
9provided that the above copyright notice appear in all copies and that
10both that copyright notice and this permission notice appear in
11supporting documentation, and that the names of Stichting Mathematisch
12Centrum or CWI not be used in advertising or publicity pertaining to
13distribution of the software without specific, written prior permission.
14
15STICHTING MATHEMATISCH CENTRUM DISCLAIMS ALL WARRANTIES WITH REGARD TO
16THIS SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
17FITNESS, IN NO EVENT SHALL STICHTING MATHEMATISCH CENTRUM BE LIABLE
18FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
19WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
20ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT
21OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
22
23******************************************************************/
24
Guido van Rossum85a5fbb1990-10-14 12:07:46 +000025/* Parse tree node interface */
26
27typedef struct _node {
28 int n_type;
29 char *n_str;
Guido van Rossum3f5da241990-12-20 15:06:42 +000030 int n_lineno;
Guido van Rossum85a5fbb1990-10-14 12:07:46 +000031 int n_nchildren;
32 struct _node *n_child;
33} node;
34
Guido van Rossum3f5da241990-12-20 15:06:42 +000035extern node *newtree PROTO((int type));
36extern node *addchild PROTO((node *n, int type, char *str, int lineno));
37extern void freetree PROTO((node *n));
Guido van Rossum85a5fbb1990-10-14 12:07:46 +000038
39/* Node access functions */
40#define NCH(n) ((n)->n_nchildren)
41#define CHILD(n, i) (&(n)->n_child[i])
42#define TYPE(n) ((n)->n_type)
43#define STR(n) ((n)->n_str)
44
45/* Assert that the type of a node is what we expect */
46#ifndef DEBUG
47#define REQ(n, type) { /*pass*/ ; }
48#else
49#define REQ(n, type) \
50 { if (TYPE(n) != (type)) { \
51 fprintf(stderr, "FATAL: node type %d, required %d\n", \
52 TYPE(n), type); \
53 abort(); \
54 } }
55#endif
Guido van Rossum3f5da241990-12-20 15:06:42 +000056
57extern void listtree PROTO((node *));
58extern void listnode PROTO((FILE *, node *));