Re: Looking for symbol table hashing algorithm

smith@aragorn.uni-trier.de (Craig Smith)
10 Jul 1998 20:50:34 -0400

          From comp.compilers

Related articles
[5 earlier articles]
Re: Looking for symbol table hashing algorithm chase@naturalbridge.com (David Chase) (1998-07-05)
Re: Looking for symbol table hashing algorithm dietz@interaccess.com (Paul Dietz) (1998-07-05)
Re: Looking for symbol table hashing algorithm khays@sequent.com (1998-07-05)
Re: Looking for symbol table hashing algorithm eodell@pobox.com (1998-07-08)
Re: Looking for symbol table hashing algorithm preston@tera.com (1998-07-08)
Re: Looking for symbol table hashing algorithm drh@microsoft.com (Dave Hanson) (1998-07-08)
Re: Looking for symbol table hashing algorithm smith@aragorn.uni-trier.de (1998-07-10)
Re: Looking for symbol table hashing algorithm scott@basis.com (1998-07-10)
Re: Looking for symbol table hashing algorithm henry@spsystems.net (1998-07-10)
Re: Looking for symbol table hashing algorithm chase@naturalbridge.com (David Chase) (1998-07-10)
Re: Looking for symbol table hashing algorithm dietz@interaccess.com (Paul Dietz) (1998-07-11)
Re: Looking for symbol table hashing algorithm scottdaniels@earthlink.net (Scott David Daniels) (1998-07-13)
Re: Looking for symbol table hashing algorithm buzzard@world.std.com (1998-07-13)
[1 later articles]
| List of all articles for this month |

From: smith@aragorn.uni-trier.de (Craig Smith)
Newsgroups: comp.compilers
Date: 10 Jul 1998 20:50:34 -0400
Organization: Universitaet Trier
References: 98-07-030 98-07-056
Keywords: symbols

> I'm going to echo Kirk Hays, though, and suggest using a balanced
> tree instead of a hash if the input is going to be exceptionally
> large or generated by another program. Personally, I prefer
> red-black trees, since they're fractionally faster than AVL trees,
> but this may not matter much in practice. Imatix (www.imatix.com)
> has a good free C implementation of an AVL tree in their SFL
> library.


One should consider using skip-lists -- much simpler to implement
and the average running time is faster (the O(n) is of course worse
than the tree approaches above).


(raig
--
Craig Smith
Mitarbeiter, Informatik
University of Trier
Trier, Germany
--


Post a followup to this message

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