Re: Loop Optimizations and Gotos

Paul Long <plong@perf.com>
Tue, 21 Nov 1995 02:01:29 GMT

          From comp.compilers

Related articles
[3 earlier articles]
Re: Loop Optimizations and Gotos cliffc@ami.sps.mot.com (1995-11-13)
Re: Loop Optimizations and Gotos cdg@nullstone.com (1995-11-13)
Re: Loop Optimizations and Gotos faiman@zko.dec.com (1995-11-16)
Re: Loop Optimizations and Gotos hrubin@stat.purdue.edu (1995-11-17)
Re: Loop Optimizations and Gotos j-grout@glibm9.cen.uiuc.edu (1995-11-17)
Re: Loop Optimizations and Gotos baynes@ukpsshp1.serigate.philips.nl (1995-11-20)
Re: Loop Optimizations and Gotos plong@perf.com (Paul Long) (1995-11-21)
Re: Loop Optimizations and Gotos preston@tera.com (1995-11-21)
Re: Loop Optimizations and Gotos cliffc@ami.sps.mot.com (1995-11-21)
Re: Loop Optimizations and Gotos cliffc@ami.sps.mot.com (1995-11-22)
Re: Loop Optimizations and Gotos Paul_Long@ortel.org (1995-11-23)
Re: Loop Optimizations and Gotos bill@amber.ssd.hcsc.com (1995-11-27)
Re: Loop Optimizations and Gotos dave@occl-cam.demon.co.uk (Dave Lloyd) (1995-11-27)
[1 later articles]
| List of all articles for this month |

Newsgroups: comp.compilers
From: Paul Long <plong@perf.com>
Keywords: optimize
Organization: Performance Computing Incorporated
References: 95-11-076 95-11-107 95-11-158
Date: Tue, 21 Nov 1995 02:01:29 GMT

hrubin@stat.purdue.edu (Herman Rubin) wrote:
[snip]
>How can one avoid many unnecessary steps when there are numerous
>logical exits from a block? One case of this is entrance to a
>state machine;
[snip]


See the paper, "How (Not) to Code a Finite State Machine,"
Douglas W. Jones, _SIGPLAN Notices_, vol. 23, no. 8, August
1988, for another alternative to implementing FSMs that you
may not have thought about that avoids the problems you
mention.


--
Paul Long plong@perf.com http://www.teleport.com/~pciwww/
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.