Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Is Minimal Perfect Hashing the wrong algorithm? cef@geodesic.com (Charles Fiterman) (1996-04-02) |
| Re: Is Minimal Perfect Hashing the wrong algorithm? fjh@cs.mu.OZ.AU (1996-04-04) |
| Re: Is Minimal Perfect Hashing the wrong algorithm? preston@tera.com (1996-04-06) |
| Re: Is Minimal Perfect Hashing the wrong algorithm? krotoff@boy.nmd.msu.ru (Alexander Krotoff) (1996-04-07) |
| Is Minimal Perfect Hashing the wrong algorithm? preston@tera.com (1996-04-08) |
| Re: Is Minimal Perfect Hashing the wrong algorithm? dave@occl-cam.demon.co.uk (Dave Lloyd) (1996-04-08) |
| Re: Is Minimal Perfect Hashing the wrong algorithm? yuen@elec.uq.oz.au (1996-04-10) |
| Re: Is Minimal Perfect Hashing the wrong algorithm? det@platsol.com (Dave Toland) (1996-04-11) |
| From: | yuen@elec.uq.oz.au (Edmund Yuen) |
| Newsgroups: | comp.compilers |
| Date: | 10 Apr 1996 08:26:21 -0400 |
| Organization: | University of Queensland |
| References: | 96-04-012 96-04-042 |
| Keywords: | theory |
Alexander Krotoff <krotoff@boy.nmd.msu.ru> writes:
>2 Apr 1996 23:36:51 -0500 Charles Fiterman wrote:
>> Many compiler writers use Minimal Perfect Hashing to generate some
>> hash tables such as a key word table.
>Yes, they do. But, this method is often used to recognize keywords
>in the stream of identifiers, which are lexicaly often has the same
>form as keywords.
[snip]
>> And in this light maybe synonyms aren't so bad if the second entry in
>> the bucket is something rare and misses are also rare.
>No. As seems to me it is extremely time-expensive to build MPHF in the
>compile-time for _all_ identifiers.
Perhaps this is a good argument for using a variation on Litwin's
dynamic hashing for identifiers rather than MPHF.
MPHF seem more suitable for keyword tables in compilers that are
short on space.
Edmund Yuen
esy@dsto.defence.gov.au
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.