Logical Expression Parser Tree

See more:

C++

C#

expression

trees

Hello,
I am working on an algorithm and perhaps an implementation in C++/c# for logical expressions. I want this logical expression for example, k = ((((a+b)'c)+((d+e)'f))g. My task is to put this expression in a short DNF / Sum of Products form such as abc'+bdf'+.... To do this I planned to put the expression in a tree like :
.
| |
+ g
|
Not.
..
..
.. and so on. Then I will apply de-morgan rule and at the last step Distribution law of multiplication over +. However I am facing problems about implementation. During my research many people are using Linq.Expression system classes or some articles are about Evaluant.Anltr framework to create tree. I want to indicate that I do not want to evaluate the logical expression. I just want to have Sum of Products form. Is there anyone who did similar thing so can give me some hints? Perhaps I dont expect a source code or smt but at least it will be nice to get some tips or guidence to create a hierarchic tree
Best regards