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.
1st page last para. I think identifiers are entered on basis of ASCII code etc. I don't know clearly.
The tests are there but it ain't free. Cost is...