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,955fad43713fdf44
X-Google-Attributes: gid103376,public
From: "Theodore E. Dennison" <dennison@escmail.orl.mmc.com>
Subject: Re: NFA to DFA
Date: 1996/05/14
Message-ID: <31987C20.167EB0E7@escmail.orl.mmc.com>#1/1
X-Deja-AN: 154750256
references: <4n1its$rtt@news2.h1.usa.pipeline.com>
 <31973BF5.41C67EA6@avions.aerospatiale.fr>
content-type: text/plain; charset=us-ascii
organization: Lockheed Martin Information Systems
mime-version: 1.0
newsgroups: comp.lang.ada
x-mailer: Mozilla 2.0 (X11; I; SunOS 4.1.3_U1 sun4m)
Date: 1996-05-14T00:00:00+00:00
List-Id: <comp.lang.ada>


JEAN CLAUDE GALLO wrote:
> 
> Boaz Chow wrote:
> >
> > do you know how to implement SET adt and the operations in Ada?
> >
> 
> generic packages
> You may found examples of SETS in "Software Components with Ada"
> (G.Booch). He explain theory of Set algorithm and Ada83 generic packages

Being an old Modula-2 programmer (where Sets are basic structure types,
like records), I have several times sat down to implement a generic
SET ADT package. Every time, I have discovered that arrays of boolean
give me exactly what I want with one simple type declaration. This
is because Ada defines the boolean operators AND and OR to work on 
ARRAYS of boolean in a bitwise fashion. So why bother with some fancy
generic ADT package (that might have bugs)?
   
-- 
T.E.D.          
                |  Work - mailto:dennison@escmail.orl.mmc.com  |
                |  Home - mailto:dennison@iag.net              |
                |  URL  - http://www.iag.net/~dennison         |