From: "Dmitry A. Kazakov" <mailbox@dmitry-kazakov.de>
Subject: Re: References on encoding (Hierarchical) State Machines / Automata in Ada?
Date: Thu, 14 Feb 2013 09:34:17 +0100
Date: 2013-02-14T09:34:17+01:00 [thread overview]
Message-ID: <u8jtag08b9hg$.13zf0l9jfh29r.dlg@40tude.net> (raw)
In-Reply-To: lyliarrgpz.fsf@pushface.org
On Wed, 13 Feb 2013 22:28:40 +0000, Simon Wright wrote:
> I can understand that if the FSM is a task - you're implementing the
> states in terms of the program counter, nothing wrong with goto for
> that. But if you've inverted this, so that the FSM is a passive
> construct, you're going to need an enumeration of the possible states,
True. This is how you switch from imperative to even/data-driven paradigm.
Unfortunately there is no support for co-routines in Ada to avoid the
latter [which is so bad, that some would resort to gotos (:-))].
--
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de
next prev parent reply other threads:[~2013-02-14 8:34 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
2013-01-21 10:42 References on encoding (Hierarchical) State Machines / Automata in Ada? david.mentre
2013-02-13 15:30 ` Eryndlia Mavourneen
2013-02-13 16:02 ` rrr.eee.27
2013-02-13 18:05 ` Simon Wright
2013-02-13 20:25 ` Jeffrey Carter
2013-02-13 22:28 ` Simon Wright
2013-02-14 8:34 ` Dmitry A. Kazakov [this message]
2013-02-14 0:00 ` jpwoodruff
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox