ramsey@NCoast.ORG (Cedric Ramsey) (09/18/90)
I apologize if this question may sound dull or unintelligent to you guys.
But are there any papers in existance that explain how to maintain a
symbol table on a floppy disk; stuff like data structures, hashing ?,
lookup, insertion etc. Any information or pointers to information will
be greatly appreciated.
Thankyou,
Cedric A. Ramsey
E-mail: ramsey@ncoast.ORG
[Content addressed structures in external storage are usually called data
bases. There are lots of disk-based structures for lookup by name; see
Knuth volume 3 for a somewhat dated but still useful introduction. Also,
I'd be interested to hear what kind of environment is forcing your symbol
table onto a disk. Wouldn't it be easier to spend $70 and get another
megabyte of RAM? -John]
--
Send compilers articles to compilers@esegue.segue.boston.ma.us
{ima | spdcc | world}!esegue. Meta-mail to compilers-request@esegue.pardo@june.cs.washington.edu (David Keppel) (09/27/90)
ramsey@NCoast.ORG (Cedric Ramsey) writes: >[Maintaining a symbol table on floppy] This doesn't solve your problem: One of my compilers profs told of a PC COBOL compiler that looked at the amount of available memory and used different algorithms and storage layouts depending on the configuration. This seemed pretty clever at first, then seemed pretty gross because several versions would have to be maintained. Then it seemed pretty clever because they solved their problem: as fast as possible for the given machine. ;-D oN ( War stories? Nah, a low-intesity conflict ) Pardo -- pardo@cs.washington.edu {rutgers,cornell,ucsd,ubc-cs,tektronix}!uw-beaver!june!pardo -- Send compilers articles to compilers@esegue.segue.boston.ma.us {ima | spdcc | world}!esegue. Meta-mail to compilers-request@esegue.