Created
September 23, 2011 19:54
-
-
Save DmitrySoshnikov/1238301 to your computer and use it in GitHub Desktop.
Simple postfix notation math evaluator
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
/** | |
* Postfix notation math evaluator | |
* See: http://en.wikipedia.org/wiki/Reverse_Polish_notation | |
* | |
* See also prefix notation example: | |
* https://github.com/DmitrySoshnikov/Essentials-of-interpretation/blob/master/src/notes/note-1.js | |
* | |
* by Dmitry Soshnikov <[email protected]> | |
* MIT Style License | |
*/ | |
/** | |
* postfixEval | |
* @param {String} string | |
* | |
* Evaluates a simple math expression | |
* in the postfix notation. | |
* | |
* Example: | |
* 2 3 + => 5 | |
* 2 3 + 5 * => 25 | |
*/ | |
function postfixEval(string) { | |
var stack = []; | |
var ch; // current char | |
for (var k = 0, length = string.length; k < length; k++) { | |
ch = string[k]; | |
// if it's a value, push it onto the stack | |
if (/\d/.test(ch)) | |
stack.push(ch); | |
// else if it's an operator | |
else if (ch in operators) { | |
var b = +stack.pop(); | |
var a = +stack.pop(); | |
var value = operators[ch](a, b); | |
stack.push(value); | |
} | |
// else we just skip whitespaces | |
} | |
if (stack.length > 1) | |
throw "ParseError: " + string + ", stack: " + stack; | |
return stack[0]; | |
} | |
// operators | |
var operators = { | |
"+": function (a, b) { return a + b }, | |
"-": function (a, b) { return a - b }, | |
"*": function (a, b) { return a * b }, | |
"/": function (a, b) { return a / b } | |
}; | |
// tests | |
console.log(postfixEval("2 3 +")); // 5 | |
console.log(postfixEval("2 3 + 5 *")); // 25 |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment