diff --git a/BooleanExpressionSolver/BooleanExpressionSolver/BooleanExpressionSolver.csproj b/BooleanExpressionSolver/BooleanExpressionSolver/BooleanExpressionSolver.csproj index d5fac2a..7c9ebc0 100644 --- a/BooleanExpressionSolver/BooleanExpressionSolver/BooleanExpressionSolver.csproj +++ b/BooleanExpressionSolver/BooleanExpressionSolver/BooleanExpressionSolver.csproj @@ -14,6 +14,22 @@ 4 true true + false + G:\GitHub\Boolean-Expression-Solver\Release\ + true + Disk + false + Foreground + 7 + Days + false + false + true + 2 + 1.0.0.%2a + false + true + true AnyCPU @@ -34,6 +50,21 @@ prompt 4 + + 55156D986F7B5952CF9763252329FC682311E5C7 + + + BooleanExpressionSolver_TemporaryKey.pfx + + + true + + + true + + + icon.ico + @@ -86,6 +117,7 @@ ResXFileCodeGenerator Resources.Designer.cs + SettingsSingleFileGenerator Settings.Designer.cs @@ -94,5 +126,20 @@ + + + False + Microsoft .NET Framework 4.7.2 %28x86 and x64%29 + true + + + False + .NET Framework 3.5 SP1 + false + + + + + \ No newline at end of file diff --git a/BooleanExpressionSolver/BooleanExpressionSolver/icon.ico b/BooleanExpressionSolver/BooleanExpressionSolver/icon.ico new file mode 100644 index 0000000..8d3eac4 Binary files /dev/null and b/BooleanExpressionSolver/BooleanExpressionSolver/icon.ico differ diff --git a/Images/mainMenu.png b/Images/mainMenu.png new file mode 100644 index 0000000..cb012ca Binary files /dev/null and b/Images/mainMenu.png differ diff --git a/README.md b/README.md index 3c5ecff..2fce0f7 100644 --- a/README.md +++ b/README.md @@ -1,5 +1,7 @@ # Boolean Algebra Expression Solver -This application is a simple boolean algebra expression solver coded in C# using WPF. The purpose of this program was to help me learn WPF as well as utilise reverse polish notation and the shunting yard algorithm. This application takes a boolean expression as an input and outputs its corresponding truth table. +This application is a simple Boolean algebra expression solver coded in C# using WPF. The purpose of this program was to help me learn WPF as well as utilize reverse polish notation and the shunting yard algorithm. This application takes a Boolean expression as an input and outputs its corresponding truth table. + +![Main Menu](Images/mainMenu.png) ## How To Use 1. Insert the number of terms you wish to evaluate in the "Number Of Terms" textbox