"Garen Parham" <nospam@garen.net> wrote in message news:ba8kn1$ugt$1@digitaldaemon.com...
> Walter wrote:
> > Profile, profile, profile!
> Thats it?  I was thinking maybe you'd say you had some ingenuous bottom-up strategies tightly knit with the target/languages or something. :)

I don't think there's anything ingenious in the code. I just have a lot of experience knowing what eats cycles and what doesn't <g>. I must have tried dozens of different ways to do symbol tables.

I can tell you, though, if you want a slow compiler, use Lex and Yacc.

"Ilya Minkov" <midiclub@8ung.at> wrote in message news:ba8h98$qsu$1@digitaldaemon.com...
> Walter wrote:
> > Thanks. I haven't even expended any effort tuning it for speed. I just structured the language so it would be fast to parse.
>
> assert (Walter == GeniousWizard);
>
> AND LET TEH WORLD CRASH IF THIS ASSERT FAILS!
> :>

LOL. If you want to see the source to the lexer/parser, it's included with the download. It looks pretty straightforward, until you compare it with the source to other compilers.