Skip to content

Latest commit

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Refactoring an expression tree

Refactor and improve tree.js to use the SOLID principles.

Implementation

1. Interface Segregation Principle

The current Node API breaks the SOLID interface segregation principle:

constNode=(operator,value,left,right)=>{..};

It forces to pass an empty string for the operator parameter and null for the left and right nodes for the leaf (value) nodes and null for the value parameter for internal (operation) nodes:

constvalueNode1=Node("",4,null,null);constvalueNode2=Node("",2,null,null);constdivisionNode=Node("÷",null,valueNode1,valueNode2);

We can see that the each type of node accepts completely opposite parameters so their interfaces have to be segregated to make them smaller and more reasonable.

With the interfaces segregated, we no longer have to pass redundant properties to each type of node:

constvalueNode1=Value(4);constvalueNode2=Value(2);constdivisionNode=Divide(valueNode1,valueNode2);

2. Open/Closed Principle

Both the switch statement in the result method

switch(operator){case"+":
returnleft.result()+right.result();case"-":
returnleft.result()-right.result();case"x":
returnleft.result() \*right.result();case"÷":
returnleft.result()/right.result();default:
returnvalue;}

and the switch statement in the toString method

switch(operator){case"+":
return`(${left.toString()} + ${right.toString()})`;case"-":
return`(${left.toString()} - ${right.toString()})`;case"x":
return`(${left.toString()} x ${right.toString()})`;case"÷":
return`(${left.toString()} ÷ ${right.toString()})`;default:
returnvalue.toString();}

violate the SOLID open/closed principle.

To add a new expression (outside of the Node class), we have to modify the existing code (inside the Node class) - so it's not "closed off" and easily extendable. This also causes code to be harder to read, maintain and be more error-prone.

Instead of having these switch statements based on type (operator), they can be broken off in small, individual classes. To enforce class compatibility and for polymorphism to work, an interface containing both result and toString methods has to be implemented:

interfaceIResultable{result: ()=>number;}interfaceIPrintable{toString: ()=>string;}

New node classes "implementing" both interfaces:

constValue=(value)=>({
value,result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({
left,
right,result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({
left,
right,result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({
left,
right,result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({
left,
right,result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

3. Encapsulation

The initial Node API implementation is missing any kind of encapsulation, exposing implementation details as every property and method is available:

return{
operator,
value,
left,
right,
result,
toString,};

The previously implemented interfaces indicate which methods need to be exposed for a consistent API, hiding the implementation details with the help of a closure:

constValue=(value)=>({result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});

4. Single Responsibility Principle

Both the initial Node implementation and the one above violate the single responsibility principle of SOLID. The classes handle both the calculation logic (result) and the printing logic (toString). To avoid having to make changes to the classes when the printing logic changes, the printing logic should be factored out to a seperate module:

constprintValue=(value)=>`${value}`;constprintExpression=(left,right,operation)=>`(${left.toString()}${operation}${right.toString()})`;module.exports={
printValue,
printExpression,};

Importing and using the printing module means that if the printing logic changes, no changes to the classes will be required.

const{ printValue, printExpression }=require("./print");constValue=(value)=>({result: ()=>value,toString: ()=>printValue(value),});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>printExpression(left,right,"+"),});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>printExpression(left,right,"-"),});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>printExpression(left,right,"*"),});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>printExpression(left,right,"÷"),});

5. Dependency Injection

Although the responsibility of calculation is now separated from printing with the help of the printing module, the two responsibilities are still coupled together as changing the printing method altogether will still cause changes to the class.

To avoid this, we can make the dependency easily switchable with a higher-order function:

// Import or define new printing functions.constmakeValue=(toString)=>(value)=>({result: ()=>value,toString: ()=>toString(value),});constmakeAdd=(toString)=>(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,"+"),});constmakeSubtract=(toString)=>(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,"-"),});constmakeMultiply=(toString)=>(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,"x"),});constmakeDivide=(toString)=>(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,"÷"),});// Pass the printing functions to the higher-order functions to create the classes.constValue=makeValue(printValue);constAdd=makeAdd(printExpression);constSubtract=makeSubtract(printExpression);constMultiply=makeMultiply(printExpression);constDivide=makeDivide(printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

6. Input validation

Following point 4 and point 5, for input validaiton we can create a separate validation module:

const{ number }=require("../utils");constvalidateValue=(value)=>{if(!number.isNumber(value)){thrownewError(`The value "${value}" is not a numerical value!`);}};constvalidateExpression=(left,right,operation)=>{if(!left?.result||!right?.result){thrownewError(`The operation "${operation}" is missing an operand!`);}};constvalidateDivide=(left,right,operation)=>{validateExpression(left,right,operation);if(right.result()===0){thrownewError(`The right-hand side operand "${right.toString()}" for Divide must be non-zero!`);}};module.exports={
validateValue,
validateExpression,
validateDivide,};

Which then gets imported and injected through the same higher-order functions:

const{
validateValue,
validateExpressio,
validateDivide,}=require("./validation");constmakeValue=(validateValue,toString)=>(value)=>{validateValue(value);return{result: ()=>value,toString: ()=>toString(value),};};constmakeAdd=(validateExpression,toString)=>(left,right)=>{constoperation="+";validateExpression(left,right,operation);return{result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,operation),};};constmakeSubtract=(validateExpression,toString)=>(left,right)=>{constoperation="-";validateExpression(left,right,operation);return{result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,operation),};};constmakeMultiply=(validateExpression,toString)=>(left,right)=>{constoperation="x";validateExpression(left,right,operation);return{result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,operation),};};constmakeDivide=(validateDivide,toString)=>(left,right)=>{constoperation="÷";validateDivide(left,right,operation);return{result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,operation),};};// Pass in the additional argument for validation to the higher-order functions.constValue=makeValue(validateValue,printValue);constAdd=makeAdd(validateExpression,printExpression);constSubtract=makeSubtract(validateExpression,printExpression);constMultiply=makeMultiply(validateExpression,printExpression);constDivide=makeDivide(validateDivide,printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

Testing

See test.js for the test cases.

Running

Main:

node index.js

Tests:

node test.js

About

An abstract syntax tree implementation using SOLID design principles

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Add copy buttons to all
 blocks
(function() {
function addCopyButtons() {
document.querySelectorAll('pre code').forEach(function(codeBlock) {
if (codeBlock.parentElement.hasAttribute('data-copy-added')) return;
codeBlock.parentElement.setAttribute('data-copy-added', 'true');
var btn = document.createElement('button');
btn.textContent = 'Copy';
btn.style.cssText = 'position:absolute;top:4px;right:4px;padding:2px 8px;font-size:11px;background:#4ecdc4;border:none;border-radius:4px;color:#1a1a2e;cursor:pointer;opacity:0.7;transition:opacity 0.2s;';
btn.onmouseover = function() { this.style.opacity = '1'; };
btn.onmouseout = function() { this.style.opacity = '0.7'; };
btn.onclick = function() {
navigator.clipboard.writeText(codeBlock.textContent).then(function() {
btn.textContent = 'Copied!';
setTimeout(function() { btn.textContent = 'Copy'; }, 1500);
});
};
codeBlock.parentElement.style.position = 'relative';
codeBlock.parentElement.appendChild(btn);
});
}
addCopyButtons();
// Re-run on dynamic content
var observer = new MutationObserver(addCopyButtons);
observer.observe(document.body, { childList: true, subtree: true });
})();
}
} catch(__e) { console.warn('[Userscript:Add Copy Buttons to Code Blocks]', __e); }
})();
(function(){
try {
var __m = "github.com";
var __re = new RegExp('^' + "github\\.com" + '
GitHub - druvisc/solid-abstract-syntax-tree: An abstract syntax tree implementation using SOLID design principles · GitHub
Skip to content

Latest commit

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Refactoring an expression tree

Refactor and improve tree.js to use the SOLID principles.

Implementation

1. Interface Segregation Principle

The current Node API breaks the SOLID interface segregation principle:

constNode=(operator,value,left,right)=>{..};

It forces to pass an empty string for the operator parameter and null for the left and right nodes for the leaf (value) nodes and null for the value parameter for internal (operation) nodes:

constvalueNode1=Node("",4,null,null);constvalueNode2=Node("",2,null,null);constdivisionNode=Node("÷",null,valueNode1,valueNode2);

We can see that the each type of node accepts completely opposite parameters so their interfaces have to be segregated to make them smaller and more reasonable.

With the interfaces segregated, we no longer have to pass redundant properties to each type of node:

constvalueNode1=Value(4);constvalueNode2=Value(2);constdivisionNode=Divide(valueNode1,valueNode2);

2. Open/Closed Principle

Both the switch statement in the result method

switch(operator){case"+":
returnleft.result()+right.result();case"-":
returnleft.result()-right.result();case"x":
returnleft.result() \*right.result();case"÷":
returnleft.result()/right.result();default:
returnvalue;}

and the switch statement in the toString method

switch(operator){case"+":
return`(${left.toString()} + ${right.toString()})`;case"-":
return`(${left.toString()} - ${right.toString()})`;case"x":
return`(${left.toString()} x ${right.toString()})`;case"÷":
return`(${left.toString()} ÷ ${right.toString()})`;default:
returnvalue.toString();}

violate the SOLID open/closed principle.

To add a new expression (outside of the Node class), we have to modify the existing code (inside the Node class) - so it's not "closed off" and easily extendable. This also causes code to be harder to read, maintain and be more error-prone.

Instead of having these switch statements based on type (operator), they can be broken off in small, individual classes. To enforce class compatibility and for polymorphism to work, an interface containing both result and toString methods has to be implemented:

interfaceIResultable{result: ()=>number;}interfaceIPrintable{toString: ()=>string;}

New node classes "implementing" both interfaces:

constValue=(value)=>({
value,result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({
left,
right,result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({
left,
right,result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({
left,
right,result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({
left,
right,result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

3. Encapsulation

The initial Node API implementation is missing any kind of encapsulation, exposing implementation details as every property and method is available:

return{
operator,
value,
left,
right,
result,
toString,};

The previously implemented interfaces indicate which methods need to be exposed for a consistent API, hiding the implementation details with the help of a closure:

constValue=(value)=>({result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});

4. Single Responsibility Principle

Both the initial Node implementation and the one above violate the single responsibility principle of SOLID. The classes handle both the calculation logic (result) and the printing logic (toString). To avoid having to make changes to the classes when the printing logic changes, the printing logic should be factored out to a seperate module:

constprintValue=(value)=>`${value}`;constprintExpression=(left,right,operation)=>`(${left.toString()}${operation}${right.toString()})`;module.exports={
printValue,
printExpression,};

Importing and using the printing module means that if the printing logic changes, no changes to the classes will be required.

const{ printValue, printExpression }=require("./print");constValue=(value)=>({result: ()=>value,toString: ()=>printValue(value),});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>printExpression(left,right,"+"),});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>printExpression(left,right,"-"),});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>printExpression(left,right,"*"),});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>printExpression(left,right,"÷"),});

5. Dependency Injection

Although the responsibility of calculation is now separated from printing with the help of the printing module, the two responsibilities are still coupled together as changing the printing method altogether will still cause changes to the class.

To avoid this, we can make the dependency easily switchable with a higher-order function:

// Import or define new printing functions.constmakeValue=(toString)=>(value)=>({result: ()=>value,toString: ()=>toString(value),});constmakeAdd=(toString)=>(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,"+"),});constmakeSubtract=(toString)=>(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,"-"),});constmakeMultiply=(toString)=>(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,"x"),});constmakeDivide=(toString)=>(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,"÷"),});// Pass the printing functions to the higher-order functions to create the classes.constValue=makeValue(printValue);constAdd=makeAdd(printExpression);constSubtract=makeSubtract(printExpression);constMultiply=makeMultiply(printExpression);constDivide=makeDivide(printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

6. Input validation

Following point 4 and point 5, for input validaiton we can create a separate validation module:

const{ number }=require("../utils");constvalidateValue=(value)=>{if(!number.isNumber(value)){thrownewError(`The value "${value}" is not a numerical value!`);}};constvalidateExpression=(left,right,operation)=>{if(!left?.result||!right?.result){thrownewError(`The operation "${operation}" is missing an operand!`);}};constvalidateDivide=(left,right,operation)=>{validateExpression(left,right,operation);if(right.result()===0){thrownewError(`The right-hand side operand "${right.toString()}" for Divide must be non-zero!`);}};module.exports={
validateValue,
validateExpression,
validateDivide,};

Which then gets imported and injected through the same higher-order functions:

const{
validateValue,
validateExpressio,
validateDivide,}=require("./validation");constmakeValue=(validateValue,toString)=>(value)=>{validateValue(value);return{result: ()=>value,toString: ()=>toString(value),};};constmakeAdd=(validateExpression,toString)=>(left,right)=>{constoperation="+";validateExpression(left,right,operation);return{result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,operation),};};constmakeSubtract=(validateExpression,toString)=>(left,right)=>{constoperation="-";validateExpression(left,right,operation);return{result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,operation),};};constmakeMultiply=(validateExpression,toString)=>(left,right)=>{constoperation="x";validateExpression(left,right,operation);return{result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,operation),};};constmakeDivide=(validateDivide,toString)=>(left,right)=>{constoperation="÷";validateDivide(left,right,operation);return{result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,operation),};};// Pass in the additional argument for validation to the higher-order functions.constValue=makeValue(validateValue,printValue);constAdd=makeAdd(validateExpression,printExpression);constSubtract=makeSubtract(validateExpression,printExpression);constMultiply=makeMultiply(validateExpression,printExpression);constDivide=makeDivide(validateDivide,printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

Testing

See test.js for the test cases.

Running

Main:

node index.js

Tests:

node test.js

About

An abstract syntax tree implementation using SOLID design principles

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Force GitHub README to respect dark mode (function() { var style = document.createElement('style'); style.textContent = ' .markdown-body { color-scheme: dark light; } .markdown-body pre { background: #161b22 !important; } .markdown-body code { background: rgba(110, 118, 129, 0.4) !important; } .markdown-body table th, .markdown-body table td { border-color: #30363d !important; } .markdown-body img { background: #0d1117; } .markdown-body blockquote { border-left-color: #8b949e; } .markdown-body hr { border-color: #30363d; } '; document.head.appendChild(style); })(); } } catch(__e) { console.warn('[Userscript:GitHub Dark Mode README Fix]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - druvisc/solid-abstract-syntax-tree: An abstract syntax tree implementation using SOLID design principles · GitHub
Skip to content

Latest commit

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Refactoring an expression tree

Refactor and improve tree.js to use the SOLID principles.

Implementation

1. Interface Segregation Principle

The current Node API breaks the SOLID interface segregation principle:

constNode=(operator,value,left,right)=>{..};

It forces to pass an empty string for the operator parameter and null for the left and right nodes for the leaf (value) nodes and null for the value parameter for internal (operation) nodes:

constvalueNode1=Node("",4,null,null);constvalueNode2=Node("",2,null,null);constdivisionNode=Node("÷",null,valueNode1,valueNode2);

We can see that the each type of node accepts completely opposite parameters so their interfaces have to be segregated to make them smaller and more reasonable.

With the interfaces segregated, we no longer have to pass redundant properties to each type of node:

constvalueNode1=Value(4);constvalueNode2=Value(2);constdivisionNode=Divide(valueNode1,valueNode2);

2. Open/Closed Principle

Both the switch statement in the result method

switch(operator){case"+":
returnleft.result()+right.result();case"-":
returnleft.result()-right.result();case"x":
returnleft.result() \*right.result();case"÷":
returnleft.result()/right.result();default:
returnvalue;}

and the switch statement in the toString method

switch(operator){case"+":
return`(${left.toString()} + ${right.toString()})`;case"-":
return`(${left.toString()} - ${right.toString()})`;case"x":
return`(${left.toString()} x ${right.toString()})`;case"÷":
return`(${left.toString()} ÷ ${right.toString()})`;default:
returnvalue.toString();}

violate the SOLID open/closed principle.

To add a new expression (outside of the Node class), we have to modify the existing code (inside the Node class) - so it's not "closed off" and easily extendable. This also causes code to be harder to read, maintain and be more error-prone.

Instead of having these switch statements based on type (operator), they can be broken off in small, individual classes. To enforce class compatibility and for polymorphism to work, an interface containing both result and toString methods has to be implemented:

interfaceIResultable{result: ()=>number;}interfaceIPrintable{toString: ()=>string;}

New node classes "implementing" both interfaces:

constValue=(value)=>({
value,result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({
left,
right,result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({
left,
right,result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({
left,
right,result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({
left,
right,result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

3. Encapsulation

The initial Node API implementation is missing any kind of encapsulation, exposing implementation details as every property and method is available:

return{
operator,
value,
left,
right,
result,
toString,};

The previously implemented interfaces indicate which methods need to be exposed for a consistent API, hiding the implementation details with the help of a closure:

constValue=(value)=>({result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});

4. Single Responsibility Principle

Both the initial Node implementation and the one above violate the single responsibility principle of SOLID. The classes handle both the calculation logic (result) and the printing logic (toString). To avoid having to make changes to the classes when the printing logic changes, the printing logic should be factored out to a seperate module:

constprintValue=(value)=>`${value}`;constprintExpression=(left,right,operation)=>`(${left.toString()}${operation}${right.toString()})`;module.exports={
printValue,
printExpression,};

Importing and using the printing module means that if the printing logic changes, no changes to the classes will be required.

const{ printValue, printExpression }=require("./print");constValue=(value)=>({result: ()=>value,toString: ()=>printValue(value),});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>printExpression(left,right,"+"),});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>printExpression(left,right,"-"),});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>printExpression(left,right,"*"),});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>printExpression(left,right,"÷"),});

5. Dependency Injection

Although the responsibility of calculation is now separated from printing with the help of the printing module, the two responsibilities are still coupled together as changing the printing method altogether will still cause changes to the class.

To avoid this, we can make the dependency easily switchable with a higher-order function:

// Import or define new printing functions.constmakeValue=(toString)=>(value)=>({result: ()=>value,toString: ()=>toString(value),});constmakeAdd=(toString)=>(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,"+"),});constmakeSubtract=(toString)=>(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,"-"),});constmakeMultiply=(toString)=>(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,"x"),});constmakeDivide=(toString)=>(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,"÷"),});// Pass the printing functions to the higher-order functions to create the classes.constValue=makeValue(printValue);constAdd=makeAdd(printExpression);constSubtract=makeSubtract(printExpression);constMultiply=makeMultiply(printExpression);constDivide=makeDivide(printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

6. Input validation

Following point 4 and point 5, for input validaiton we can create a separate validation module:

const{ number }=require("../utils");constvalidateValue=(value)=>{if(!number.isNumber(value)){thrownewError(`The value "${value}" is not a numerical value!`);}};constvalidateExpression=(left,right,operation)=>{if(!left?.result||!right?.result){thrownewError(`The operation "${operation}" is missing an operand!`);}};constvalidateDivide=(left,right,operation)=>{validateExpression(left,right,operation);if(right.result()===0){thrownewError(`The right-hand side operand "${right.toString()}" for Divide must be non-zero!`);}};module.exports={
validateValue,
validateExpression,
validateDivide,};

Which then gets imported and injected through the same higher-order functions:

const{
validateValue,
validateExpressio,
validateDivide,}=require("./validation");constmakeValue=(validateValue,toString)=>(value)=>{validateValue(value);return{result: ()=>value,toString: ()=>toString(value),};};constmakeAdd=(validateExpression,toString)=>(left,right)=>{constoperation="+";validateExpression(left,right,operation);return{result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,operation),};};constmakeSubtract=(validateExpression,toString)=>(left,right)=>{constoperation="-";validateExpression(left,right,operation);return{result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,operation),};};constmakeMultiply=(validateExpression,toString)=>(left,right)=>{constoperation="x";validateExpression(left,right,operation);return{result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,operation),};};constmakeDivide=(validateDivide,toString)=>(left,right)=>{constoperation="÷";validateDivide(left,right,operation);return{result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,operation),};};// Pass in the additional argument for validation to the higher-order functions.constValue=makeValue(validateValue,printValue);constAdd=makeAdd(validateExpression,printExpression);constSubtract=makeSubtract(validateExpression,printExpression);constMultiply=makeMultiply(validateExpression,printExpression);constDivide=makeDivide(validateDivide,printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

Testing

See test.js for the test cases.

Running

Main:

node index.js

Tests:

node test.js

About

An abstract syntax tree implementation using SOLID design principles

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Highlight search terms from Google/DuckDuckGo/Bing referrer (function() { var ref = document.referrer; var terms = []; if (ref.includes('google.com') || ref.includes('duckduckgo.com') || ref.includes('bing.com')) { var url = new URL(ref); var q = url.searchParams.get('q') || url.searchParams.get('p'); if (q) { terms = q.split(/\s+/).filter(function(t) { return t.length > 2; }); } } if (terms.length === 0) return; var style = document.createElement('style'); style.textContent = '.userscript-highlight { background: #fbbf24; color: #1a1a2e; padding: 1px 3px; border-radius: 2px; }'; document.head.appendChild(style); function highlight(node) { if (node.nodeType === 3) { // text node var text = node.textContent; var found = false; terms.forEach(function(term) { var regex = new RegExp('(' + term.replace(/[.*+?^${}()|[\]\\]/g, '\\') + ')', 'gi'); if (regex.test(text)) { found = true; var frag = document.createDocumentFragment(); var parts = text.split(regex); parts.forEach(function(part, i) { if (i % 2 === 0) { frag.appendChild(document.createTextNode(part)); } else { var span = document.createElement('span'); span.className = 'userscript-highlight'; span.textContent = part; frag.appendChild(span); } }); node.parentNode.replaceChild(frag, node); } }); } else if (node.nodeType === 1 && node.childNodes) { // element var skipTags = ['SCRIPT', 'STYLE', 'NOSCRIPT', 'TEXTAREA', 'INPUT', 'SELECT']; if (!skipTags.includes(node.tagName)) { Array.from(node.childNodes).forEach(highlight); } } } highlight(document.body); // Re-highlight on dynamic content var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1 || node.nodeType === 3) highlight(node); }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Highlight Search Terms]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - druvisc/solid-abstract-syntax-tree: An abstract syntax tree implementation using SOLID design principles · GitHub
Skip to content

Latest commit

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Refactoring an expression tree

Refactor and improve tree.js to use the SOLID principles.

Implementation

1. Interface Segregation Principle

The current Node API breaks the SOLID interface segregation principle:

constNode=(operator,value,left,right)=>{..};

It forces to pass an empty string for the operator parameter and null for the left and right nodes for the leaf (value) nodes and null for the value parameter for internal (operation) nodes:

constvalueNode1=Node("",4,null,null);constvalueNode2=Node("",2,null,null);constdivisionNode=Node("÷",null,valueNode1,valueNode2);

We can see that the each type of node accepts completely opposite parameters so their interfaces have to be segregated to make them smaller and more reasonable.

With the interfaces segregated, we no longer have to pass redundant properties to each type of node:

constvalueNode1=Value(4);constvalueNode2=Value(2);constdivisionNode=Divide(valueNode1,valueNode2);

2. Open/Closed Principle

Both the switch statement in the result method

switch(operator){case"+":
returnleft.result()+right.result();case"-":
returnleft.result()-right.result();case"x":
returnleft.result() \*right.result();case"÷":
returnleft.result()/right.result();default:
returnvalue;}

and the switch statement in the toString method

switch(operator){case"+":
return`(${left.toString()} + ${right.toString()})`;case"-":
return`(${left.toString()} - ${right.toString()})`;case"x":
return`(${left.toString()} x ${right.toString()})`;case"÷":
return`(${left.toString()} ÷ ${right.toString()})`;default:
returnvalue.toString();}

violate the SOLID open/closed principle.

To add a new expression (outside of the Node class), we have to modify the existing code (inside the Node class) - so it's not "closed off" and easily extendable. This also causes code to be harder to read, maintain and be more error-prone.

Instead of having these switch statements based on type (operator), they can be broken off in small, individual classes. To enforce class compatibility and for polymorphism to work, an interface containing both result and toString methods has to be implemented:

interfaceIResultable{result: ()=>number;}interfaceIPrintable{toString: ()=>string;}

New node classes "implementing" both interfaces:

constValue=(value)=>({
value,result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({
left,
right,result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({
left,
right,result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({
left,
right,result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({
left,
right,result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

3. Encapsulation

The initial Node API implementation is missing any kind of encapsulation, exposing implementation details as every property and method is available:

return{
operator,
value,
left,
right,
result,
toString,};

The previously implemented interfaces indicate which methods need to be exposed for a consistent API, hiding the implementation details with the help of a closure:

constValue=(value)=>({result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});

4. Single Responsibility Principle

Both the initial Node implementation and the one above violate the single responsibility principle of SOLID. The classes handle both the calculation logic (result) and the printing logic (toString). To avoid having to make changes to the classes when the printing logic changes, the printing logic should be factored out to a seperate module:

constprintValue=(value)=>`${value}`;constprintExpression=(left,right,operation)=>`(${left.toString()}${operation}${right.toString()})`;module.exports={
printValue,
printExpression,};

Importing and using the printing module means that if the printing logic changes, no changes to the classes will be required.

const{ printValue, printExpression }=require("./print");constValue=(value)=>({result: ()=>value,toString: ()=>printValue(value),});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>printExpression(left,right,"+"),});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>printExpression(left,right,"-"),});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>printExpression(left,right,"*"),});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>printExpression(left,right,"÷"),});

5. Dependency Injection

Although the responsibility of calculation is now separated from printing with the help of the printing module, the two responsibilities are still coupled together as changing the printing method altogether will still cause changes to the class.

To avoid this, we can make the dependency easily switchable with a higher-order function:

// Import or define new printing functions.constmakeValue=(toString)=>(value)=>({result: ()=>value,toString: ()=>toString(value),});constmakeAdd=(toString)=>(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,"+"),});constmakeSubtract=(toString)=>(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,"-"),});constmakeMultiply=(toString)=>(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,"x"),});constmakeDivide=(toString)=>(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,"÷"),});// Pass the printing functions to the higher-order functions to create the classes.constValue=makeValue(printValue);constAdd=makeAdd(printExpression);constSubtract=makeSubtract(printExpression);constMultiply=makeMultiply(printExpression);constDivide=makeDivide(printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

6. Input validation

Following point 4 and point 5, for input validaiton we can create a separate validation module:

const{ number }=require("../utils");constvalidateValue=(value)=>{if(!number.isNumber(value)){thrownewError(`The value "${value}" is not a numerical value!`);}};constvalidateExpression=(left,right,operation)=>{if(!left?.result||!right?.result){thrownewError(`The operation "${operation}" is missing an operand!`);}};constvalidateDivide=(left,right,operation)=>{validateExpression(left,right,operation);if(right.result()===0){thrownewError(`The right-hand side operand "${right.toString()}" for Divide must be non-zero!`);}};module.exports={
validateValue,
validateExpression,
validateDivide,};

Which then gets imported and injected through the same higher-order functions:

const{
validateValue,
validateExpressio,
validateDivide,}=require("./validation");constmakeValue=(validateValue,toString)=>(value)=>{validateValue(value);return{result: ()=>value,toString: ()=>toString(value),};};constmakeAdd=(validateExpression,toString)=>(left,right)=>{constoperation="+";validateExpression(left,right,operation);return{result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,operation),};};constmakeSubtract=(validateExpression,toString)=>(left,right)=>{constoperation="-";validateExpression(left,right,operation);return{result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,operation),};};constmakeMultiply=(validateExpression,toString)=>(left,right)=>{constoperation="x";validateExpression(left,right,operation);return{result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,operation),};};constmakeDivide=(validateDivide,toString)=>(left,right)=>{constoperation="÷";validateDivide(left,right,operation);return{result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,operation),};};// Pass in the additional argument for validation to the higher-order functions.constValue=makeValue(validateValue,printValue);constAdd=makeAdd(validateExpression,printExpression);constSubtract=makeSubtract(validateExpression,printExpression);constMultiply=makeMultiply(validateExpression,printExpression);constDivide=makeDivide(validateDivide,printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

Testing

See test.js for the test cases.

Running

Main:

node index.js

Tests:

node test.js

About

An abstract syntax tree implementation using SOLID design principles

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Strip utm_, fbclid, gclid, etc. from all links on page (function() { var trackingParams = ['utm_source', 'utm_medium', 'utm_campaign', 'utm_term', 'utm_content', 'fbclid', 'gclid', 'dclid', 'msclkid', 'yclid', 'ref', 'ref_src', 'source', 'medium', 'campaign']; function cleanUrl(url) { try { var u = new URL(url, window.location.origin); var changed = false; trackingParams.forEach(function(p) { if (u.searchParams.has(p)) { u.searchParams.delete(p); changed = true; } }); return changed ? u.toString() : url; } catch (e) { return url; } } function cleanLinks() { document.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } cleanLinks(); var observer = new MutationObserver(function(mutations) { mutations.forEach(function(m) { m.addedNodes.forEach(function(node) { if (node.nodeType === 1) { if (node.tagName === 'A') cleanLinks(); node.querySelectorAll('a[href]').forEach(function(a) { var clean = cleanUrl(a.href); if (clean !== a.href) a.href = clean; }); } }); }); }); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:Remove Tracking Parameters from Links]', __e); } })(); (function(){ try { var __m = "youtube.com"; var __re = new RegExp('^' + "youtube\\.com" + ' GitHub - druvisc/solid-abstract-syntax-tree: An abstract syntax tree implementation using SOLID design principles · GitHub
Skip to content

Latest commit

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Refactoring an expression tree

Refactor and improve tree.js to use the SOLID principles.

Implementation

1. Interface Segregation Principle

The current Node API breaks the SOLID interface segregation principle:

constNode=(operator,value,left,right)=>{..};

It forces to pass an empty string for the operator parameter and null for the left and right nodes for the leaf (value) nodes and null for the value parameter for internal (operation) nodes:

constvalueNode1=Node("",4,null,null);constvalueNode2=Node("",2,null,null);constdivisionNode=Node("÷",null,valueNode1,valueNode2);

We can see that the each type of node accepts completely opposite parameters so their interfaces have to be segregated to make them smaller and more reasonable.

With the interfaces segregated, we no longer have to pass redundant properties to each type of node:

constvalueNode1=Value(4);constvalueNode2=Value(2);constdivisionNode=Divide(valueNode1,valueNode2);

2. Open/Closed Principle

Both the switch statement in the result method

switch(operator){case"+":
returnleft.result()+right.result();case"-":
returnleft.result()-right.result();case"x":
returnleft.result() \*right.result();case"÷":
returnleft.result()/right.result();default:
returnvalue;}

and the switch statement in the toString method

switch(operator){case"+":
return`(${left.toString()} + ${right.toString()})`;case"-":
return`(${left.toString()} - ${right.toString()})`;case"x":
return`(${left.toString()} x ${right.toString()})`;case"÷":
return`(${left.toString()} ÷ ${right.toString()})`;default:
returnvalue.toString();}

violate the SOLID open/closed principle.

To add a new expression (outside of the Node class), we have to modify the existing code (inside the Node class) - so it's not "closed off" and easily extendable. This also causes code to be harder to read, maintain and be more error-prone.

Instead of having these switch statements based on type (operator), they can be broken off in small, individual classes. To enforce class compatibility and for polymorphism to work, an interface containing both result and toString methods has to be implemented:

interfaceIResultable{result: ()=>number;}interfaceIPrintable{toString: ()=>string;}

New node classes "implementing" both interfaces:

constValue=(value)=>({
value,result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({
left,
right,result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({
left,
right,result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({
left,
right,result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({
left,
right,result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

3. Encapsulation

The initial Node API implementation is missing any kind of encapsulation, exposing implementation details as every property and method is available:

return{
operator,
value,
left,
right,
result,
toString,};

The previously implemented interfaces indicate which methods need to be exposed for a consistent API, hiding the implementation details with the help of a closure:

constValue=(value)=>({result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});

4. Single Responsibility Principle

Both the initial Node implementation and the one above violate the single responsibility principle of SOLID. The classes handle both the calculation logic (result) and the printing logic (toString). To avoid having to make changes to the classes when the printing logic changes, the printing logic should be factored out to a seperate module:

constprintValue=(value)=>`${value}`;constprintExpression=(left,right,operation)=>`(${left.toString()}${operation}${right.toString()})`;module.exports={
printValue,
printExpression,};

Importing and using the printing module means that if the printing logic changes, no changes to the classes will be required.

const{ printValue, printExpression }=require("./print");constValue=(value)=>({result: ()=>value,toString: ()=>printValue(value),});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>printExpression(left,right,"+"),});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>printExpression(left,right,"-"),});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>printExpression(left,right,"*"),});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>printExpression(left,right,"÷"),});

5. Dependency Injection

Although the responsibility of calculation is now separated from printing with the help of the printing module, the two responsibilities are still coupled together as changing the printing method altogether will still cause changes to the class.

To avoid this, we can make the dependency easily switchable with a higher-order function:

// Import or define new printing functions.constmakeValue=(toString)=>(value)=>({result: ()=>value,toString: ()=>toString(value),});constmakeAdd=(toString)=>(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,"+"),});constmakeSubtract=(toString)=>(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,"-"),});constmakeMultiply=(toString)=>(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,"x"),});constmakeDivide=(toString)=>(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,"÷"),});// Pass the printing functions to the higher-order functions to create the classes.constValue=makeValue(printValue);constAdd=makeAdd(printExpression);constSubtract=makeSubtract(printExpression);constMultiply=makeMultiply(printExpression);constDivide=makeDivide(printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

6. Input validation

Following point 4 and point 5, for input validaiton we can create a separate validation module:

const{ number }=require("../utils");constvalidateValue=(value)=>{if(!number.isNumber(value)){thrownewError(`The value "${value}" is not a numerical value!`);}};constvalidateExpression=(left,right,operation)=>{if(!left?.result||!right?.result){thrownewError(`The operation "${operation}" is missing an operand!`);}};constvalidateDivide=(left,right,operation)=>{validateExpression(left,right,operation);if(right.result()===0){thrownewError(`The right-hand side operand "${right.toString()}" for Divide must be non-zero!`);}};module.exports={
validateValue,
validateExpression,
validateDivide,};

Which then gets imported and injected through the same higher-order functions:

const{
validateValue,
validateExpressio,
validateDivide,}=require("./validation");constmakeValue=(validateValue,toString)=>(value)=>{validateValue(value);return{result: ()=>value,toString: ()=>toString(value),};};constmakeAdd=(validateExpression,toString)=>(left,right)=>{constoperation="+";validateExpression(left,right,operation);return{result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,operation),};};constmakeSubtract=(validateExpression,toString)=>(left,right)=>{constoperation="-";validateExpression(left,right,operation);return{result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,operation),};};constmakeMultiply=(validateExpression,toString)=>(left,right)=>{constoperation="x";validateExpression(left,right,operation);return{result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,operation),};};constmakeDivide=(validateDivide,toString)=>(left,right)=>{constoperation="÷";validateDivide(left,right,operation);return{result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,operation),};};// Pass in the additional argument for validation to the higher-order functions.constValue=makeValue(validateValue,printValue);constAdd=makeAdd(validateExpression,printExpression);constSubtract=makeSubtract(validateExpression,printExpression);constMultiply=makeMultiply(validateExpression,printExpression);constDivide=makeDivide(validateDivide,printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

Testing

See test.js for the test cases.

Running

Main:

node index.js

Tests:

node test.js

About

An abstract syntax tree implementation using SOLID design principles

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Auto-enable theater mode on YouTube (function() { function tryTheater() { var btn = document.querySelector('button[aria-label="Theater mode"], ytd-player #player button[title="Theater mode"]'); if (btn && !btn.classList.contains('activated')) { btn.click(); } } // Try immediately tryTheater(); // Try after navigation (SPA) var lastUrl = location.href; setInterval(function() { if (location.href !== lastUrl) { lastUrl = location.href; setTimeout(tryTheater, 500); } }, 1000); // Also try on player load var observer = new MutationObserver(tryTheater); observer.observe(document.body, { childList: true, subtree: true }); })(); } } catch(__e) { console.warn('[Userscript:YouTube Theater Mode Default]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - druvisc/solid-abstract-syntax-tree: An abstract syntax tree implementation using SOLID design principles · GitHub
Skip to content

Latest commit

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Refactoring an expression tree

Refactor and improve tree.js to use the SOLID principles.

Implementation

1. Interface Segregation Principle

The current Node API breaks the SOLID interface segregation principle:

constNode=(operator,value,left,right)=>{..};

It forces to pass an empty string for the operator parameter and null for the left and right nodes for the leaf (value) nodes and null for the value parameter for internal (operation) nodes:

constvalueNode1=Node("",4,null,null);constvalueNode2=Node("",2,null,null);constdivisionNode=Node("÷",null,valueNode1,valueNode2);

We can see that the each type of node accepts completely opposite parameters so their interfaces have to be segregated to make them smaller and more reasonable.

With the interfaces segregated, we no longer have to pass redundant properties to each type of node:

constvalueNode1=Value(4);constvalueNode2=Value(2);constdivisionNode=Divide(valueNode1,valueNode2);

2. Open/Closed Principle

Both the switch statement in the result method

switch(operator){case"+":
returnleft.result()+right.result();case"-":
returnleft.result()-right.result();case"x":
returnleft.result() \*right.result();case"÷":
returnleft.result()/right.result();default:
returnvalue;}

and the switch statement in the toString method

switch(operator){case"+":
return`(${left.toString()} + ${right.toString()})`;case"-":
return`(${left.toString()} - ${right.toString()})`;case"x":
return`(${left.toString()} x ${right.toString()})`;case"÷":
return`(${left.toString()} ÷ ${right.toString()})`;default:
returnvalue.toString();}

violate the SOLID open/closed principle.

To add a new expression (outside of the Node class), we have to modify the existing code (inside the Node class) - so it's not "closed off" and easily extendable. This also causes code to be harder to read, maintain and be more error-prone.

Instead of having these switch statements based on type (operator), they can be broken off in small, individual classes. To enforce class compatibility and for polymorphism to work, an interface containing both result and toString methods has to be implemented:

interfaceIResultable{result: ()=>number;}interfaceIPrintable{toString: ()=>string;}

New node classes "implementing" both interfaces:

constValue=(value)=>({
value,result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({
left,
right,result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({
left,
right,result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({
left,
right,result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({
left,
right,result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

3. Encapsulation

The initial Node API implementation is missing any kind of encapsulation, exposing implementation details as every property and method is available:

return{
operator,
value,
left,
right,
result,
toString,};

The previously implemented interfaces indicate which methods need to be exposed for a consistent API, hiding the implementation details with the help of a closure:

constValue=(value)=>({result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});

4. Single Responsibility Principle

Both the initial Node implementation and the one above violate the single responsibility principle of SOLID. The classes handle both the calculation logic (result) and the printing logic (toString). To avoid having to make changes to the classes when the printing logic changes, the printing logic should be factored out to a seperate module:

constprintValue=(value)=>`${value}`;constprintExpression=(left,right,operation)=>`(${left.toString()}${operation}${right.toString()})`;module.exports={
printValue,
printExpression,};

Importing and using the printing module means that if the printing logic changes, no changes to the classes will be required.

const{ printValue, printExpression }=require("./print");constValue=(value)=>({result: ()=>value,toString: ()=>printValue(value),});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>printExpression(left,right,"+"),});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>printExpression(left,right,"-"),});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>printExpression(left,right,"*"),});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>printExpression(left,right,"÷"),});

5. Dependency Injection

Although the responsibility of calculation is now separated from printing with the help of the printing module, the two responsibilities are still coupled together as changing the printing method altogether will still cause changes to the class.

To avoid this, we can make the dependency easily switchable with a higher-order function:

// Import or define new printing functions.constmakeValue=(toString)=>(value)=>({result: ()=>value,toString: ()=>toString(value),});constmakeAdd=(toString)=>(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,"+"),});constmakeSubtract=(toString)=>(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,"-"),});constmakeMultiply=(toString)=>(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,"x"),});constmakeDivide=(toString)=>(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,"÷"),});// Pass the printing functions to the higher-order functions to create the classes.constValue=makeValue(printValue);constAdd=makeAdd(printExpression);constSubtract=makeSubtract(printExpression);constMultiply=makeMultiply(printExpression);constDivide=makeDivide(printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

6. Input validation

Following point 4 and point 5, for input validaiton we can create a separate validation module:

const{ number }=require("../utils");constvalidateValue=(value)=>{if(!number.isNumber(value)){thrownewError(`The value "${value}" is not a numerical value!`);}};constvalidateExpression=(left,right,operation)=>{if(!left?.result||!right?.result){thrownewError(`The operation "${operation}" is missing an operand!`);}};constvalidateDivide=(left,right,operation)=>{validateExpression(left,right,operation);if(right.result()===0){thrownewError(`The right-hand side operand "${right.toString()}" for Divide must be non-zero!`);}};module.exports={
validateValue,
validateExpression,
validateDivide,};

Which then gets imported and injected through the same higher-order functions:

const{
validateValue,
validateExpressio,
validateDivide,}=require("./validation");constmakeValue=(validateValue,toString)=>(value)=>{validateValue(value);return{result: ()=>value,toString: ()=>toString(value),};};constmakeAdd=(validateExpression,toString)=>(left,right)=>{constoperation="+";validateExpression(left,right,operation);return{result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,operation),};};constmakeSubtract=(validateExpression,toString)=>(left,right)=>{constoperation="-";validateExpression(left,right,operation);return{result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,operation),};};constmakeMultiply=(validateExpression,toString)=>(left,right)=>{constoperation="x";validateExpression(left,right,operation);return{result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,operation),};};constmakeDivide=(validateDivide,toString)=>(left,right)=>{constoperation="÷";validateDivide(left,right,operation);return{result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,operation),};};// Pass in the additional argument for validation to the higher-order functions.constValue=makeValue(validateValue,printValue);constAdd=makeAdd(validateExpression,printExpression);constSubtract=makeSubtract(validateExpression,printExpression);constMultiply=makeMultiply(validateExpression,printExpression);constDivide=makeDivide(validateDivide,printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

Testing

See test.js for the test cases.

Running

Main:

node index.js

Tests:

node test.js

About

An abstract syntax tree implementation using SOLID design principles

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Remove or un-stick sticky/fixed headers that block content (function() { function unstick() { document.querySelectorAll('header, nav, [role="banner"], .header, .navbar, .sticky, .fixed-top, [style*="position: fixed"], [style*="position:sticky"]').forEach(function(el) { if (el.style.position === 'fixed' || el.style.position === 'sticky' || getComputedStyle(el).position === 'fixed' || getComputedStyle(el).position === 'sticky') { el.style.position = 'static'; el.style.top = 'auto'; el.style.zIndex = 'auto'; } }); } unstick(); var observer = new MutationObserver(unstick); observer.observe(document.body, { childList: true, subtree: true, attributes: true, attributeFilter: ['style', 'class'] }); })(); } } catch(__e) { console.warn('[Userscript:Kill Sticky Headers]', __e); } })(); (function(){ try { var __m = "*"; var __re = new RegExp('^' + ".*" + ' GitHub - druvisc/solid-abstract-syntax-tree: An abstract syntax tree implementation using SOLID design principles · GitHub
Skip to content

Latest commit

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Refactoring an expression tree

Refactor and improve tree.js to use the SOLID principles.

Implementation

1. Interface Segregation Principle

The current Node API breaks the SOLID interface segregation principle:

constNode=(operator,value,left,right)=>{..};

It forces to pass an empty string for the operator parameter and null for the left and right nodes for the leaf (value) nodes and null for the value parameter for internal (operation) nodes:

constvalueNode1=Node("",4,null,null);constvalueNode2=Node("",2,null,null);constdivisionNode=Node("÷",null,valueNode1,valueNode2);

We can see that the each type of node accepts completely opposite parameters so their interfaces have to be segregated to make them smaller and more reasonable.

With the interfaces segregated, we no longer have to pass redundant properties to each type of node:

constvalueNode1=Value(4);constvalueNode2=Value(2);constdivisionNode=Divide(valueNode1,valueNode2);

2. Open/Closed Principle

Both the switch statement in the result method

switch(operator){case"+":
returnleft.result()+right.result();case"-":
returnleft.result()-right.result();case"x":
returnleft.result() \*right.result();case"÷":
returnleft.result()/right.result();default:
returnvalue;}

and the switch statement in the toString method

switch(operator){case"+":
return`(${left.toString()} + ${right.toString()})`;case"-":
return`(${left.toString()} - ${right.toString()})`;case"x":
return`(${left.toString()} x ${right.toString()})`;case"÷":
return`(${left.toString()} ÷ ${right.toString()})`;default:
returnvalue.toString();}

violate the SOLID open/closed principle.

To add a new expression (outside of the Node class), we have to modify the existing code (inside the Node class) - so it's not "closed off" and easily extendable. This also causes code to be harder to read, maintain and be more error-prone.

Instead of having these switch statements based on type (operator), they can be broken off in small, individual classes. To enforce class compatibility and for polymorphism to work, an interface containing both result and toString methods has to be implemented:

interfaceIResultable{result: ()=>number;}interfaceIPrintable{toString: ()=>string;}

New node classes "implementing" both interfaces:

constValue=(value)=>({
value,result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({
left,
right,result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({
left,
right,result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({
left,
right,result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({
left,
right,result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

3. Encapsulation

The initial Node API implementation is missing any kind of encapsulation, exposing implementation details as every property and method is available:

return{
operator,
value,
left,
right,
result,
toString,};

The previously implemented interfaces indicate which methods need to be exposed for a consistent API, hiding the implementation details with the help of a closure:

constValue=(value)=>({result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});

4. Single Responsibility Principle

Both the initial Node implementation and the one above violate the single responsibility principle of SOLID. The classes handle both the calculation logic (result) and the printing logic (toString). To avoid having to make changes to the classes when the printing logic changes, the printing logic should be factored out to a seperate module:

constprintValue=(value)=>`${value}`;constprintExpression=(left,right,operation)=>`(${left.toString()}${operation}${right.toString()})`;module.exports={
printValue,
printExpression,};

Importing and using the printing module means that if the printing logic changes, no changes to the classes will be required.

const{ printValue, printExpression }=require("./print");constValue=(value)=>({result: ()=>value,toString: ()=>printValue(value),});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>printExpression(left,right,"+"),});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>printExpression(left,right,"-"),});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>printExpression(left,right,"*"),});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>printExpression(left,right,"÷"),});

5. Dependency Injection

Although the responsibility of calculation is now separated from printing with the help of the printing module, the two responsibilities are still coupled together as changing the printing method altogether will still cause changes to the class.

To avoid this, we can make the dependency easily switchable with a higher-order function:

// Import or define new printing functions.constmakeValue=(toString)=>(value)=>({result: ()=>value,toString: ()=>toString(value),});constmakeAdd=(toString)=>(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,"+"),});constmakeSubtract=(toString)=>(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,"-"),});constmakeMultiply=(toString)=>(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,"x"),});constmakeDivide=(toString)=>(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,"÷"),});// Pass the printing functions to the higher-order functions to create the classes.constValue=makeValue(printValue);constAdd=makeAdd(printExpression);constSubtract=makeSubtract(printExpression);constMultiply=makeMultiply(printExpression);constDivide=makeDivide(printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

6. Input validation

Following point 4 and point 5, for input validaiton we can create a separate validation module:

const{ number }=require("../utils");constvalidateValue=(value)=>{if(!number.isNumber(value)){thrownewError(`The value "${value}" is not a numerical value!`);}};constvalidateExpression=(left,right,operation)=>{if(!left?.result||!right?.result){thrownewError(`The operation "${operation}" is missing an operand!`);}};constvalidateDivide=(left,right,operation)=>{validateExpression(left,right,operation);if(right.result()===0){thrownewError(`The right-hand side operand "${right.toString()}" for Divide must be non-zero!`);}};module.exports={
validateValue,
validateExpression,
validateDivide,};

Which then gets imported and injected through the same higher-order functions:

const{
validateValue,
validateExpressio,
validateDivide,}=require("./validation");constmakeValue=(validateValue,toString)=>(value)=>{validateValue(value);return{result: ()=>value,toString: ()=>toString(value),};};constmakeAdd=(validateExpression,toString)=>(left,right)=>{constoperation="+";validateExpression(left,right,operation);return{result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,operation),};};constmakeSubtract=(validateExpression,toString)=>(left,right)=>{constoperation="-";validateExpression(left,right,operation);return{result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,operation),};};constmakeMultiply=(validateExpression,toString)=>(left,right)=>{constoperation="x";validateExpression(left,right,operation);return{result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,operation),};};constmakeDivide=(validateDivide,toString)=>(left,right)=>{constoperation="÷";validateDivide(left,right,operation);return{result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,operation),};};// Pass in the additional argument for validation to the higher-order functions.constValue=makeValue(validateValue,printValue);constAdd=makeAdd(validateExpression,printExpression);constSubtract=makeSubtract(validateExpression,printExpression);constMultiply=makeMultiply(validateExpression,printExpression);constDivide=makeDivide(validateDivide,printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

Testing

See test.js for the test cases.

Running

Main:

node index.js

Tests:

node test.js

About

An abstract syntax tree implementation using SOLID design principles

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages

, 'i'); if (__m === '*' || __re.test(location.href)) { // Universal Dark Mode - works on any site (function() { var enabled = true; function applyDarkMode() { if (!enabled) return; // Create style element if it doesn't exist var style = document.getElementById('universal-dark-mode-style'); if (!style) { style = document.createElement('style'); style.id = 'universal-dark-mode-style'; document.head.appendChild(style); } // Dark mode CSS - inverts colors but preserves images/video style.textContent = ' /* Invert everything except media */ html { filter: invert(1) hue-rotate(180deg) !important; background: #1a1a2e !important; } /* Restore images, videos, iframes, canvas */ img, video, iframe, canvas, svg, picture, [style*="background-image"] { filter: invert(1) hue-rotate(180deg) !important; } /* Preserve specific elements that should not be inverted */ .no-dark-mode, .no-dark-mode *, [data-theme="light"], [data-theme="light"], .ace_editor, .ace_editor *, .CodeMirror, .CodeMirror *, .monaco-editor, .monaco-editor *, .markdown-body pre, .markdown-body pre *, .highlight, .highlight *, pre code, pre code * { filter: none !important; } /* Fix common UI elements */ .modal, .popup, .dropdown-menu, .tooltip, .popover { filter: invert(1) hue-rotate(180deg) !important; background: #2d2d44 !important; border-color: #444 !important; } /* Scrollbars */ ::-webkit-scrollbar { background: #1a1a2e !important; } ::-webkit-scrollbar-thumb { background: #444 !important; } ::-webkit-scrollbar-thumb:hover { background: #555 !important; } /* Selection */ ::selection { background: #4ecdc4 !important; color: #1a1a2e !important; } ::-moz-selection { background: #4ecdc4 !important; color: #1a1a2e !important; } '; } function removeDarkMode() { var style = document.getElementById('universal-dark-mode-style'); if (style) style.remove(); } // Toggle with Alt+Shift+D document.addEventListener('keydown', function(e) { if (e.altKey && e.shiftKey && e.key === 'D') { e.preventDefault(); enabled = !enabled; if (enabled) { applyDarkMode(); console.log('[Universal Dark Mode] Enabled'); } else { removeDarkMode(); console.log('[Universal Dark Mode] Disabled'); } } }); // Apply on load applyDarkMode(); // Re-apply on dynamic content var observer = new MutationObserver(function(mutations) { if (enabled && !document.getElementById('universal-dark-mode-style')) { applyDarkMode(); } }); observer.observe(document.head, { childList: true }); console.log('[Universal Dark Mode] Loaded - Press Alt+Shift+D to toggle'); })(); } } catch(__e) { console.warn('[Userscript:Universal Dark Mode]', __e); } })(); })(); GitHub - druvisc/solid-abstract-syntax-tree: An abstract syntax tree implementation using SOLID design principles · GitHub
Skip to content

Latest commit

History

2 Commits

Folders and files

NameName
Last commit message
Last commit date

Repository files navigation

Refactoring an expression tree

Refactor and improve tree.js to use the SOLID principles.

Implementation

1. Interface Segregation Principle

The current Node API breaks the SOLID interface segregation principle:

constNode=(operator,value,left,right)=>{..};

It forces to pass an empty string for the operator parameter and null for the left and right nodes for the leaf (value) nodes and null for the value parameter for internal (operation) nodes:

constvalueNode1=Node("",4,null,null);constvalueNode2=Node("",2,null,null);constdivisionNode=Node("÷",null,valueNode1,valueNode2);

We can see that the each type of node accepts completely opposite parameters so their interfaces have to be segregated to make them smaller and more reasonable.

With the interfaces segregated, we no longer have to pass redundant properties to each type of node:

constvalueNode1=Value(4);constvalueNode2=Value(2);constdivisionNode=Divide(valueNode1,valueNode2);

2. Open/Closed Principle

Both the switch statement in the result method

switch(operator){case"+":
returnleft.result()+right.result();case"-":
returnleft.result()-right.result();case"x":
returnleft.result() \*right.result();case"÷":
returnleft.result()/right.result();default:
returnvalue;}

and the switch statement in the toString method

switch(operator){case"+":
return`(${left.toString()} + ${right.toString()})`;case"-":
return`(${left.toString()} - ${right.toString()})`;case"x":
return`(${left.toString()} x ${right.toString()})`;case"÷":
return`(${left.toString()} ÷ ${right.toString()})`;default:
returnvalue.toString();}

violate the SOLID open/closed principle.

To add a new expression (outside of the Node class), we have to modify the existing code (inside the Node class) - so it's not "closed off" and easily extendable. This also causes code to be harder to read, maintain and be more error-prone.

Instead of having these switch statements based on type (operator), they can be broken off in small, individual classes. To enforce class compatibility and for polymorphism to work, an interface containing both result and toString methods has to be implemented:

interfaceIResultable{result: ()=>number;}interfaceIPrintable{toString: ()=>string;}

New node classes "implementing" both interfaces:

constValue=(value)=>({
value,result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({
left,
right,result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({
left,
right,result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({
left,
right,result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({
left,
right,result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

3. Encapsulation

The initial Node API implementation is missing any kind of encapsulation, exposing implementation details as every property and method is available:

return{
operator,
value,
left,
right,
result,
toString,};

The previously implemented interfaces indicate which methods need to be exposed for a consistent API, hiding the implementation details with the help of a closure:

constValue=(value)=>({result: ()=>value,toString: ()=>`${value}`,});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>`(${left.toString()} + ${right.toString()})`,});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>`(${left.toString()} - ${right.toString()})`,});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>`(${left.toString()} * ${right.toString()})`,});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>`(${left.toString()} ÷ ${right.toString()})`,});

4. Single Responsibility Principle

Both the initial Node implementation and the one above violate the single responsibility principle of SOLID. The classes handle both the calculation logic (result) and the printing logic (toString). To avoid having to make changes to the classes when the printing logic changes, the printing logic should be factored out to a seperate module:

constprintValue=(value)=>`${value}`;constprintExpression=(left,right,operation)=>`(${left.toString()}${operation}${right.toString()})`;module.exports={
printValue,
printExpression,};

Importing and using the printing module means that if the printing logic changes, no changes to the classes will be required.

const{ printValue, printExpression }=require("./print");constValue=(value)=>({result: ()=>value,toString: ()=>printValue(value),});constAdd=(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>printExpression(left,right,"+"),});constSubtract=(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>printExpression(left,right,"-"),});constMultiply=(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>printExpression(left,right,"*"),});constDivide=(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>printExpression(left,right,"÷"),});

5. Dependency Injection

Although the responsibility of calculation is now separated from printing with the help of the printing module, the two responsibilities are still coupled together as changing the printing method altogether will still cause changes to the class.

To avoid this, we can make the dependency easily switchable with a higher-order function:

// Import or define new printing functions.constmakeValue=(toString)=>(value)=>({result: ()=>value,toString: ()=>toString(value),});constmakeAdd=(toString)=>(left,right)=>({result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,"+"),});constmakeSubtract=(toString)=>(left,right)=>({result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,"-"),});constmakeMultiply=(toString)=>(left,right)=>({result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,"x"),});constmakeDivide=(toString)=>(left,right)=>({result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,"÷"),});// Pass the printing functions to the higher-order functions to create the classes.constValue=makeValue(printValue);constAdd=makeAdd(printExpression);constSubtract=makeSubtract(printExpression);constMultiply=makeMultiply(printExpression);constDivide=makeDivide(printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

6. Input validation

Following point 4 and point 5, for input validaiton we can create a separate validation module:

const{ number }=require("../utils");constvalidateValue=(value)=>{if(!number.isNumber(value)){thrownewError(`The value "${value}" is not a numerical value!`);}};constvalidateExpression=(left,right,operation)=>{if(!left?.result||!right?.result){thrownewError(`The operation "${operation}" is missing an operand!`);}};constvalidateDivide=(left,right,operation)=>{validateExpression(left,right,operation);if(right.result()===0){thrownewError(`The right-hand side operand "${right.toString()}" for Divide must be non-zero!`);}};module.exports={
validateValue,
validateExpression,
validateDivide,};

Which then gets imported and injected through the same higher-order functions:

const{
validateValue,
validateExpressio,
validateDivide,}=require("./validation");constmakeValue=(validateValue,toString)=>(value)=>{validateValue(value);return{result: ()=>value,toString: ()=>toString(value),};};constmakeAdd=(validateExpression,toString)=>(left,right)=>{constoperation="+";validateExpression(left,right,operation);return{result: ()=>left.result()+right.result(),toString: ()=>toString(left,right,operation),};};constmakeSubtract=(validateExpression,toString)=>(left,right)=>{constoperation="-";validateExpression(left,right,operation);return{result: ()=>left.result()-right.result(),toString: ()=>toString(left,right,operation),};};constmakeMultiply=(validateExpression,toString)=>(left,right)=>{constoperation="x";validateExpression(left,right,operation);return{result: ()=>left.result()*right.result(),toString: ()=>toString(left,right,operation),};};constmakeDivide=(validateDivide,toString)=>(left,right)=>{constoperation="÷";validateDivide(left,right,operation);return{result: ()=>left.result()/right.result(),toString: ()=>toString(left,right,operation),};};// Pass in the additional argument for validation to the higher-order functions.constValue=makeValue(validateValue,printValue);constAdd=makeAdd(validateExpression,printExpression);constSubtract=makeSubtract(validateExpression,printExpression);constMultiply=makeMultiply(validateExpression,printExpression);constDivide=makeDivide(validateDivide,printExpression);// The API hasn't changed.consttree=Divide(Add(Value(7),Multiply(Subtract(Value(3),Value(2)),Value(5))),Value(6));

Testing

See test.js for the test cases.

Running

Main:

node index.js

Tests:

node test.js

About

An abstract syntax tree implementation using SOLID design principles

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages