Implementation using Java

Department of Computer Science & Engineering CSE 430: Compiler Design Lab2: Symbol Table Introduction We will build a symbol-table in this assignment. At this initial stage, we will omit many details regarding an actual symbol- table and we will simply adhere to the basic concept that "a symbol-table is an efficient data-dictionary for the symbols used in a program". Thus, our focus in this assignment is to construct a simple hash-based data-dictionary based on chaining. Inputs The input to your program will be a sequence of two tuples, where each element in each tuple is a string. An example of input sequence is given below: int, INTEGER myFunction, FUNCTION X, ID 5, NUM The first element of each tuple will be the name of the record to be stored in the symbol table. Hence, you have to apply the hash function on the first element of each tuple that is the name. Tasks Implement the following functionalities: 1. Insert a new symbolame along with its type into the symbol table 2. Search a symbolame along with its type from the symbol table 3. Delete a symbolame along with its type into the symbol table 4. Show the contents of symbol table in the console 5. Update an already existing entry in the symbol table