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;
}
List of oldest supported version of top 10 Linux Distros and their glibc version according to distrowatch.com.
Out of all versions with published EOLs, 2.12 is the oldest glibc still active, found in CentOS 6.8.
If CentOS 6 and 7 are eliminated, the oldest glibc is 2.23 in Ubuntu and Slackware.
