comp.lang.ada
 help / color / mirror / Atom feed
From: boaz@usa.pipeline.com(Boaz Chow)
Subject: NFA to DFA
Date: 1996/05/11
Date: 1996-05-11T00:00:00+00:00	[thread overview]
Message-ID: <4n1its$rtt@news2.h1.usa.pipeline.com> (raw)


do you know how to implement SET adt and the operations in Ada? 
 
I have this project that requires me to check if a pattern is in a given
string by converting NFA to DFA. 
 
for example : 
 
abcd is in the string difjdabcddkjf 
 
I have done this with a short cut (i.e. I've done this without using SET) 
 
but that's only the first part.  the second part requires me to write a
program that generates another program (a source code) that implement the
operation for transfering a NFA to a DFA.  This I need SET!  ADA does not
have SET!!! 
 
I have tried to use an array to implement set but that gives me a big
problem. 
 
any idea on what the best way to implement SET? 
-- 
   ______   Meow 
   \ OO /  _/  
  :(__ =) 
    U \\ 
 
http://www.sci.csupomona.edu/~cchow 





             reply	other threads:[~1996-05-11  0:00 UTC|newest]

Thread overview: 8+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
1996-05-11  0:00 Boaz Chow [this message]
1996-05-13  0:00 ` NFA to DFA 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
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox