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.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,b45952e5dedb7e9a
X-Google-Attributes: gid103376,public
From: dennison@telepath.com
Subject: Re: State Machine Implementation
Date: 1998/08/06
Message-ID: <6qcauo$ef4$1@nnrp1.dejanews.com>#1/1
X-Deja-AN: 378502843
References: <35C90369.CFE8ED98@inficad.com>
Organization: Deja News - The Leader in Internet Discussion
X-Article-Creation-Date: Thu Aug 06 13:26:49 1998 GMT
Newsgroups: comp.lang.ada
X-Http-User-Agent: Mozilla/4.0 (compatible; MSIE 4.0; Windows NT; Gateway2000)
Date: 1998-08-06T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <35C90369.CFE8ED98@inficad.com>,
  "Ray A. Lopez" <rdsys@inficad.com> wrote:
> 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.

I just finished a lexical analizer, and that's how I did it. There are some
folks here who feel like goto's are more straighforward for that purpose,
though.

T.E.D.

-----== Posted via Deja News, The Leader in Internet Discussion ==-----
http://www.dejanews.com/rg_mkgrp.xp   Create Your Own Free Member Forum