From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: *
X-Spam-Status: No, score=1.4 required=5.0 tests=BAYES_50,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,b45952e5dedb7e9a,start
X-Google-Attributes: gid103376,public
From: "Ray A. Lopez" <rdsys@inficad.com>
Subject: State Machine Implementation
Date: 1998/08/05
Message-ID: <35C90369.CFE8ED98@inficad.com>#1/1
X-Deja-AN: 378365347
Content-Transfer-Encoding: 7bit
Organization: Inficad Communications
Content-Type: text/plain; charset=us-ascii
Mime-Version: 1.0
Newsgroups: comp.lang.ada
Date: 1998-08-05T00:00:00+00:00
List-Id: <comp.lang.ada>

Does anyone have any implementions of a state machine?  The states would
be just an enumerated type and I am guessing you would use a case
statement.  Just looking for more info on how to implement this using
Ada.

thanks...