Chapter 7: Intermediate representation and symbol table

Data Structures

. List data structure

- simplest to implement

- use a single array to store names and information

- search for a name is linear

- entry and lookup are independent operations

- cost of entry and search operations are very high and lot of time goes into book keeping

. Hash table

- The advantages are obvious