Optimal table lookup for reserved words in Ada

John A. Trono
2006 ACM SIGAda Ada Letters  
Preamble Recently a colleague wanted to include a section on perfect hashing functions in the latest edition of a book [4] , and after an on-line search brought up a reference of mine [8], he sent me an email asking if I could generate a minimal perfect hashing function (MPHF) for the set of reserved words in Ada 2005. This is a summary of the process that determined one.
doi:10.1145/1131411.1131414 fatcat:533j2plifvev5ize2sa75v3svm