Symbol Tables

Overview

  • The Abstract Syntax Tree# is the result of top-down or bottom-up parsing
    • Such a parser is not enough to fully compile a modern programming language
    • To fully compile a program the compiler needs to take context into consideration
  • Most PL allow declaration, definition and use of symbolic names to represent constants, variables, methods, types and objects
    • The compiler needs to verify if such names are used correctly

Symbol Table Construction

  • Created by a pass over the AST to:
    1. Process symbol declarations
    2. Connect each symbol reference with its corresponding declaration
  • An AST node that mentions a symbol name will also have a field with a reference to the symbol name’s entry in the symbol table
    • If such connection cannot be made, then the symbol was not declared properly and an error will be thrown
    • Otherwise, other passes can use the symbol table reference to obtain information like type, storage requirements,… about the symbol
  • Most languages have scopes that bind the availability of symbols to a specific region of the program (See Static vs Dynamic Scope#)

Symbol Table Interface

  • openScope(): Opens a new scope in the symbol table. New symbols are entered in this scope
  • closeScope(): Closes the most recently opened scope.
  • enterSymbol(name, type): Enters name in the current scope.
  • RetrieveSymbol(name): Returns the current valid declaration for name. Might return null, if no declaration can be found.
  • DeclaredLocally(name): Test whether name is present in the current (innermost) scope.

Handling Scopes

  • Every symbol reference in an AST node occurs in the context of defined scopes
  • The scope defined by the innermost such contexts is known as current scope
  • The scopes defined by the current scope and its surrounding scopes are called open scopes or currently active scopes
    • All other scopes are said to be closed
    • Current, open and closed are not fixed attributes but rather based on the current position in the program
  • Common scope rules:
    1. At any point in the program, accessible names are those that are declared in the current and all other open scopes
    2. If a name is declared in more than one open scope, then a reference is resolved to the innermost scope (this is called shadowing)
    3. New declarations can only be made in the current scope

One Symbol Table or Many?

  • A symbol table may be associated with each scope or all symbols may be entered in a single global table
    • A single table needs specific mechanisms to handle multiple active declarations of the same symbol
    • However, search for a symbol in a single table may be faster

References