|
|
1.1.1.3 ! root 1: /* xebec.h,v 1.2 1993/05/20 05:28:40 cgd Exp */
1.1 root 2:
3: union llattrib {
4: struct {
5: char *address; } ID;
6: int STRUCT;
7: int SYNONYM;
8: struct {
9: char *address; } PREDICATE;
10: struct {
11: char *address; } ACTION;
12: int PROTOCOL;
13: int LBRACK;
14: int RBRACK;
15: int LANGLE;
16: int EQUAL;
17: int COMMA;
18: int STAR;
19: int EVENTS;
20: int TRANSITIONS;
21: int INCLUDE;
22: int STATES;
23: int SEMI;
24: struct {
25: char *address; } PCB;
26: int DEFAULT;
27: int NULLACTION;
28: int SAME;
29: struct {
30: char *address; int isevent; } pcb;
31: struct {
32: int type; } syn;
33: struct {
34: struct Object *setnum; } setlist;
35: struct {
36: struct Object *setnum; } setlisttail;
37: struct {
38: unsigned char type; } part;
39: struct {
40: unsigned char type; } parttail;
41: struct {
42: unsigned char type; char *address; } partrest;
43: struct {
44: struct Object *object; } setstruct;
45: struct {
46: unsigned char type,keep; char *address; struct Object *object; } setdef;
47: int translist;
48: int transition;
49: struct {
50: struct Object *object; } event;
51: struct {
52: struct Object *object; } oldstate;
53: struct {
54: struct Object *object; } newstate;
55: struct {
56: char *string; } predicatepart;
57: struct {
58: char *string; struct Object *oldstate; struct Object *newstate; } actionpart;
59: };
60: #define LLTERM 23
61: #define LLSYM 44
62: #define LLPROD 38
63:
64: #define LLINF 10000
65:
66: #define T_ID 1
67: #define T_STRUCT 2
68: #define T_SYNONYM 3
69: #define T_PREDICATE 4
70: #define T_ACTION 5
71: #define T_PROTOCOL 6
72: #define T_LBRACK 7
73: #define T_RBRACK 8
74: #define T_LANGLE 9
75: #define T_EQUAL 10
76: #define T_COMMA 11
77: #define T_STAR 12
78: #define T_EVENTS 13
79: #define T_TRANSITIONS 14
80: #define T_INCLUDE 15
81: #define T_STATES 16
82: #define T_SEMI 17
83: #define T_PCB 18
84: #define T_DEFAULT 19
85: #define T_NULLACTION 20
86: #define T_SAME 21
87: #define T_ENDMARKER 22
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.