On Mon, 31 May 2010, Adem wrote:
On 2010-05-31 15:42, Michael Van Canneyt wrote:
On Mon, 31 May 2010, Adem wrote:
True. In order to avoid this sort of thing all together, the best solution
would be making the compiler use a parse tree.
Florian already explained at the start of the discussion that this is not
feasable because of speed and memory penalties.
I am not a compiler author, so I do not wish to be arguing with experts; but,
it's not as if we have both alternatives to measure and chose the best on the
aggregate.
I can see that it is expected to be slower and will need more memory; but, we
don't know is how much slower and how much more memory it will need. And,
whether these will be noticeable/bearable considering what we gey out of it.
To that we can reply now: No, it will not be bearable.
We get enough complaints about speed/memory use as it is.
Any additional slowdown is therefor simply not an option.
Michael.
--
_______________________________________________
Lazarus mailing list
[email protected]
http://lists.lazarus.freepascal.org/mailman/listinfo/lazarus
