Last active
March 20, 2018 21:28
-
-
Save vadimkorr/7735dde4f73395f03a3e2b487e547529 to your computer and use it in GitHub Desktop.
Parse tree and find result of expression'
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const tree = { | |
| and: { | |
| left: { | |
| and: { | |
| left: { | |
| le: { | |
| left: { | |
| fieldRef: "a.count" | |
| }, | |
| right: { | |
| integer: 18 | |
| } | |
| } | |
| }, | |
| right: { | |
| gt: { | |
| left: { | |
| integer: 99 | |
| }, | |
| right: { | |
| fieldRef: "a.count" | |
| } | |
| } | |
| } | |
| } | |
| }, | |
| right: { | |
| eq: { | |
| left: { | |
| fieldRef: 'a.thing' | |
| }, | |
| right: { | |
| boolean: false | |
| } | |
| } | |
| } | |
| } | |
| } | |
| let a = { thing: false, count: 18 }; | |
| function proc(data, tree) { | |
| let key = Object.keys(tree)[0]; | |
| switch(key) { | |
| //OPERATIONS | |
| case 'and': {//AND | |
| let lOp = proc(data, tree[key].left); | |
| let rOp = proc(data, tree[key].right); | |
| return { | |
| res: lOp.res && rOp.res, | |
| exp: "(" + lOp.exp + " & " + rOp.exp + ")" | |
| } | |
| } | |
| case 'le': {//LESS OR EQ | |
| let lOp = proc(data, tree[key].left); | |
| let rOp = proc(data, tree[key].right); | |
| return { | |
| res: lOp.res <= rOp.res, | |
| exp: "(" + lOp.exp + " <= " + rOp.exp + ")" | |
| } | |
| } | |
| case 'gt': {//GRATER | |
| let lOp = proc(data, tree[key].left); | |
| let rOp = proc(data, tree[key].right); | |
| return { | |
| res: lOp.res > rOp.res, | |
| exp: "(" + lOp.exp + " > " + rOp.exp + ")" | |
| } | |
| } | |
| case 'eq': {//EQUAL | |
| let lOp = proc(data, tree[key].left); | |
| let rOp = proc(data, tree[key].right); | |
| return { | |
| res: lOp.res == rOp.res, | |
| exp: "(" + lOp.exp + " == " + rOp.exp + ")" | |
| } | |
| } | |
| //VALUES | |
| case 'fieldRef': {//CUSTOM | |
| let val = data[tree[key].split('.')[1]]; | |
| return { | |
| res: val, | |
| exp: val | |
| }; | |
| } | |
| case 'integer': {//INTEGER | |
| let val = tree[key]; | |
| return { | |
| res: val, | |
| exp: val | |
| }; | |
| } | |
| case 'boolean': {//BOOLEAN | |
| let val = tree[key]; | |
| return { | |
| res: val, | |
| exp: val | |
| }; | |
| } | |
| default: { | |
| throw new Error("Unknown value " + key); | |
| } | |
| } | |
| } | |
| console.log(proc(a, tree)) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment