Re: boolean -> DNF
Am Montag, 4. April 2005 15:08 schrieb Alex Polite:
> I'd like to skip BoolStuff and do it all in python but I have no idea
> where to start. Anyone out there with a PhD in computer science that
> can give me a starting point?
I once wrote a library which implemented parsing boolean expressions (with a
simple homegrown parser) and reprinting the tree (to print it in DNF-Form is
a pretty simple algorithm once you have the tree structure, I didn't
implement this, but if you ask me I will).
I don't have access to it at the moment (because I created it at home), but
I'll send it to you tonight if you just contact me off-list.
listening to: Nine Inch Nails - The Wretched
see you at: http://www.stud.mh-hannover.de/~hwundram/wordpress/
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.1 (GNU/Linux)
-----END PGP SIGNATURE-----
|All times are GMT. The time now is 04:19 AM.|
Powered by vBulletin®. Copyright ©2000 - 2013, vBulletin Solutions, Inc.
SEO by vBSEO ©2010, Crawlability, Inc.