23 static Graph	*Nodes_Set = (Graph *) 0;
24 static Graph	*Nodes_Stack = (Graph *) 0;
32 static Graph	*findgraph(char *);
33 static Graph	*pop_stack(void);
39 static int	choueka(Graph *, int);
40 static int	not_new(Graph *);
41 static int	set_prefix(char *, int, Graph *);
43 static void	fsm_trans(Graph *, int, char *);
45 static void	expand_g(Graph *);
51 static void	push_stack(Graph *);
62 	Nodes_Set = (Graph *) 0;  in ini_trans()
63 	Nodes_Stack = (Graph *) 0;  in ini_trans()
73 dump_graph(Graph *g)  in dump_graph()
92 push_stack(Graph *g)  in push_stack()
109 static Graph *
111 {	Graph *g = Nodes_Stack;  in pop_stack()
128 has_clause(int tok, Graph *p, Node *n)  in has_clause()
150 {	Graph *p;  in mk_grn()
170 {	Graph *p;  in mk_red()
207 static Graph *
209 {	Graph	*p;  in findgraph()
220 	return (Graph *) 0;  in findgraph()
225 {	Graph	*p = findgraph(from);  in Addout()
309 choueka(Graph *p, int count)  in choueka()
340 set_prefix(char *pref, int count, Graph *r2)  in set_prefix()
359 fsm_trans(Graph *p, int count, char *curnm)  in fsm_trans()
360 {	Graph	*r;  in fsm_trans()
389 {	Graph	*p;  in mkbuchi()
467 {	Graph	*p1, *g;  in fixinit()
519 {	Graph *g = (Graph *) tl_emalloc(sizeof(Graph));  in ng()
577 not_new(Graph *g)  in not_new()
578 {	Graph	*q1; Node *tmp, *n1, *n2;  in not_new()
661 expand_g(Graph *g)  in expand_g()
860 	Graph	*g;  in trans()
877 	while ((g = Nodes_Stack) != (Graph *) 0)  in trans()