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' }]
}]
}
a | b | AND | OR | NAND | NOR | XOR | XNOR |
---|---|---|---|---|---|---|---|
0 | 0 | 0 | 0 | 1 | 1 | 0 | 1 |
0 | 1 | 0 | 1 | 1 | 0 | 1 | 0 |
1 | 0 | 0 | 1 | 1 | 0 | 1 | 0 |
1 | 1 | 1 | 1 | 0 | 0 | 0 | 1 |
Language | Negation | Conjunction | Disjunction | XOR |
---|---|---|---|---|
C++ | ! | && | || | ^ |
Fortran | .NOT. | .AND. | .OR. | .XOR. |
Java | ! | && | || | ^ |
Pascal | not | and | or | xor |
PL/I | ¬ | & | | | ^ |
Prolog | + | , | ; | |
Turbo Basic | NOT | AND | OR | XOR |
SQL | NOT | AND | OR | |
English | not | and | or | either |
Russian | не | и | или | либо |
https://en.wikipedia.org/wiki/Logical_connective
Input boolean expression: (true OR false) AND NOT(false) OR true OR false
node.isNegation = true
Syntax | Precedence |
---|---|
parenthesis | 1 |
NOT | 2 |
AND | 3 |
OR | 4 |
// 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 operatorsisNegation
- adds Logical negation (NOT) to the corresponding parametera>3 AND a<5 == false // (if a = 8)
a AND b OR NOT c --> a && b || !c