Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!ames!amdahl!pacbell!att!occrsh!uokmax!cbdougla
From: cbdougla@uokmax.UUCP (Collin Broadrick Douglas)
Newsgroups: comp.sys.apple
Subject: Program
Keywords: Tabulation
Message-ID: <3044@uokmax.UUCP>
Date: 23 Apr 89 06:52:49 GMT
Reply-To: cbdougla@uokmax.UUCP (Collin Broadrick Douglas)
Distribution: usa
Organization: University of Oklahoma, ECN
Lines: 17


   I am writing a program do solve Boolean expressions using the Tabulation
   method.  It will take some more work but I think I can do it.  So far
   I've gotten through assigning the places for all minterms and finding
   all minterms that can be ignored.  I had a problem with storing prime
   implacants (i was going to use a string but I soon realized that that
   string would have to have a length of 32767 characters... not good). 

   Is anyone interested in this program?  I'll probably write it is either
   TML BASIC, or TML Pascal for the GS.  As soon as I get the bugs worked out
   I'll make a version for Applesoft (if possible -- my early version can 
   handle 15 literals but requires a LOT of memory.  I've got several
   ideas on how to make it more efficient though).

   Any input would be greatly appreciated.

				Collin Douglas