Re: Symbol tables and scopes

Chris F Clark wrote:
>> 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.


glen herrmannsfeldt wrote:
> 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.


Similarly, Pascal allows a WITH clause that provides the leading
component of a record name(s), for abbreviating record member names
within the scope of the clause. This can also lead to ambiguous names
within the clause.


-drt

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