package org.wcong.test.algorithm.cracking.dp_divide_conque;

import java.util.List;

/**
 * given a boolean evaluation consisting of symbol
 * 0(false),1(true),&(and),|(OR),and ^(XOR) and a desired boolean result Result
 * implement a function to count the number of ways of parenthesizing the expressions
 * such that it evaluates to result.
 * the expression should be fully parenthesized
 *
 * @author wcong<wc19920415@gmail.com>
 * @since 19/04/2017
 */
public class BooleanEvaluation {

	public int count(String expression, boolean result) {
		return 0;
	}

}
