Skip to content
Related Articles

Related Articles

Improve Article

Symbol Table in Compiler

  • Difficulty Level : Easy
  • Last Updated : 31 Jan, 2019

Prerequisite – Phases of a Compiler

Symbol Table is an important data structure created and maintained by the compiler in order to keep track of semantics of variable i.e. it stores information about scope and binding information about names, information about instances of various entities such as variable and function names, classes, objects, etc.

  • It is built in lexical and syntax analysis phases.
  • The information is collected by the analysis phases of compiler and is used by synthesis phases of compiler to generate code.
  • It is used by compiler to achieve compile time efficiency.
  • It is used by various phases of compiler as follows :-
    1. Lexical Analysis: Creates new table entries in the table, example like entries about token.
    2. Syntax Analysis: Adds information regarding attribute type, scope, dimension, line of reference, use, etc in the table.
    3. Semantic Analysis: Uses available information in the table to check for semantics i.e. to verify that expressions and assignments are semantically correct(type checking) and update it accordingly.
    4. Intermediate Code generation: Refers symbol table for knowing how much and what type of run-time is allocated and table helps in adding temporary variable information.
    5. Code Optimization: Uses information present in symbol table for machine dependent optimization.
    6. Target Code generation: Generates code by using address information of identifier present in the table.

Symbol Table entries – Each entry in symbol table is associated with attributes that support compiler in different phases.
Items stored in Symbol table:

  • Variable names and constants
  • Procedure and function names
  • Literal constants and strings
  • Compiler generated temporaries
  • Labels in source languages

Information used by compiler from Symbol table:

  • Data type and name
  • Declaring procedures
  • Offset in storage
  • If structure or record then, pointer to structure table.
  • For parameters, whether parameter passing by value or by reference
  • Number and type of arguments passed to function
  • Base Address

Operations of Symbol table – The basic operations defined on a symbol table include:

Implementation of Symbol table –
Following are commonly used data structure for implementing symbol table :-

  1. List –
    • In this method, an array is used to store names and associated information.
    • A pointer “available” is maintained at end of all stored records and new names are added in the order as they arrive
    • To search for a name we start from beginning of list till available pointer and if not found we get an error “use of undeclared name”
    • While inserting a new name we must ensure that it is not already present otherwise error occurs i.e. “Multiple defined name”
    • Insertion is fast O(1), but lookup is slow for large tables – O(n) on average
    • Advantage is that it takes minimum amount of space.

  2. Linked List
    • This implementation is using linked list. A link field is added to each record.
    • Searching of names is done in order pointed by link of link field.
    • A pointer “First” is maintained to point to first record of symbol table.
    • Insertion is fast O(1), but lookup is slow for large tables – O(n) on average

  3. Hash Table
    • In hashing scheme two tables are maintained – a hash table and symbol table and is the most commonly used method to implement symbol tables..
    • A hash table is an array with index range: 0 to tablesize – 1.These entries are pointer pointing to names of symbol table.
    • To search for a name we use hash function that will result in any integer between 0 to tablesize – 1.
    • Insertion and lookup can be made very fast – O(1).
    • Advantage is quick search is possible and disadvantage is that hashing is complicated to implement.

  4. Binary Search Tree
    • Another approach to implement symbol table is to use binary search tree i.e. we add two link fields i.e. left and right child.
    • All names are created as child of root node that always follow the property of binary search tree.
    • Insertion and lookup are O(log2 n) on average.

Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

My Personal Notes arrow_drop_up
Recommended Articles
Page :