The compiler must store information in the ir version of the program that allows it to get back to the symbol table entry for each name. Among the options open to the compiler writer are pointers to the original character strings and subscripts into the symbol table. Of course, the clever
implementor may discover other options. What are the advantages and disadvantages of each of these representations for a name? How would you represent the name?
Symbol Tables: You are writing a compiler for your favorite lexicallyscoped language.
Consider the following example program:
(a) Draw the symbol table and its contents at the point labelled here.
(b) What actions are required for symbol table management when the parser enters a new procedure and when it exits a procedure?