|
|
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[] = "@(#)opinfo.c 5.1 (Berkeley) 6/6/85";
9: #endif not lint
10:
11: /*
12: * Operator information structure.
13: */
14:
15: #include "defs.h"
16: #include "opinfo.h"
17:
18: OPINFO opinfo[] ={
19: /* O_NOP */ 0, 0,
20: /* O_NAME */ LEAF, 0,
21: /* O_QNAME */ LEAF, "$",
22: /* O_LCON */ LEAF, 0,
23: /* O_FCON */ LEAF, 0,
24: /* O_SCON */ LEAF, 0,
25: /* O_INDEX */ UNARY, 0,
26: /* O_INDIR */ UNARY, "^",
27: /* O_RVAL */ UNARY, 0,
28: /* O_COMMA */ BINARY, ",",
29: /* O_ITOF */ UNARY|INTOP, 0,
30: /* O_ADD */ BINARY|INTOP, "+",
31: /* O_ADDF */ BINARY|REALOP, "+",
32: /* O_SUB */ BINARY|INTOP, "-",
33: /* O_SUBF */ BINARY|REALOP, "-",
34: /* O_NEG */ UNARY|INTOP, "-",
35: /* O_NEGF */ UNARY|REALOP, "-",
36: /* O_MUL */ BINARY|INTOP, "*",
37: /* O_MULF */ BINARY|REALOP, "*",
38: /* O_DIVF */ BINARY|REALOP, "/",
39: /* O_DIV */ BINARY|INTOP, " div ",
40: /* O_MOD */ BINARY|INTOP, " mod ",
41: /* O_AND */ BINARY|INTOP, " and ",
42: /* O_OR */ BINARY|INTOP, " or ",
43: /* O_LT */ BINARY|INTOP, " < ",
44: /* O_LTF */ BINARY|REALOP, " < ",
45: /* O_LE */ BINARY|INTOP, " <= ",
46: /* O_LEF */ BINARY|REALOP, " <= ",
47: /* O_GT */ BINARY|INTOP, " > ",
48: /* O_GTF */ BINARY|REALOP, " > ",
49: /* O_GE */ BINARY|INTOP, " >= ",
50: /* O_GEF */ BINARY|REALOP, " >= ",
51: /* O_EQ */ BINARY|INTOP, " = ",
52: /* O_EQF */ BINARY|REALOP, " = ",
53: /* O_NE */ BINARY|INTOP, " <> ",
54: /* O_NEF */ BINARY|REALOP, " <> ",
55: /* O_ASSIGN */ BINARY, " := ",
56: /* O_CHFILE */ 0, NIL,
57: /* O_CONT */ 0, NIL,
58: /* O_LIST */ 0, NIL,
59: /* O_NEXT */ 0, NIL,
60: /* O_PRINT */ 0, NIL,
61: /* O_STEP */ 0, NIL,
62: /* O_WHATIS */ 0, NIL,
63: /* O_WHERE */ 0, NIL,
64: /* O_XI */ 0, NIL,
65: /* O_XD */ 0, NIL,
66: /* O_CALL */ 0, NIL,
67: /* O_EDIT */ 0, NIL,
68: /* O_DUMP */ 0, NIL,
69: /* O_HELP */ 0, NIL,
70: /* O_REMAKE */ 0, NIL,
71: /* O_RUN */ 0, NIL,
72: /* O_SOURCE */ 0, NIL,
73: /* O_STATUS */ 0, NIL,
74: /* O_TRACE */ 0, NIL,
75: /* O_TRACEI */ 0, NIL,
76: /* O_STOP */ 0, NIL,
77: /* O_STOPI */ 0, NIL,
78: /* O_DELETE */ 0, NIL,
79: /* O_WHICH */ 0, NIL,
80: /* O_QLINE */ LEAF, NIL,
81: /* O_ALIAS */ LEAF, NIL,
82: /* O_GRIPE */ 0, NIL,
83: };
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.