generate a compact and optimized DAFSA from a Public Suffix List
Description
psl-make-dafsa produces C/C++ code or an architecture-independent binary object
that represents a Deterministic Acyclic Finite State Automaton (DAFSA) from a
textual representation of a Public Suffix List. Input and output files must be
specified on the command line.
This compact representation enables optimized queries of the list, saving both
time and space when compared to searches of human-readable representations.
