Dougall Johnson dougallj

A traditional table-based DFA implementation looks like this:

uint8_t table[NUM_STATES][256]

uint8_t run(const uint8_t *start, const uint8_t *end, uint8_t state) {
    for (const uint8_t *s = start; s != end; s++)
        state = table[state][*s];
    return state;
}

	// Estimating CPU frequency...
	// CPU frequency: 4.52 GHz
	// sum1: value = 15182118497126522709, 0.31 secs, 5.14 cycles/elem
	// sum2: value = 15182118497126522709, 0.17 secs, 2.93 cycles/elem

	#define RW(x) asm("" : "+r"(x))

	typedef struct Node {
	u64 value;
	struct Node *next;