Re: Looking for symbol table hashing algorithm

> 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
--

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