mutually-recursive types and an old puzzle

[Nathan Sidwell]

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