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

To: guile@cygnus.com
Subject: Re: finite state machines in guile
From: Tel <telford@eng.uts.edu.au>
Date: Thu, 1 Oct 1998 14:38:51 +1000
References: <199809132233.SAA13830@huis-clos.mit.edu> <87ww76r1fp.fsf@zagadka.ping.de> <87lnnleywn.fsf@bittersweet.inetarena.com> <wwn67eapwu1.fsf@totoro.red-bean.com>
Reply-To: telford@eng.uts.edu.au


> 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.

What is wrong with implementing tail calls as `return(foo())' or something
similar and letting the C compiler optimise them? Seems like doing something
fancier than that is falling into the ``too smart by half'' category.

	- Tel

Follow-Ups:
- Re: finite state machines in guile
  - From: Lauri Alanko <lealanko@cc.helsinki.fi>
- Re: finite state machines in guile
  - From: Maciej Stachowiak <mstachow@mit.edu>
- Re: finite state machines in guile
  - From: "Perry E. Metzger" <perry@piermont.com>

Prev by Date: Re: optional parameters
Next by Date: Re: Yow: Maciej.
Prev by thread: Re: Yow: Maciej.
Next by thread: Re: finite state machines in guile
Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]