Dynamically evaluating simple boolean logic in Python?

Question

I've got some dynamically-generated boolean logic expressions, like: * (A or B) and (C or D) * A or (A and B) * A * _empty - evaluates to True_ The placeholders get replaced with booleans. Should I, 1. Convert this information to a Python expression like `True or (True or False)` and `eval` it? 1. Create a binary tree where a node is either a `bool` or `Conjunction`/`Disjunction` object and recursively evaluate it? 1. Convert it into nested S-expressions and use a Lisp parser? 4. Something else? Suggestions welcome.

Answer 1

Unless your logic expression is really really big, converting to a tree and writing an evaluator for it is a very reasonable approach. Depending on the depth, you might hit a stack overflow with the recursive approach.

Where are you getting the input from? What other constraints do you have? That might help shape a solution.