|
|
1.1 root 1: /*
2: * Copyright (c) 1980 Regents of the University of California.
3: * All rights reserved. The Berkeley software License Agreement
4: * specifies the terms and conditions for redistribution.
5: */
6:
7: #ifndef lint
8: static char sccsid[] = "@(#)TRdata.c 5.1 (Berkeley) 6/4/85";
9: #endif not lint
10:
11: #include "whoami.h"
12: #include "0.h"
13: #ifdef PI1
14: #ifdef DEBUG
15: char *trnames[] =
16: {
17: 0,
18: "MINUS",
19: "MOD",
20: "DIV",
21: "DIVD",
22: "MULT",
23: "ADD",
24: "SUB",
25: "EQ",
26: "NE",
27: "LT",
28: "GT",
29: "LE",
30: "GE",
31: "NOT",
32: "AND",
33: "OR",
34: "ASGN",
35: "PLUS",
36: "IN",
37: "LISTPP",
38: "PDEC",
39: "FDEC",
40: "PVAL",
41: "PVAR",
42: "PFUNC",
43: "PPROC",
44: "NIL",
45: "STRNG",
46: "CSTRNG",
47: "PLUSC",
48: "MINUSC",
49: "ID",
50: "INT",
51: "FINT",
52: "CINT",
53: "CFINT",
54: "TYPTR",
55: "TYPACK",
56: "TYSCAL",
57: "TYRANG",
58: "TYARY",
59: "TYFILE",
60: "TYSET",
61: "TYREC",
62: "TYFIELD",
63: "TYVARPT",
64: "TYVARNT",
65: "CSTAT",
66: "BLOCK",
67: "BSTL",
68: "LABEL",
69: "PCALL",
70: "FCALL",
71: "CASE",
72: "WITH",
73: "WHILE",
74: "REPEAT",
75: "FORU",
76: "FORD",
77: "GOTO",
78: "IF",
79: "ASRT",
80: "CSET",
81: "RANG",
82: "VAR",
83: "ARGL",
84: "ARY",
85: "FIELD",
86: "PTR",
87: "WEXP",
88: "PROG",
89: "BINT",
90: "CBINT",
91: "IFEL",
92: "IFX",
93: "TYID",
94: "COPSTR",
95: "BOTTLE",
96: "RFIELD",
97: "FLDLST",
98: "LAST"
99: };
100: #endif
101: #endif
102:
103: #ifndef PC
104: #ifndef OBJ
105: char *trdesc[] =
106: {
107: 0,
108: "dp",
109: "dpp",
110: "dpp",
111: "dpp",
112: "dpp",
113: "dpp",
114: "dpp",
115: "dpp",
116: "dpp",
117: "dpp",
118: "dpp",
119: "dpp",
120: "dpp",
121: "dp",
122: "dpp",
123: "dpp",
124: "npp",
125: "dp",
126: "dpp",
127: "pp",
128: "n\"pp",
129: "n\"pp",
130: "pp",
131: "pp",
132: "pp",
133: "p",
134: "d",
135: "dp",
136: "p",
137: "p",
138: "p",
139: "p",
140: "dp",
141: "dp",
142: "p",
143: "p",
144: "np",
145: "np",
146: "np",
147: "npp",
148: "npp",
149: "np",
150: "np",
151: "np",
152: "pp",
153: "nppp",
154: "npp",
155: "npp",
156: "np",
157: "np",
158: "n\"p",
159: "n\"p",
160: "n\"p",
161: "npp",
162: "npp",
163: "npp",
164: "npp",
165: "nppp",
166: "nppp",
167: "n\"",
168: "nppp",
169: "np",
170: "dp",
171: "pp",
172: "n\"p",
173: "p",
174: "p",
175: "pp",
176: "",
177: "ppp",
178: "n\"pp",
179: "dp",
180: "p",
181: "nppp",
182: "nppp",
183: "np",
184: "s",
185: "nnnnn",
186: "npp",
187: "npp",
188: "x"
189: };
190: #endif
191: #endif
192: char *opnames[] =
193: {
194: 0,
195: "unary -",
196: "mod",
197: "div",
198: "/",
199: "*",
200: "+",
201: "-",
202: "=",
203: "<>",
204: "<",
205: ">",
206: "<=",
207: ">=",
208: "not",
209: "and",
210: "or",
211: ":=",
212: "unary +",
213: "in"
214: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.