Description
Static lookup tables can be turned into perfect hash functions for fast keyword or token matching. It is useful for compiler tools, parsers, and programs that need efficient fixed-set lookups.
Generated code should be reviewed like any other source file. Keep the input word list under version control so changes remain understandable.