Hey all, one thing that i *suck* at is simplifying complicated boolean expressions. I'm nearly always certain that there's a much clearer and more condensed way to write things, but my brain locks ...

The boolean expression is parsed and an object graph is constructed. This graph consists of instances of Negation, Conjunction, Disjunction. It also contains literal strings. A set of boolean ...