Re: Internal Representation of Strings

Ira Baxter schrieb:


> As an example, we store small integers in number-carrying leaf
> nodes, with a hash table used to store pretty rare big integers.


Hash tables for literals can reduce the memory requirements a lot. They
do not only allow to share e.g. constant strings, but also can help in
finding typos in numerical values, or to emit suggestions for named
constants.


When e.g. a value 19.2 is found in more than 100 places in a real life
application, it should cause some frowning.


DoDi

Return to the comp.compilers page.
Search the comp.compilers archives again.