Perfect hashing table/function

Gary D Duzan <gdtltr@vax1.acs.udel.edu>
2 Jan 89 18:38:26 GMT

          From comp.compilers
Related articles
Perfect hashing table/function gdtltr@vax1.acs.udel.edu (Gary D Duzan) (1989-01-02)
Re: Perfect hashing table/function harvard!cs.washington.edu!pardo (1989-01-03)
Re: Perfect hashing table/function cosell@BBN.COM (Bernie Cosell) (1989-01-04)
| List of all articles for this month |
From: Gary D Duzan <gdtltr@vax1.acs.udel.edu>
Newsgroups: comp.compilers,comp.lang.c
Date: 2 Jan 89 18:38:26 GMT
Organization: Galadrim (really a disorganization)

      Does anyone have a perfect hashing table/function generated for the C
keywords that you would be willing to let me use? I am trying to figure out how
to generate my own, but I am having trouble. Any help would be appreciated.


Gary Duzan
[I have seen a lot of perfect hash functions come and go over the years,
particularly in Sigplan, but have the impression that the traditional
technique of putting the keywords in the symbol table is liable to give you
better performance. Consider the relative frequency in typical programs of,
say, the keyword "enum" and the variable name "p". -John]
[From Gary D Duzan <gdtltr@vax1.acs.udel.edu>]
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.