Build an AST (JSON object) from a logic expression string

 const logicExpression = 'a AND b OR c';

 const bracketTree = new BracketTree(); bracketTree.applyExpression(expr) // handle errors const logicTree = new LogicTree(bracketTree.root)

 console.log(logicTree.root); { name: 'node0', content: 'a AND b OR c', orParams: [{ text: 'a AND b', andParams: [{ name: 'a' }, { name: 'b' }] }, { text: 'c', andParams: [{ name: 'c' }] }] }

• Logical negation NOT
• Logical conjunction AND
  • Logical NAND
• Logical disjunction OR
  • Logical NOR
  • Logical exclusive disjunction XOR
  • Logical equality XNOR

https://en.wikipedia.org/wiki/Logical_connective

Input boolean expression: (true OR false) AND NOT(false) OR true OR false

• A negation operator is unary. It applicable for one node only.
• Put it as a property of the corresponding node of the tree: node.isNegation = true

• a NAND b == NOT(A AND B)
• a XOR b == (a OR b) AND (a NAND b)
• a XNOR b == NOT(a XOR b)

• AND can contain only ORs (1 to many)
• OR can contain only ANDs (1 to many)

 // input (a OR b) AND NOT(c) OR d OR e // output { name: 'node0', content: '(a OR b) AND NOT(c) OR d OR e', orParams: [{ text: '(a OR b) AND NOT(c)', andParams: [{ name: 'node0', content: 'a OR b', orParams: [{ text: 'a', andParams: [{ name: 'a' }] }, { text: 'b', andParams: [{ name: 'b' }] }] }, { name: 'c', isNegation: true }] }, { text: 'd', andParams: [{ name: 'd' }] }, { text: 'e', andParams: [{name: 'e' }] }] }

Where:

• nodeX - specific name for a parameter, which contains a group of other parameters, where X - order number of a node in a list of operators
• isNegation - adds Logical negation (NOT) to the corresponding parameter

• calculate a result of a logic expression: a>3 AND a<5 == false // (if a = 8)
• build a presentational string, using any syntax (SQL, JAVA, PASCAL, etc.): a AND b OR NOT c --> a && b || !c
• draw a tree diagram for any logic expression
• build a decision tree
• etc.