In this paper, we address our design rationale and present the design of a symbol table library. A symbol processing task can be divided into two parts: one for storing/retrieving symbols, and the other for semantics checking. The former is language-independent and can be defined as reusable components. The latter is language-dependent and can be defined as parametric types to symbol table components or as specific semantics rules. We identify general properties of name analysis problems: topology, overload, navigation, etc. The resulting design of the library covers most usages in symbol processing.
|Number of pages||5|
|State||Published - 1 Jan 1995|
|Event||Proceedings of the 1994 IEEE Region 10's 9th Annual International Conference (TENCON'94). Part 1 (of 2) - Singapore, Singapore|
Duration: 22 Aug 1994 → 26 Aug 1994
|Conference||Proceedings of the 1994 IEEE Region 10's 9th Annual International Conference (TENCON'94). Part 1 (of 2)|
|Period||22/08/94 → 26/08/94|