logic-engineering

Requirements

To run this project, Visual Studio, .NET Core and Graphviz are required

Project description

In this project, propositional logical formulas are being parsed. The input format of the formulas however, have to be in ASCII as can be seen in the figure below.

Propositional formulas are parsed into a binary tree using recursion and after that, the following operations are being performed:

• A truth table is created from the binary tree
• A simplified truth table is created from the truth table
• A DNF formula of the propositional formula is created from the truth table and the simplified truth table
• A NAND formula is created from the binary tree

Project design

The project is built by using OO design principles as can be seen in the figure below.