Abstract
Parser based on at most 16 state table driven DFA table (designed for between 4->15 regular states + terminus, which is always the 0 state), for 8bit symbol
sets (such as UTF8 or ASCII)
Construct the DFA table with a maximum state count, which allows limited length arrays.
The maximum state value, shouldn't be more than 16.
Parser based on at most 16 state table driven DFA table (designed for between 4->15 regular states + terminus, which is always the 0 state), for 8bit symbol
sets (such as UTF8 or ASCII)