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