|Common ADT for a identifier table ? email@example.com (1999-02-05)|
|Re: Common ADT for a identifier table ? firstname.lastname@example.org (Bill Fahle) (1999-02-15)|
|From:||email@example.com (Stefan Wils)|
|Date:||5 Feb 1999 17:28:18 -0500|
|Organization:||UUNET Benelux (post does not reflect views of UUNET Benelux)|
|Keywords:||symbols, question, comment|
What kind of Abstract Data Type would you suggest for an identifier
table, that has to hold all identifier names and their types (not
Right now I'm doing it with a Binary Tree ("it" as in programming).
What do experienced compiler writers use ? I've also considered a hash
table in which each entry is the head of a linked list.
Thanks, and bye
Stefan Wils (firstname.lastname@example.org)
Homepage : http://www.ruca.ua.ac.be/~s975034
[I usually use a hash table. -John]
Return to the
Search the comp.compilers archives again.