| #include "bitset.h" /* Sigh... */ |
| #define EMPTY 0 /* Label number 0 is by definition the empty label */ |
| /* An arc from one state to another */ |
| short a_lbl; /* Label of this arc */ |
| short a_arrow; /* State where this arc goes to */ |
| const arc *s_arc; /* Array of arcs */ |
| /* Optional accelerators */ |
| int s_lower; /* Lowest label index */ |
| int s_upper; /* Highest label index */ |
| int *s_accel; /* Accelerator */ |
| int s_accept; /* Nonzero for accepting state */ |
| int d_type; /* Non-terminal this represents */ |
| char *d_name; /* For printing */ |
| state *d_state; /* Array of states */ |
| const dfa *g_dfa; /* Array of DFAs */ |
| int g_start; /* Start symbol of the grammar */ |
| int g_accel; /* Set if accelerators present */ |
| const dfa *PyGrammar_FindDFA(grammar *g, int type); |
| const char *PyGrammar_LabelRepr(label *lb); |
| void PyGrammar_AddAccelerators(grammar *g); |
| void PyGrammar_RemoveAccelerators(grammar *); |
| #endif /* !Py_GRAMMAR_H */ |