edited by
14,089 views

5 Answers

Best answer
40 votes
40 votes

$(B)$ Symbol table is  the answer.

It can be implemented by using an array, hash table, tree and even some time with the help of the Iinked list!

edited by
22 votes
22 votes

Symbol table is an important data structure created and maintained by compilers in order to store information about the occurrence of various entities such as variable names, function names, objects, classes, interfaces, etc. Symbol table is used by both the analysis and the synthesis parts of a compiler.

If a compiler is to handle a small amount of data, then the symbol table can be implemented as an unordered list, which is easy to code, but it is only suitable for small tables only. A symbol table can be implemented in one of the following ways:

  • Linear (sorted or unsorted) list
  • Binary Search Tree
  • Hash table

Among all, symbol tables are mostly implemented as hash tables, where the source code symbol itself is treated as a key for the hash function and the return value is the information about the symbol.

15 votes
15 votes
B. It uses array to implement.
Answer:

Related questions

24 votes
24 votes
3 answers
1
go_editor asked Sep 29, 2014
8,320 views
Which languages necessarily need heap allocation in the runtime environment?Those that support recursion.Those that use dynamic scoping.Those that allow dynamic data stru...
12 votes
12 votes
5 answers
2
go_editor asked Sep 30, 2014
6,497 views
$25$ persons are in a room. $15$ of them play hockey, $17$ of them play football and $10$ of them play both hockey and football. Then the number of persons playing neithe...
7 votes
7 votes
1 answer
3
go_editor asked Sep 30, 2014
3,877 views
Choose the most appropriate word from the options given below to complete the following sentence:If we manage to __________ our natural resources, we would leave a better...