|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that the above copyright notice and this paragraph are ! 7: * duplicated in all such forms and that any documentation, ! 8: * advertising materials, and other materials related to such ! 9: * distribution and use acknowledge that the software was developed ! 10: * by the University of California, Berkeley. The name of the ! 11: * University may not be used to endorse or promote products derived ! 12: * from this software without specific prior written permission. ! 13: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 14: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 15: * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 16: * ! 17: * @(#)token.h 3.7 (Berkeley) 6/29/88 ! 18: */ ! 19: ! 20: #define token (cx.x_token) ! 21: #define token_num (cx.x_val.v_num) ! 22: #define token_str (cx.x_val.v_str) ! 23: ! 24: #define T_EOL 1 ! 25: #define T_EOF 2 ! 26: #define T_COMP 3 ! 27: #define T_PLUS 4 ! 28: #define T_MINUS 5 ! 29: #define T_MUL 6 ! 30: #define T_DIV 7 ! 31: #define T_LP 8 ! 32: #define T_RP 9 ! 33: #define T_LB 10 ! 34: #define T_RB 11 ! 35: #define T_DOLLAR 12 ! 36: #define T_COMMA 13 ! 37: #define T_QUEST 14 ! 38: #define T_COLON 15 ! 39: #define T_CHAR 16 ! 40: #define T_STR 17 ! 41: #define T_NUM 18 ! 42: #define T_MOD 19 ! 43: #define T_XOR 20 ! 44: #define T_DQ 21 /* $? */ ! 45: #define T_GE 22 ! 46: #define T_RS 23 ! 47: #define T_GT 24 ! 48: #define T_LE 25 ! 49: #define T_LS 26 ! 50: #define T_LT 27 ! 51: #define T_EQ 28 ! 52: #define T_ASSIGN 29 ! 53: #define T_NE 30 ! 54: #define T_NOT 31 ! 55: #define T_ANDAND 32 ! 56: #define T_AND 33 ! 57: #define T_OROR 34 ! 58: #define T_OR 35 ! 59: ! 60: #define T_IF 40 ! 61: #define T_THEN 41 ! 62: #define T_ELSIF 42 ! 63: #define T_ELSE 43 ! 64: #define T_ENDIF 44
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.