This is the mail archive of the guile@cygnus.com mailing list for the guile project.

Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]

Re: finite state machines in guile


>     Marius> A macro could certainly make this nicer and Hobbit will
>     Marius> compile this to an actual state machine implemented with
>     Marius> gotos I think.
> 
>  I think it will make a C function for each subfunction in the letrec
>  and for each named let.  When I did that `append!' function,
>  `ghobbit' compiled it into several C functions, and I combined them
>  by hand.

Does Hobbit use trampolines to implement tail calls between C
functions?  Or does it just let the stack grow?  Not a criticism, mind
you --- getting tail recursion to work is a pain.