Hi Everyone,

I was wondering, if I can try to solve boolean expression using recurssion in C++. But being a beginner, I am not able to get progress in this. I'll be getting the expression like a string. I have generated a truth table using standard bitwise techniques, but not able to understand how to simplify such complex expressions. eg : (a+(b.c)).(d+e.f)+(g.(t+h)) here, alphabets are boolean var, and + represents bitwise OR , '.' represents bitwise AND. Anyhelp will be appreciated :)