Tries to compile all rules defined in the problem file. Each expression is compiled to a BDD. Afterwards the BDDs are and'ed together, depending on which ordering is chosen. The order of the compilation can be set three different ways: Static: In the same order the expressions are written in the problem. Ascending: The order depends on the node count of each expression. Smallest node count is and'ed with the result BDD first. Dynamic: The two smallest BDDs are and'ed, and the result is placed back in the queue. This is continued until we have only one element left in the queue, which is the final result BDD.
Result "buddy_sharp.Bdd" of the expressions.
| Exception Type | Condition |
|---|---|
| ClabInternalErrorException | When using an unknown "CLab.Auxiliary.Common.CompileMethod" |