in Compiler Design
331 views
0 votes
0 votes
Access time of the symbol table will be logarithmic, if it is implemented by a

(a) linear list

(b) search tree

(c) hash table

(d) none of the above
in Compiler Design
331 views

2 Comments

i got this from GFG ( i have a doubt in this ) https://www.geeksforgeeks.org/symbol-table-compiler/

i didn't get the meaning of search tree, if it is really Binary Search tree, then how can we use BST here, i mean what is the criteria to say node A is less than node B etc.

0
0

http://pages.cs.wisc.edu/~fischer/cs536.s07/lectures/Lecture05a.pdf

1st page last para. I think identifiers are entered on basis of  ASCII code etc. I don't know clearly.

0
0

Please log in or register to answer this question.

Related questions