Re: Internal Representation of Strings

> [Let's say you have a gigantic parse tree with 10,000 nodes. That means
> you'd have 40K of length words. Who cares? -John]


Gigantic parse trees have 30 million nodes. We encounter them.
(You can argue such things are crazy. I agree. But I don't
argue with my customer when he shows up with one.)
My personal theory is that with memory touches being expensive
in terms of (hundreds of) clock cycle (and getting further away as
transistors shrink), any scheme that burns
a few machine instructions of clocks to enable statistically common
cases to be "local" is a very good tradeoff.
As an example, we store small integers in number-carrying leaf
nodes, with a hash table used to store pretty rare big integers.
--
Ira Baxter, CTO
www.semanticdesigns.com

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