|
|
1.1 root 1: struct syl
2: { int op,p1,p2,p3;
3: };
4: #define RET 1
5: #define REVERT 2
6: #define GOTO 3
7: #define X 4
8: #define SLASH 5
9: #define STACK 6
10: #define I 7
11: #define ED 8
12: #define NED 9
13: #define IM 10
14: #define APOS 11
15: #define H 12
16: #define TL 13
17: #define TR 14
18: #define T 15
19: #define COLON 16
20: #define S 17
21: #define SP 18
22: #define SS 19
23: #define P 20
24: #define BN 21
25: #define BZ 22
26: #define F 23
27: #define E 24
28: #define EE 25
29: #define D 26
30: #define G 27
31: #define GE 28
32: #define L 29
33: #define A 30
34: #define AW 31
35: #define O 32
36: extern struct syl syl[];
37: extern int pc,parenlvl,revloc;
38: extern int (*doed)(),(*doned)();
39: extern int (*dorevert)(),(*donewrec)(),(*doend)();
40: extern flag cblank,cplus,workdone;
41: extern int dummy();
42: extern char *fmtbuf;
43: extern int scale;
44: typedef union
45: { float pf;
46: double pd;
47: } ufloat;
48: typedef union
49: { short is;
50: char ic;
51: long il;
52: } uint;
53: #define GET(x) if((x=(*getn)())<0) return(x)
54: #define VAL(x) (x!='\n'?x:' ')
55: #define PUT(x) (*putn)(x)
56: extern int cursor;
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.