js 四则表运算解析

最新推荐文章于 2024-05-03 11:47:20 发布

xufei110

最新推荐文章于 2024-05-03 11:47:20 发布

阅读量271

点赞数

分类专栏： javascript 算法文章标签： javascript ViewUI

javascript 同时被 2 个专栏收录

5 篇文章 0 订阅

订阅专栏

2 篇文章 0 订阅

订阅专栏

<html>

<head>

<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />

<title>suanshu</title>

<script type="text/javascript">

var pattBrackets = /\([^\(\)]*\)/gm;

function main () {

var testStr = '1+4+(22+33)*((4+7)/6)+(3*4+(4+5))+100';

//console.log('source:',testStr)

var tempArrBrackes = [];

var temp3MArr = [];

var subArr = [];

var regExpShow = document.getElementById('regExp');

regExpShow.innerHTML = regExpShow.innerHTML + '<br>算式： ' +testStr;

//解析出括号中的内容

while(subArr = testStr.match(pattBrackets)) {

for (var i = 0;i < subArr.length ; i++)

{

var name = getName();

tempArrBrackes.push({name:name, formula:subArr[i].substring(1,subArr[i].length - 1)});

testStr = testStr.replace(subArr[i], name);

}

}

tempArrBrackes.push({name:getName(), formula:testStr});

//把没有括号的算式的数组解析成 a+b=n的树

for (var i = 0; i < tempArrBrackes.length ; i++)

{

var mArr = getStrByParrt(tempArrBrackes[i].formula, tempArrBrackes[i].name);

if (mArr)

{

temp3MArr = temp3MArr.concat(mArr);

}

}

//计算并将结果树打印到页面

var tree = getValue(temp3MArr);

for (var key in tree)

{

regExpShow.innerHTML = regExpShow.innerHTML + '<br>'+key+': ' + tree[key].formula + ' = ' +tree[key].value;

}

}

//解析最简单的计算式 a + b = n

var pattArr = [/n{0,1}\d+\*{1}n{0,1}\d+/

,/n{0,1}\d+\/{1}n{0,1}\d+/

,/n{0,1}\d+\+{1}n{0,1}\d+/

,/n{0,1}\d+\-{1}n{0,1}\d+/];

var pattD = /[\+\-\*\/]/gm;

function getStrByParrt (iStr, iName) {

//console.log('----------------------------:',iStr);

var ret = [];

var subStr = [];

for (var i = 0; i < pattArr.length; i++)

{

while(subStr = iStr.match(pattArr[i])) {

if (iStr.match(pattD).length == 1)

{

ret.push({name:iName, formula:subStr[0]});

break;

}

var name = getName();

ret.push({name:name, formula:subStr[0]});

iStr = iStr.replace(subStr, name);

}

}

//console.log('pattD',ret.toString())

return ret;

}

// 计算式算值

function getValue (m3Arr) {

var retTree = {};

for (var i = 0; i < m3Arr.length ; i++)

{

var formula = m3Arr[i].formula;

var name = m3Arr[i].name;

var sign = formula.match(pattD)[0];

var params = formula.split(sign);

retTree[name] = {

formula : formula

,value : ''

};

switch(sign){

case '+' : retTree[name].value = getValueFromTree(retTree, params[0]) + getValueFromTree(retTree, params[1]); break;

case '-' : retTree[name].value = getValueFromTree(retTree, params[0]) - getValueFromTree(retTree, params[1]); break;

case '*' : retTree[name].value = getValueFromTree(retTree, params[0]) * getValueFromTree(retTree, params[1]); break;

case '/' : retTree[name].value = getValueFromTree(retTree, params[0]) / getValueFromTree(retTree, params[1]); break;

}

}

return retTree;

}

// 字符串转数字变量不转

function getValueFromTree(tree, name) {

var value = '';

if (name.indexOf('n') >=0)

{

value = parseFloat(tree[name].value);

} else {

value = parseFloat(name);

}

return value;

}

//取变量名

var nameIndex = 0;

function getName () {

return 'n' + nameIndex++;

}

</script>

</head>

<body οnlοad=''>

<div id='show' style='height:30px'>'1+4+(22+33)*((4+7)/6)+(3*4+(4+5))+100'</div>

<input type='button' value='jisuan' οnclick='main()'>

<div id='regExp'></div>

</body>

</html>

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
js 四则表运算解析

&lt;html&gt;&lt;head&gt;&lt;meta http-equiv="Content-Type" content="text/html; charset=utf-8" /&gt;&lt;title&gt;suanshu&lt;/title&gt; &lt;!-- &lt;script src="http://ajax
复制链接

扫一扫

专栏目录

评论

被折叠的条评论为什么被折叠?

到【灌水乐园】发言

查看更多评论

添加红包

成就一亿技术人!

hope_wisdom

发出的红包

实付元

使用余额支付

点击重新获取

扫码支付

钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。