|Symbol table storage schemes GIGUERE@WATCSG.BITNET (Eric Giguere) (1989-03-15)|
|Date:||Wed, 8 Mar 1989 14:22 LCL|
|From:||Eric Giguere <GIGUERE@WATCSG.BITNET>|
Does anyone know what kind of storage scheme is of use for the symbol
table of a C compiler? Currently I'm looking at some form of balanced
self-modifying tree, but I'd like to hear from others as to what they've
used. In my situation speed has priority over memory usage (i.e., I
want fast lookups, though insertions shouldn't be too piggish time-wise).
Computer Systems Group, University of Waterloo
BITNET: GIGUERE@WATCSG Other: giguere@watcsg.UWaterloo.CA
UUNET : watcsg!giguere@uunet.UU.NET
[I always used some simple hash scheme. You need a pretty poor symbol table
algorithm for it to have much effect on compile time. After all, you look
up each name in the source text only once. -John]
Return to the
Search the comp.compilers archives again.