This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: mutually-recursive types and an old puzzle

From: Nathan Sidwell <nathan at codesourcery dot com>
To: llewelly at xmission dot com
Cc: Joe Buck <Joe dot Buck at synopsys dot COM>, gcc at gcc dot gnu dot org
Date: Wed, 30 Jun 2004 09:02:21 +0100
Subject: Re: mutually-recursive types and an old puzzle
Organization: CodeSourcery LLC
References: <20040629160218.A1373@synopsys.com> <s3risd9reil.fsf@solaris.xmission.com>

llewelly@xmission.com wrote:

Joe Buck <Joe.Buck@synopsys.COM> writes:

The idea is to consider a representation of finite state machines based
on pointers to functions.  Let's assume, for C, that we have some
typedef called T to be filled in later.  Now, consider a simple two-state
FSM that switches state for an input of 1, and stays in the same state
for an input of 0.

I don't know. But something similar can be represented in C++: see:

this is clearly the killer argument as to why we should switch to C++. All
those schedulers will be sooo much better.

nathan

--
Nathan Sidwell    ::   http://www.codesourcery.com   ::     CodeSourcery LLC
nathan@codesourcery.com    ::     http://www.planetfall.pwp.blueyonder.co.uk

References:
- mutually-recursive types and an old puzzle
  - From: Joe Buck
- Re: mutually-recursive types and an old puzzle
  - From: llewelly

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