第六章 第四节逆波兰计算器示例代码错误

[gaomei052]

原代码
{ for(i=1;i<=NF;i++){ if($i ~ /^[+-]?([0-9]+[.]?[0-9]*|[.][0-9]+$)/){ stack[++top] = $i continue }else if($i == "+" && top > 1){ stack[top-1] += stack[top];top-- }else if($i == "-" && top >1){ stack[top-1] -= stack[top] top-- }else if($i == "*" && top > 1){ stack[top-1] *= stack[top];top-- }else if($i == "/" && top > 1){ stack[top-1] /= stack[top];top-- }else if($i == "^" && top > 1){ stack[top-1] ^= stack[top];top-- }else{ printf("error: cannot evaluate %s\n",$i) top = 0 next } if(top == 1){ printf("\t%.8g\n",stack[top--]) }else if(top > 1){ printf("error: too many operands\n") top = 0 } } }
更改后的代码
{ top = 0 for(i=1;i<=NF;i++){ if($i ~ /^[+-]?([0-9]+[.]?[0-9]*|[.][0-9]+$)/){ stack[++top] = $i continue }else if($i == "+" && top > 1){ stack[top-1] += stack[top];top-- }else if($i == "-" && top >1){ stack[top-1] -= stack[top] top-- }else if($i == "*" && top > 1){ stack[top-1] *= stack[top];top-- }else if($i == "/" && top > 1){ stack[top-1] /= stack[top];top-- }else if($i == "^" && top > 1){ stack[top-1] ^= stack[top];top-- }else{ printf("error: cannot evaluate %s\n",$i) top = 0 next } if(top == 1 && i == NF){ printf("\t%.8g\n",stack[top]) }else if(top > 1 && i == NF){ printf("error: too many operands\n") top = 0 } } }

[wuzhouhui]

请用一个 pull request 或补丁来说明, 方便看出差异. 2025-01-03 13:04:32"gaomei052" ***@***.***>写道： 原代码 { for(i=1;i<=NF;i++){ if($i ~ /^[+-]?([0-9]+[.]?[0-9]*|[.][0-9]+$)/){ stack[++top] = $i continue }else if($i == "+" && top > 1){ stack[top-1] += stack[top];top-- }else if($i == "-" && top >1){ stack[top-1] -= stack[top] top-- }else if($i == "*" && top > 1){ stack[top-1] *= stack[top];top-- }else if($i == "/" && top > 1){ stack[top-1] /= stack[top];top-- }else if($i == "^" && top > 1){ stack[top-1] ^= stack[top];top-- }else{ printf("error: cannot evaluate %s\n",$i) top = 0 next } if(top == 1){ printf("\t%.8g\n",stack[top--]) }else if(top > 1){ printf("error: too many operands\n") top = 0 } } } 更改后的代码 { top = 0 for(i=1;i<=NF;i++){ if($i ~ /^[+-]?([0-9]+[.]?[0-9]*|[.][0-9]+$)/){ stack[++top] = $i continue }else if($i == "+" && top > 1){ stack[top-1] += stack[top];top-- }else if($i == "-" && top >1){ stack[top-1] -= stack[top] top-- }else if($i == "*" && top > 1){ stack[top-1] *= stack[top];top-- }else if($i == "/" && top > 1){ stack[top-1] /= stack[top];top-- }else if($i == "^" && top > 1){ stack[top-1] ^= stack[top];top-- }else{ printf("error: cannot evaluate %s\n",$i) top = 0 next } if(top == 1 && i == NF){ printf("\t%.8g\n",stack[top]) }else if(top > 1 && i == NF){ printf("error: too many operands\n") top = 0 } } } — Reply to this email directly, view it on GitHub, or unsubscribe. You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>

[gaomei052]

已提交pr