Re: Symbol tables and scopes

>> It looks like inefficient to me, when for every currently visible scope
>> the block id must be compared with the id's of *all* possible blocks?


Figure that a name is declared in very few blocks, but some blocks contain
very many names. Typically, the outermost scope contains hundreds of
global names that are never redeclared. I believe this is called the "Big
Inhale"


Under the circumstances, a single hash lookup by name is followed by a
usually short scan for scope. And the cost of block entry and exit is a
single stack push/pop and increment.




--
mac the naïf

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