A perfect hash function for Ada reserved words

Authors:
David Alan Wolverton
Affiliations:
University of California, Irvine, California
Venue:
ACM SIGAda Ada Letters
Year:
1984

Citing 2
Cited 1

Minimal perfect hash functions made simple

Communications of the ACM
A letter oriented minimal perfect hashing function

ACM SIGPLAN Notices

Minimal perfect hash functions for reserved word lists

ACM SIGPLAN Notices

Quantified Score

Hi-index	0.00

Visualization

Abstract

A fast perfect hash function is presented which allows the 63 Adat reserved words to be differentiated quickly from other Ada identifiers. Such functions are potentially useful in improving the performance of software that processes the text of Ada programs.