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,start
X-Google-Attributes: gid103376,public
From: boaz@usa.pipeline.com(Boaz Chow)
Subject: NFA to DFA
Date: 1996/05/11
Message-ID: <4n1its$rtt@news2.h1.usa.pipeline.com>#1/1
X-Deja-AN: 154416504
x-pipeuser: boaz
x-pipehub: usa.pipeline.com
organization: Pipeline USA
newsgroups: comp.lang.ada
x-pipegcos: (Boaz Chow)
Date: 1996-05-11T00:00:00+00:00
List-Id: <comp.lang.ada>


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