From: "Theodore E. Dennison" <dennison@escmail.orl.mmc.com>
Subject: Re: NFA to DFA
Date: 1996/05/14
Date: 1996-05-14T00:00:00+00:00 [thread overview]
Message-ID: <31987C20.167EB0E7@escmail.orl.mmc.com> (raw)
In-Reply-To: 31973BF5.41C67EA6@avions.aerospatiale.fr
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 |
next prev parent reply other threads:[~1996-05-14 0:00 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
1996-05-11 0:00 NFA to DFA Boaz Chow
1996-05-13 0:00 ` JEAN CLAUDE GALLO
1996-05-14 0:00 ` Theodore E. Dennison [this message]
1996-05-16 0:00 ` Data Structures as ADTs (was: NFA to DFA) Matthew Heaney
1996-05-16 0:00 ` Theodore E. Dennison
1996-05-14 0:00 ` NFA to DFA Jon S Anthony
1996-05-15 0:00 ` Jon S Anthony
1996-05-15 0:00 ` Theodore E. Dennison
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox