| Symbol Tables In Compiler Design - 2 |
Page 2 of 2
Another example is symbol table that, for example, holds the nodes of program control flow. You need to be able to quickly move in both directions starting from any node. This requirement implies use of two-way linked lists. The best way to learn about symbol tables, hash functions, linked lists and algorithms is to examine the code of some compiler. You will need some time to become familiar with the functions and the data used but then you will have an overview of the whole picture. Every compiler is a symphony of data structures and algorithms. One such compiler was constructed from scratch. If you are interested in the details of symbol tables you can download the source code. This will be the best book on compiler design. Another important field that needs to understand data structures is digital data recovery. In order to recover data from broken disks and corrupted file systems you need to know how data is stored and what are the relations. Article Source: http://EzineArticles.com/?expert=I._Funa |