From: "Theodore E. Dennison" <dennison@escmail.orl.mmc.com>
Subject: Re: NFA to DFA
Date: 1996/05/15
Date: 1996-05-15T00:00:00+00:00 [thread overview]
Message-ID: <3199D093.41C67EA6@escmail.orl.mmc.com> (raw)
In-Reply-To: 4n1its$rtt@news2.h1.usa.pipeline.com
Jon S Anthony wrote:
>
> In article <31987C20.167EB0E7@escmail.orl.mmc.com> "Theodore E. Dennison" <dennison@escmail.orl.mmc.com> writes:
>
> > ARRAYS of boolean in a bitwise fashion. So why bother with some fancy
> > generic ADT package (that might have bugs)?
>
> Simple. If the universe over which you can construct sets is "big",
> but the sets themselves are typically not "so big" relative to the
> universe (the cardinality of the compliment of any set >> cardinality
> of the set - at least typically...) then the array of boolean impl.
> offers poor quality of service (maybe not even plausible...). Also,
What? You don't LIKE bit arrays that take up 1/8th of your virtual
memory space? :-)
O.K. But most Modula-2 compilers couldn't handle sets that large either.
What you are describing is more of a list than a set. An ADT would be
put to good use in making a list look like a set.
--
T.E.D.
| Work - mailto:dennison@escmail.orl.mmc.com |
| Home - mailto:dennison@iag.net |
| URL - http://www.iag.net/~dennison |
prev parent reply other threads:[~1996-05-15 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
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 [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox