Hashed symbol tables for languages with explicit scope control

  • Authors:
  • S. L. Graham;W. N. Joy;O. Roubine

  • Affiliations:
  • Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, California;Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, California;Computer Science Division, Department of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, California

  • Venue:
  • SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
  • Year:
  • 1979

Quantified Score

Hi-index 0.00

Visualization

Abstract

Newer programming languages such as Modula and Euclid provide more control than traditional Algol-like languages such as ALGOL-60 and Pascal over the inheritance, in inner scopes, of named entities available in outer scopes. They also provide mechanisms whereby chosen entities from inner scopes may be made available to outer scopes. In this paper we show how a hashed symbol table can be organized to implement these new scope rules in a time and space efficient way.