A hardware accelerator personality compiler, by distinguishing the marks corresponding to each executable function, logo, variable, syntax, grammatical rules, special symbols, etc. Formal notation provides the specification of a set of expected executable functions, automatically generating error-free state tables. The tokens can be recursive (eg infinite), in which case the tokens are transformed into deterministic finite automata or non-deterministic finite automata. The non-deterministic finite automaton is transformed into a finite automaton and then into state transitions for creating a state table which can then be stored, or preferably loaded into a finite state machine of a hardware parser accelerator , to define its personality.