-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnfa-state.c
180 lines (137 loc) · 2.84 KB
/
nfa-state.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
/*
* Thompson NFA State
*
* Copyright (c) 2020-2021 Alexei A. Smekalkine <ikle@ikle.ru>
*
* SPDX-License-Identifier: BSD-2-Clause
*/
#include <errno.h>
#include <stdlib.h>
#include "nfa-state.h"
static struct nfa_state *
nfa_state (int from, int to, struct nfa_state *a, struct nfa_state *b)
{
struct nfa_state *o;
if ((o = malloc (sizeof (*o))) == NULL)
return NULL;
o->next = NULL;
o->from = from;
o->to = to;
o->index = 0;
o->out[0] = a;
o->out[1] = b;
o->color = 1;
return o;
}
void nfa_state_free (struct nfa_state *o)
{
struct nfa_state *next;
for (; o != NULL; o = next) {
next = o->next;
free (o);
}
}
void nfa_state_order (struct nfa_state *o)
{
size_t i;
for (i = 0; o != NULL; ++i, o = o->next)
o->index = i;
}
size_t nfa_state_count (const struct nfa_state *o)
{
size_t count;
for (count = 0; o != NULL; o = o->next)
++count;
return count;
}
void nfa_state_color (struct nfa_state *o, int color)
{
for (; o != NULL; o = o->next)
o->color = color;
}
/* NFA leaf node constructors */
struct nfa_state *nfa_state_atom (int c)
{
if (c < 0) {
errno = EINVAL;
return NULL;
}
return nfa_state (c, c, NULL, NULL);
}
struct nfa_state *nfa_state_range (int from, int to)
{
if (from < 0 || to < 0) {
errno = EINVAL;
return NULL;
}
return nfa_state (from, to, NULL, NULL);
}
/* NFA node helper ops */
static struct nfa_state *nfa_split (struct nfa_state *a, struct nfa_state *b)
{
struct nfa_state *o;
if ((o = nfa_state (NFA_SPLIT, 0, a, b)) == NULL)
goto no_state;
return o;
no_state:
nfa_state_free (a);
nfa_state_free (b);
return NULL;
}
static void nfa_merge (struct nfa_state *o, struct nfa_state *b)
{
struct nfa_state *tail;
for (tail = o; tail->next != NULL; tail = tail->next) {}
tail->next = b;
}
static void nfa_join (struct nfa_state *a, struct nfa_state *b)
{
for (; a != NULL; a = a->next) {
if (a->out[0] == NULL)
a->out[0] = b;
if (a->out[1] == NULL)
a->out[1] = b;
}
}
/* NFA compound node constructors */
struct nfa_state *nfa_state_cat (struct nfa_state *a, struct nfa_state *b)
{
nfa_join (a, b);
nfa_merge (a, b);
return a;
}
struct nfa_state *nfa_state_union (struct nfa_state *a, struct nfa_state *b)
{
struct nfa_state *o;
if ((o = nfa_split (a, b)) == NULL)
return NULL;
nfa_merge (o, a);
nfa_merge (o, b);
return o;
}
struct nfa_state *nfa_state_opt (struct nfa_state *a)
{
struct nfa_state *o;
if ((o = nfa_split (a, NULL)) == NULL)
return NULL;
nfa_merge (o, a);
return o;
}
struct nfa_state *nfa_state_star (struct nfa_state *a)
{
struct nfa_state *o;
if ((o = nfa_split (a, NULL)) == NULL)
return NULL;
nfa_join (a, o);
nfa_merge (o, a);
return o;
}
struct nfa_state *nfa_state_plus (struct nfa_state *a)
{
struct nfa_state *o;
if ((o = nfa_split (a, NULL)) == NULL)
return NULL;
nfa_join (a, o);
nfa_merge (a, o);
return a;
}