Hey, I'm currently working with propositional boolean formulae of the type 'A & (b -> c)' (for example). I was wondering if anybody knows of a Python library to create parse trees and convert such formulae to conjunctive, disjunctive and Tseitin normal forms? Cheers, nnp -- http://www.unprotectedhex.com http://www.smashthestack.org