Implementation of Symbol Table

Problem Statement : Implementation of Symbol Table

Theory :

In Computer Science, ‘Symbol Table’ is a data structure used by language translator, such as compiler or interpreter. Source code is associated with information related to its declaration, such as its type, scope level and sometimes its location symbol table is generated in lexical analysis

A compiler uses symbol table to keep track of scope and binding information about names. There is entry for query token mechanism. It allows adding new entry and finding existing entry efficiently.

Symbol table contains the field name, types, size, address etc.

Symbol table is efficient in synthesis phase

Implementation:

A common implementation technique is used for hash table implementation. A compiler may use one symbol table for all symbols o may use separate ones.

Uses:

1. An object file will contain a symbol table of the identities it contains that are externally visible.
2. A linear will use this symbol table to resolve any resolve references.
3. A symbol table may exist during the translation process.
4. Research engineering executes a lot of rules after the symbol table generated.

Example Tables

In the symbol table, fist column indicates where the symbol is located in the mim. Second column indicates the symbol type and the third one indicates the name of the symbol. as follows,

Address	Type	Name
1000	A	u-BIT
1001	A	f-BIT
1002	A	I-BIT
1003	T	ir
1004	T	main
1005	T	end