AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Using Hash Tables in a Compiler
In Turbo Pascal, 1.0, all of the variable declarations were just kept on a linked list because that much I knew. But searching linked lists is not particularly efficient when they get large. And so for really large functions, that would just take an awful long time to search. So you have to first go by first letter and then, you know, have 20 26 linked lists or whatever. That could help a little bit. Then he read about these things called hashtags, actually in this book by Nicklaus Vier algorithms are plus, yeah, algorithms plus data structures equals programs.