Speed in NewCompiler (was: Re: Real closures)

Mathieu mathk.sue at gmail.com
Sat Oct 7 22:08:28 UTC 2006


Andreas Raab a écrit :
> Mathieu wrote:
>>> Seriously, if you wanted closures a better bet may be to take the
>>> existing infrastructure and hack that support in the current
>>> compiler[*]. If you know what you're doing this takes a couple of weeks
>>> but then it's done. The trouble with that new compiler is that while
>>> it's used for a lot of exciting research there doesn't seem to be anyone
>>> who is willing to spend the time to address the "boring" issues that are
>>> so important for the non-research users of a compiler.
>>
>> Witch boring issues are you talking about?
> 
> Error messages, decompilation, speed. I'm glad to see you're going to
> work on error messages, though.
> 
> Cheers,
>   - Andreas
> 
> 

For speed I have made some test with MessageTally and find out that NewCompiler spend a lote of time
in SqueakScanner>>scanForToken.

This depende on SmaCC so may be we should use a better algorithm for the scanner. May be we can use
automaton.

But this should be disscus on the NewCompiler mailing list.

	Math



More information about the Squeak-dev mailing list