Is your feature request related to a problem? Please describe.
Users' input might not be valid as a SoP. This will be implemented to validate the input of the user and ensure the expression is in SoP form, which is a boolean expression of OR operations (sums) between AND operations (Products).
For example: (ac) + (d’e) + (bc').
Describe the solution you'd like
Making a C++ parser that takes in a string and parses it looking for SoP (Sum of Products) expressions by adhering to the following constraints:
Expressions in PoS form are rejected.
Single product terms are considered SoP.
Product terms separated by + operator are considered SoP.
White space is ignored between operators such as + or *.
ORed terms inside of parentheses are allowed if and only if they are followed by an OR operator once the parentheses are closed.
Describe alternatives you've considered
Using Regex code to program the matching of the expression string.
Is your feature request related to a problem? Please describe. Users' input might not be valid as a SoP. This will be implemented to validate the input of the user and ensure the expression is in SoP form, which is a boolean expression of
ORoperations (sums) betweenANDoperations (Products). For example:(ac) + (d’e) + (bc').Describe the solution you'd like Making a
C++parser that takes in a string and parses it looking for SoP (Sum of Products) expressions by adhering to the following constraints:+or*.ORed terms inside of parentheses are allowed if and only if they are followed by anORoperator once the parentheses are closed.Describe alternatives you've considered Using
Regexcode to program the matching of the expression string.