Re: Symbol tables and scopes

Chris F Clark wrote:


(snip)


> I can easily imagine (and would potentially want to use) a
> language which has "search paths" that specify how a name gets
> resolved. In that case, finding the string/hash-value is only a small
> part of the symbol look-up process. Once you know the hash value, you
> need to find out which instance of that symbol is relevant.


One interesting case is PL/I, which allows partial qualification
for structures. True ambiguous cases are not allowed, but cases
that could be considered ambiguous at different nesting levels
are allowed.


-- glen

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