cdo/regex-engine
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Execute NFA rather than inspecting in construct_tests

Browse Source
This commit is contained in:
Camden Dixie O'Brien
2024-10-27 14:18:46 +00:00
parent d4b7a0a25c
commit 3eb782f59f
1 changed files with 41 additions and 55 deletions
Download Patch File Download Diff File Expand all files Collapse all files

96
tests/construct_tests.c
View File

@@ -6,6 +6,30 @@
#include "construct.h" #include "construct.h"
#include "testing.h" #include "testing.h"
static bool
accepts_from_state(const fsa_t *nfa, int state_id, const char *input)
{
const fsa_state_t *state = &nfa->states[state_id];
if ('\0' == *input)
return state->final;
for (int i = 0; i < state->count; ++i) {
if (EPSILON == state->rules[i].input
&& accepts_from_state(nfa, state->rules[i].next, input))
return true;
if (*input == state->rules[i].input
&& accepts_from_state(nfa, state->rules[i].next, input + 1))
return true;
}
return false;
}
static bool accepts(const fsa_t *nfa, const char *input)
{
return accepts_from_state(nfa, nfa->initial, input);
}
static void test_empty_expression(void) static void test_empty_expression(void)
{ {
regex_term_t *terms = malloc(1 * sizeof(regex_term_t)); regex_term_t *terms = malloc(1 * sizeof(regex_term_t));
@@ -20,9 +44,7 @@ static void test_empty_expression(void)
fsa_t fsa; fsa_t fsa;
construct(&regex, &fsa); construct(&regex, &fsa);
ASSERT_EQ(1, fsa.count); ASSERT_TRUE(accepts(&fsa, ""));
ASSERT_TRUE(fsa.states[fsa.initial].final);
ASSERT_EQ(0, fsa.states[fsa.initial].count);
regex_free(&regex); regex_free(&regex);
fsa_free(&fsa); fsa_free(&fsa);
@@ -43,14 +65,8 @@ static void test_literal_expression(void)
fsa_t fsa; fsa_t fsa;
construct(&regex, &fsa); construct(&regex, &fsa);
const fsa_state_t *initial = &fsa.states[fsa.initial]; ASSERT_TRUE(accepts(&fsa, "a"));
ASSERT_EQ(2, fsa.count); ASSERT_FALSE(accepts(&fsa, "b"));
ASSERT_EQ(1, initial->count);
ASSERT_EQ('a', initial->rules[0].input);
const int next = initial->rules[0].next;
ASSERT_TRUE(fsa.states[next].final);
ASSERT_EQ(0, fsa.states[next].count);
regex_free(&regex); regex_free(&regex);
fsa_free(&fsa); fsa_free(&fsa);
@@ -73,30 +89,10 @@ static void test_sequence(void)
fsa_t fsa; fsa_t fsa;
construct(&regex, &fsa); construct(&regex, &fsa);
int next = fsa.initial; ASSERT_TRUE(accepts(&fsa, "abc"));
const fsa_state_t *state; ASSERT_FALSE(accepts(&fsa, "a"));
ASSERT_FALSE(accepts(&fsa, "ab"));
state = &fsa.states[next]; ASSERT_FALSE(accepts(&fsa, "d"));
ASSERT_FALSE(state->final);
ASSERT_EQ(1, state->count);
ASSERT_EQ('a', state->rules[0].input);
next = state->rules[0].next;
state = &fsa.states[next];
ASSERT_FALSE(state->final);
ASSERT_EQ(1, state->count);
ASSERT_EQ('b', state->rules[0].input);
next = state->rules[0].next;
state = &fsa.states[next];
ASSERT_FALSE(state->final);
ASSERT_EQ(1, state->count);
ASSERT_EQ('c', state->rules[0].input);
next = state->rules[0].next;
state = &fsa.states[next];
ASSERT_TRUE(state->final);
ASSERT_EQ(0, state->count);
regex_free(&regex); regex_free(&regex);
fsa_free(&fsa); fsa_free(&fsa);
@@ -120,13 +116,10 @@ static void test_union(void)
fsa_t fsa; fsa_t fsa;
construct(&regex, &fsa); construct(&regex, &fsa);
const fsa_state_t *initial = &fsa.states[fsa.initial]; ASSERT_TRUE(accepts(&fsa, "a"));
ASSERT_EQ(3, initial->count); ASSERT_TRUE(accepts(&fsa, "b"));
for (int i = 0; i < 3; ++i) { ASSERT_TRUE(accepts(&fsa, "c"));
ASSERT_EQ(literals[i], initial->rules[i].input); ASSERT_FALSE(accepts(&fsa, "d"));
const int next = initial->rules[i].next;
ASSERT_TRUE(fsa.states[next].final);
}
regex_free(&regex); regex_free(&regex);
fsa_free(&fsa); fsa_free(&fsa);
@@ -146,11 +139,10 @@ static void test_star(void)
fsa_t fsa; fsa_t fsa;
construct(&regex, &fsa); construct(&regex, &fsa);
const fsa_state_t *initial = &fsa.states[fsa.initial]; ASSERT_TRUE(accepts(&fsa, ""));
ASSERT_TRUE(initial->final); ASSERT_TRUE(accepts(&fsa, "a"));
ASSERT_EQ(1, initial->count); ASSERT_TRUE(accepts(&fsa, "aaaaaa"));
ASSERT_EQ('a', initial->rules[0].input); ASSERT_FALSE(accepts(&fsa, "b"));
ASSERT_EQ(fsa.initial, initial->rules[0].next);
regex_free(&regex); regex_free(&regex);
fsa_free(&fsa); fsa_free(&fsa);
@@ -179,14 +171,8 @@ static void test_subexpression(void)
fsa_t fsa; fsa_t fsa;
construct(&regex, &fsa); construct(&regex, &fsa);
const fsa_state_t *initial = &fsa.states[fsa.initial]; ASSERT_TRUE(accepts(&fsa, "a"));
ASSERT_EQ(2, fsa.count); ASSERT_FALSE(accepts(&fsa, "b"));
ASSERT_EQ(1, initial->count);
ASSERT_EQ('a', initial->rules[0].input);
const int next = initial->rules[0].next;
ASSERT_TRUE(fsa.states[next].final);
ASSERT_EQ(0, fsa.states[next].count);
regex_free(&regex); regex_free(&regex);
fsa_free(&fsa); fsa_free(&fsa);