Annotation of 43BSDReno/pgrm/pascal/src/tree.h, revision 1.1.1.1

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:  *     @(#)tree.h      5.1 (Berkeley) 6/5/85
                      7:  */
                      8: 
                      9: #define T_MINUS 1
                     10: #define T_MOD 2
                     11: #define T_DIV 3
                     12: #define T_DIVD 4
                     13: #define T_MULT 5
                     14: #define T_ADD 6
                     15: #define T_SUB 7
                     16: #define T_EQ 8
                     17: #define T_NE 9
                     18: #define T_LT 10
                     19: #define T_GT 11
                     20: #define T_LE 12
                     21: #define T_GE 13
                     22: #define T_NOT 14
                     23: #define T_AND 15
                     24: #define T_OR 16
                     25: #define T_ASGN 17
                     26: #define T_PLUS 18
                     27: #define T_IN 19
                     28: #define T_LISTPP 20
                     29: #define T_PDEC 21
                     30: #define T_FDEC 22
                     31: #define T_PVAL 23
                     32: #define T_PVAR 24
                     33: #define T_PFUNC 25
                     34: #define T_PPROC 26
                     35: #define T_NIL 27
                     36: #define T_STRNG 28
                     37: #define T_CSTRNG 29
                     38: #define T_PLUSC 30
                     39: #define T_MINUSC 31
                     40: #define T_ID 32
                     41: #define T_INT 33
                     42: #define T_FINT 34
                     43: #define T_CINT 35
                     44: #define T_CFINT 36
                     45: #define T_TYPTR 37
                     46: #define T_TYPACK 38
                     47: #define T_TYSCAL 39
                     48: #define T_TYRANG 40
                     49: #define T_TYARY 41
                     50: #define T_TYFILE 42
                     51: #define T_TYSET 43
                     52: #define T_TYREC 44
                     53: #define T_TYFIELD 45
                     54: #define T_TYVARPT 46
                     55: #define T_TYVARNT 47
                     56: #define T_CSTAT 48
                     57: #define T_BLOCK 49
                     58: #define T_BSTL 50
                     59: #define T_LABEL 51
                     60: #define T_PCALL 52
                     61: #define T_FCALL 53
                     62: #define T_CASE 54
                     63: #define T_WITH 55
                     64: #define T_WHILE 56
                     65: #define T_REPEAT 57
                     66: #define T_FORU 58
                     67: #define T_FORD 59
                     68: #define T_GOTO 60
                     69: #define T_IF 61
                     70: #define T_CSET 63
                     71: #define T_RANG 64
                     72: #define T_VAR 65
                     73: #define T_ARGL 66
                     74: #define T_ARY 67
                     75: #define T_FIELD 68
                     76: #define T_PTR 69
                     77: #define T_WEXP 70
                     78: #define T_PROG 71
                     79: #define T_BINT 72
                     80: #define T_CBINT 73
                     81: #define T_IFEL 74
                     82: #define T_IFX 75
                     83: #define T_TYID 76
                     84: #define T_COPSTR 77
                     85: #define T_BOTTLE 78
                     86: #define T_RFIELD 79
                     87: #define T_FLDLST 80
                     88: #define T_LAST 81
                     89: #define T_TYCRANG 82
                     90: #define T_TYCARY 83

unix.superglobalmegacorp.com

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.