Re: [RFC] parser states/stack

[Hans Aberg]

At 11:05 +0100 1-01-10, Axel Kittenberger wrote:
>Lastly I've tried to get a track of the bison algorithmn that is outputed.
>Well it ain't to easy for me to understand :-)
>
>However one question, Bison emmits a finite state machine.
>
>Wouldn't it maybe produce a little faster code, when it would generate a
>seperate code section (or even function) for each state?

My own thoughts on the matter, is that I think the reason that Bison does
not do that (writing out each state), is that it is more complicated to
write out, and possibly, in order to produce smaller code. (Adding function
calls, though, traditionally is thought to slow code down; but I do not
know if that is true with modern CPU's).

Any other opinions?

  Hans Aberg