<?php
$num_arr = array();// 声明数字栈
$op_arr = array();// 声明符号栈
$str = "10+6*2-18/2-2";
preg_match_all(''/./'', $str, $arr);// 把运算串分解成每个字符到$arr数组
$str_arr = $arr[0];
$length = count($str_arr);
$pre_num = '''';
// 开始入栈
for($i=0; $i<$length; $i++){
  $val = $str_arr[$i];
  // 数字
  if (is_numeric($val)){
    $pre_num .= $val;// 兼顾下一个字符可能也是数字的情况（多位数）
    if($i+1>=$length || isOper($str_arr[$i+1])){// 下一个是运算符或者到头了，则把数字塞进数字栈
      array_push($num_arr, $pre_num);
      $pre_num = '''';
    }
  // 符号判断优先级，选择是否入栈
  } else if (isOper($val)){
    if (count($op_arr)>0){
      // 判断优先级，只要不大于符号栈顶的优先级，就开始计算，直到优先级大于了栈顶的，计算后才再把这个运算符入栈
      while (end($op_arr) && priority($val) <= priority(end($op_arr))){
        calc($num_arr, $op_arr);
      }
    }
    array_push($op_arr, $val);
  }
}
//echo ''<pre>'';
//print_r($num_arr);
//print_r($op_arr);
// 计算栈里剩余的
while(count($num_arr)>0){
  calc($num_arr, $op_arr);
  if (count($num_arr)==1){
    $result = array_pop($num_arr);
    break;
  }
}
echo $str,'' = '', $result;
// 计算，获取数字栈的两个数，符号栈顶的运算符
function calc(&$num_arr, &$op_arr){
  if (count($num_arr)>0){
    $num1 = array_pop($num_arr);
    $num2 = array_pop($num_arr);
    $op = array_pop($op_arr);
    if ($op==''*'') $re = $num1*$num2;
    if ($op==''/'') $re = $num2/$num1;// 这里注意顺序，栈是先进后出，所以$num2是被除数
    if ($op==''+'') $re = $num2+$num1;
    if ($op==''-'') $re = $num2-$num1;
    array_push($num_arr, $re);
  }
}
// 获取优先级
function priority($str){
  if ($str == ''*'' || $str == ''/''){
    return 1;
  } else {
    return 0;
  }
}
// 判断是否是运算符
function isOper($oper){
  $oper_array = array(''+'',''-'',''*'',''/'');
  if (in_array($oper, $oper_array)){
    return true;
  }
  return false;
}

10+6*2-18/2-2 = 11

• PHP 使用位运算实现四则运算的代码
• 用PHP实现的四则运算表达式计算实现代码
• php实现简单四则运算器

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace 工厂方法实现计算器
{
  /// <summary>
  /// 计算器类（抽象类，由子类重写）
  /// </summary>
  public abstract class Calculator
  {
    public double Number1 { get; set; }
    public double Number2 { get; set; }
    public Calculator() { }
    public Calculator(double a,double b)
    {
      this.Number1=a;
      this.Number2=b;
    }
    /// <summary>
    /// 计算
    /// </summary>
    /// <returns></returns>
    public abstract double jsuan();
  }
  /// <summary>
  /// 加法类
  /// </summary>
  public class jiafaDll:Calculator //子类拥有父类除私有之外的所有属性字段和方法
  {
    public jiafaDll() { }
    public jiafaDll(double a,double b)
      : base(a,b)  //调用父类带两个参数的构造函数，来初始化Number1 和Number2 （注意：因为jianfaDll类继承了Calculator，所以jianfaDll类是有Number1，和Number2两个属性的）
    { }
    /// <summary>
    /// 重写父类的jsuan方法
    /// </summary>
    /// <returns></returns>
    public override double jsuan()
    {
      return Number1 + Number2;
    }
  }
  /// <summary>
  /// 减法类
  /// </summary>
  public class jianfaDll : Calculator
  {
    public jianfaDll()
    { }
    public jianfaDll(double a,b)
    { }
    public override double jsuan()
    {
      return Number1 - Number2;
    }
  }
  class Program
  {
    static void Main(string[] args)
    {
      Console.WriteLine("请输入第一个数");
      double number1 = Convert.Todouble(Console.ReadLine());
      Console.WriteLine("请输入一个操作符");
      string caozuofu = Console.ReadLine();
      Console.WriteLine("请输入第二个数");
      double number2 = Convert.Todouble(Console.ReadLine());
      Calculator c=null;
      switch (caozuofu)
      {
        case "+":
          c = new jiafaDll(number1,number2);
          break;
        case "-":
          c = new jianfaDll(number1,number2);
          break;
      }
      double i= c.jsuan();
      Console.WriteLine(i);
      Console.ReadKey();
    }
  }
}

using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Text;
using System.Windows.Forms;
namespace 计算器
{
  public partial class Form1 : Form
  {
    public Form1()
    {
      InitializeComponent();
    }
    public　string　num;
    public int flag;//用于判断输入的操作符
    public double num1,num2;
    private void num0_button_Click(object sender,EventArgs e)
    {
      num = num + "0";
      num2 = Convert.Todouble(num);
      textBox.Text = num;
    }
    private void num1_button_Click(object sender,EventArgs e)//重点算法1
    {
      if (textBox.Text == "0")
      {
        num = "1";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "1";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void num2_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text == "0")
      {
        num = "2";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "2";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void num3_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text == "0")
      {
        num = "3";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "3";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void num4_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text == "0")
      {
        num = "4";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "4";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void num5_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text == "0")
      {
        num = "5";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "5";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void num6_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text == "0")
      {
        num = "6";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "6";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void num7_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text == "0")
      {
        num = "7";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "7";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void num8_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text == "0")
      {
        num = "8";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "8";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void num9_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text == "0")
      {
        num = "9";
        textBox.Text = Convert.ToString(num);
      }
      else
      {
        num = num + "9";
        num2 = Convert.Todouble(num);
        textBox.Text = num;
      }
    }
    private void add_button_Click(object sender,EventArgs e)//重点算法2
    {
      if (textBox.Text.Length > 0)
      {
        num1 = Convert.Todouble(textBox .Text);
        num = "";
        flag = 1;
        textBox.Text = "";
        textBox.Focus();
      }
    }
    private void dev_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text.Length > 0)
      {
        num1 = Convert.Todouble(textBox.Text);
        num = "";
        flag = 2;
        textBox.Text = "";
        textBox.Focus();
      }
    }
    private void mul_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text.Length > 0)
      {
        num1 = Convert.Todouble(textBox.Text);
        num = "";
        flag = 3;
        textBox.Text = "";
        textBox.Focus();
      }
    }
    private void chu_button_Click(object sender,EventArgs e)
    {
      if (textBox.Text.Length > 0)
      {
        num1 = Convert.Todouble(textBox.Text);
        num = "";
        flag = 4;
        // textBox.Text = "";
        textBox.Focus();
      }
    }
    private void equ_button_Click(object sender,EventArgs e)
    {
      switch (flag)
      {
        case 1:
          textBox.Text = Convert.ToString(num1+Convert .Todouble(num));//重点算法3
          num2 = Convert.Todouble(textBox .Text);
          break;
        case 2:
          textBox.Text = Convert.ToString(num1 - Convert.Todouble(num));
          num2 = Convert.Todouble(textBox.Text);
          break;
        case 3:
          textBox.Text = Convert.ToString(num1 * Convert.Todouble(num));
          num2 = Convert.Todouble(textBox.Text);
          break;
        case 4:
          textBox.Text = Convert.ToString(num1 / Convert.Todouble(num));
          num2 = Convert.Todouble(textBox.Text);
          break;
      }
    }
    private void re_button_Click(object sender,EventArgs e)
    {
      num = "";
      textBox.Text = "0";
    }
  }
}

目录

• 缘起
• 目标
• 难点
• 总体流程
• main.go
• tokens/tokens.go
• states/states.go
• lexer/lexer.go
• parser/tStackNode.go
• parser/parser.go
• 输出

func main() {
    reader := bufio.NewReader(os.Stdin)
    for {
        fmt.Printf("=> ")
        arrBytes, _, err := reader.ReadLine()
        if err != nil {
            panic(err.Error())
        }
        line := strings.TrimSpace(string(arrBytes))
        expression := line
        tokens, e := lexer.Parse(expression)
        if e != nil {
            println(e.Error())
        } else {
            e,v := parser.Parse(tokens)
            if e != nil {
                println(e.Error())
            }
            fmt.Println(strconv.FormatFloat(v, ''f'', 10, 64))
        }
    }
}

package tokens
type TOKENS string
const IntLiteral TOKENS = "INT"
const DoubleLiteral TOKENS = "DBL"
const ADD TOKENS = "ADD"
const SUB TOKENS = "SUB"
const MUL TOKENS = "MUL"
const DIV TOKENS = "DIV"
const LB TOKENS = "LB"
const RB TOKENS = "RB"
const UNKNOWN TOKENS = "UNKNOWN"
type Token struct {
    Token TOKENS
    Value string
    Position int
}
func OfRune(t TOKENS, r rune, from int)  *Token {
    return &Token {
        Token: t,
        Value : string(r),
        Position: from,
    }
}
func OfString(t TOKENS, s string, from int)  *Token {
    return &Token {
        Token: t,
        Value : s,
        Position: from,
    }
}

type STATES int
const INITIAL STATES = 1
const INT_STATUS STATES = 11
const DOT_STATUS STATES = 12
const FRAG_STATUS STATES = 13

type tLexerState struct {
    state states.STATES
    tokens []*tokens.Token
    buffer []rune
    i0 int
    i1 int
    d0 int
    d1 int
}
func (me *tLexerState) AppendToken(t *tokens.Token) {
    me.tokens = append(me.tokens, t)
}
func (me *tLexerState) AppendChar(it rune) {
    me.buffer = append(me.buffer, it)
}
func (me *tLexerState) BufferSize() int {
    return len(me.buffer)
}
func (me *tLexerState) IntSize() int {
    return me.i1 - me.i0 + 1
}
func (me *tLexerState) FragSize() int {
    return me.d1 - me.d0 + 1
}
func Parse(line string) ([]*tokens.Token, error) {
    var state = &(tLexerState{
        state: states.INITIAL,
        tokens: make([]*tokens.Token, 0),
        buffer: make([]rune, 0),
        i0 : 0,
        i1 : 0,
        d0: 0,
        d1: 0,
    })
    for i, it := range line + "\n" {
        e := parseChar(state, i, it)
        if e != nil {
            return nil, e
        }
    }
    return state.tokens, nil
}
func parseChar(state *tLexerState, i int, it rune) error {
    var e error = nil
    switch state.state {
    case states.INITIAL:
        e = parseCharWhenInitial(state, i, it)
        break
    case states.INT_STATUS:
        e = parseCharWhenInt(state, i, it)
        break
    case states.DOT_STATUS:
        e = parseCharWhenDot(state, i, it)
        break
    case states.FRAG_STATUS:
        e = parseCharWhenFrag(state, i, it)
        break
    }
    return e
}
func parseCharWhenInitial(state *tLexerState, i int, it rune) error {
    if is_minus(it) || is_0_to_9(it) {
        state.state = states.INT_STATUS
        state.buffer = make([]rune, 0)
        state.buffer = append(state.buffer, it)
        state.i0 = i
        state.i1 = i
    } else if is_space(it){
        return nil
    } else if is_add(it) {
        state.AppendToken(tokens.OfRune(tokens.ADD, it, i))
    } else if is_sub(it) {
        state.AppendToken(tokens.OfRune(tokens.SUB, it, i))
    } else if is_mul(it) {
        state.AppendToken(tokens.OfRune(tokens.MUL, it, i))
    } else if is_div(it) {
        state.AppendToken(tokens.OfRune(tokens.DIV, it, i))
    } else if is_lb(it) {
        state.AppendToken(tokens.OfRune(tokens.LB, it, i))
    }  else if is_rb(it) {
        state.AppendToken(tokens.OfRune(tokens.RB, it, i))
    } else {
        return errors.New(fmt.Sprintf("parseCharWhenInitial, invalid char %c at %d", it, i))
    }
    return nil
}
func parseCharWhenInt(state *tLexerState, i int, it rune) error {
    if is_0_to_9(it) {
        if state.BufferSize() >= 10 {
            return errors.New(fmt.Sprintf("too large int number at %v", i))
        } else {
            state.AppendChar(it)
            state.i1 = i
        }
    } else if is_dot(it) {
        state.AppendChar(it)
        state.state = states.DOT_STATUS
    } else if is_space(it) {
        state.AppendToken(tokens.OfString(tokens.IntLiteral, string(state.buffer), state.i1))
        state.state = states.INITIAL
    } else if is_rb(it) {
        state.AppendToken(tokens.OfString(tokens.IntLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.RB, it, i))
        state.state = states.INITIAL
    }  else if is_add(it) {
        state.AppendToken(tokens.OfString(tokens.IntLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.ADD, it, i))
        state.state = states.INITIAL
    } else if is_sub(it) {
        state.AppendToken(tokens.OfString(tokens.IntLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.SUB, it, i))
        state.state = states.INITIAL
    } else if is_mul(it) {
        state.AppendToken(tokens.OfString(tokens.IntLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.MUL, it, i))
        state.state = states.INITIAL
    } else if is_div(it) {
        state.AppendToken(tokens.OfString(tokens.IntLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.DIV, it, i))
        state.state = states.INITIAL
    } else {
        return errors.New(fmt.Sprintf("parseCharWhenInt, invalid char %c at %d", it, i))
    }
    return nil
}
func parseCharWhenDot(state *tLexerState, i int, it rune) error {
    if is_0_to_9(it) {
        state.state = states.FRAG_STATUS
        state.AppendChar(it)
        state.d0 = i
        state.d1 = i
    } else {
        return errors.New(fmt.Sprintf("parseCharWhenDot, invalid char %c at %d", it, i))
    }
    return nil
}
func parseCharWhenFrag(state *tLexerState, i int, it rune) error {
    if is_0_to_9(it) {
        if state.FragSize() >= 10 {
            return errors.New(fmt.Sprintf("too many chars for a double value at %d", i))
        } else {
            state.AppendChar(it)
            state.d1 = i
        }
    } else if is_space(it) {
        state.AppendToken(tokens.OfString(tokens.DoubleLiteral, string(state.buffer), state.i1))
        state.state = states.INITIAL
    } else if is_add(it) {
        state.AppendToken(tokens.OfString(tokens.DoubleLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.ADD, it, i))
        state.state = states.INITIAL
    } else if is_sub(it) {
        state.AppendToken(tokens.OfString(tokens.DoubleLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.SUB, it, i))
        state.state = states.INITIAL
    } else if is_mul(it) {
        state.AppendToken(tokens.OfString(tokens.DoubleLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.MUL, it, i))
        state.state = states.INITIAL
    } else if is_div(it) {
        state.AppendToken(tokens.OfString(tokens.DoubleLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.DIV, it, i))
        state.state = states.INITIAL
    } else if is_rb(it) {
        state.AppendToken(tokens.OfString(tokens.DoubleLiteral, string(state.buffer), state.i1))
        state.AppendToken(tokens.OfRune(tokens.RB, it, i))
        state.state = states.INITIAL
    } else {
        return errors.New(fmt.Sprintf("parseCharWhenFrag, invalid char %c at %d", it, i))
    }
    return nil
}

type tStackNodeType int
const NODE_VALUE tStackNodeType = 1
const NODE_TOKEN tStackNodeType = 2
type tStackNode struct {
    flag tStackNodeType
    token *tokens.Token
    value float64
}
func newValueNode(value float64) *tStackNode {
    return &tStackNode{
        flag: NODE_VALUE,
        value: value,
        token: nil,
    }
}
func newTokenNode(token *tokens.Token) *tStackNode {
    return &tStackNode{
        flag: NODE_TOKEN,
        token: token,
        value: 0,
    }
}
func (me *tStackNode) getTokenType() tokens.TOKENS {
    switch me.flag {
    case NODE_VALUE:
        return tokens.DoubleLiteral
    case NODE_TOKEN:
        switch me.token.Token {
        case tokens.IntLiteral:
            fallthrough
        case tokens.DoubleLiteral:
            return tokens.DoubleLiteral
        default:
            return me.token.Token
        }
    }
    return tokens.UNKNOWN
}
func (me *tStackNode) getDoubleValue() float64 {
    switch me.flag {
    case NODE_VALUE:
        return me.value
    case NODE_TOKEN:
        switch me.token.Token {
        case tokens.IntLiteral:
            fallthrough
        case tokens.DoubleLiteral:
            v1,e1 := strconv.ParseFloat(me.token.Value, 64)
            if e1 != nil {
                panic(e1)
            }
            return v1
        }
    }
    panic("value not avaiable")
}

type tParser struct {
    tokens []*tokens.Token
    stack []*tStackNode
    total int
    position int
}
func newParser(tokens []*tokens.Token)  *tParser {
    return &tParser{
        tokens: tokens,
        stack: make([]*tStackNode, 0),
        total : len(tokens),
        position: -1,
    }
}
func (me *tParser) showStack() string {
    lst := make([]string, 0)
    for _,it := range me.stack {
        switch it.flag {
        case NODE_VALUE:
            lst = append(lst, strconv.FormatFloat(it.value, ''f'', 10, 64))
            break
        case NODE_TOKEN:
            switch it.token.Token {
            case tokens.DoubleLiteral:
                fallthrough
            case tokens.IntLiteral:
                lst = append(lst, it.token.Value)
                break
            default:
                lst = append(lst, it.token.Value)
                break
            }
        }
    }
    return strings.Join(lst, " ")
}
func (me *tParser) moreToken() bool {
    return me.position < me.total - 1
}
func (me *tParser) nextToken() *tokens.Token {
    if !me.moreToken() {
        return nil
    }
    me.position++
    return me.currentToken()
}
func (me *tParser) currentToken() *tokens.Token {
    if me.position >= me.total {
        return nil
    }
    return me.tokens[me.position]
}
func (me *tParser) reduce() {
    sCurrentStack := ""
    var fnCheckState = func() {
        sStackState := me.showStack()
        if sStackState != sCurrentStack {
            sCurrentStack = sStackState
            fmt.Printf("stack => %s\n", sStackState)
        }
    }
    for {
        fnCheckState()
        if me.reduceMulOrDiv() {
            continue
        }
        if me.reduceBrackets() {
            continue
        }
        if !me.moreToken() {
            if me.reduceAddOrSub() {
                break
            }
        }
        fnCheckState()
        //time.Sleep(1*time.Second)
        break
    }
}
func (me *tParser) stackPop() *tStackNode {
    if me.isStackEmpty() {
        return nil
    }
    var iStackSize = len(me.stack)
    var last = me.stack[iStackSize - 1]
    me.stack = me.stack[:(iStackSize-1)]
    return last
}
func (me *tParser) stackPopN(n int) []*tStackNode {
    if me.isStackEmpty() {
        return nil
    }
    var iStackSize = len(me.stack)
    if iStackSize < n {
        return nil
    }
    var lstTailItems = me.stack[(iStackSize - n):]
    me.stack = me.stack[:(iStackSize-n)]
    return lstTailItems
}
func (me *tParser) stackTakeN(n int) []*tStackNode {
    if me.isStackEmpty() {
        return nil
    }
    var iStackSize = len(me.stack)
    if iStackSize < n {
        return nil
    }
    var lstHeadItems = me.stack[:n]
    me.stack = me.stack[n+1:]
    return lstHeadItems
}
func (me *tParser) stackPush(it *tStackNode) {
    me.stack = append(me.stack, it)
}
func (me *tParser) reduceMulOrDiv() bool {
    if me.isStackEmpty() {
        return false
    }
    if me.isStackRMatch(tokens.DoubleLiteral, tokens.MUL, tokens.DoubleLiteral) {
        var lstTailNodes = me.stackPopN(3)
        v1 := lstTailNodes[0].getDoubleValue()
        v2 := lstTailNodes[2].getDoubleValue()
        var v = v1*v2
        me.stackPush(newValueNode(v))
        return true
    } else if me.isStackRMatch(tokens.DoubleLiteral, tokens.DIV, tokens.DoubleLiteral) {
        var lstTailNodes = me.stackPopN(3)
        v1 := lstTailNodes[0].getDoubleValue()
        v2 := lstTailNodes[2].getDoubleValue()
        if v2 == 0 {
            panic(fmt.Sprintf("div by zero, %v / %v", v1, v2))
        }
        var v = v1/v2
        me.stackPush(newValueNode(v))
        return true
    }
    return false
}
func (me *tParser) reduceBrackets() bool {
    if me.isStackEmpty() {
        return false
    }
    if me.isStackRMatch(tokens.RB) {
        rb := me.stackPop()
        var v float64 = 0
        for {
            if me.isStackRMatch(tokens.LB, tokens.DoubleLiteral) {
                var lstTailNodes = me.stackPopN(2)
                v += lstTailNodes[1].getDoubleValue()
                me.stackPush(newValueNode(v))
                return true
            } else if me.isStackRMatch(tokens.ADD, tokens.DoubleLiteral) {
                var lstTailNodes = me.stackPopN(2)
                v1 := lstTailNodes[1].getDoubleValue()
                v = v + v1
            } else if me.isStackRMatch(tokens.SUB, tokens.DoubleLiteral) {
                var lstTailNodes = me.stackPopN(2)
                v1 := lstTailNodes[1].getDoubleValue()
                v = v - v1
            } else {
                panic(fmt.Sprintf("LB not found at %v", rb.token.Position))
            }
        }
    }
    return false
}
func (me *tParser) reduceAddOrSub() bool {
    var v float64 = 0
    for {
        if me.isStackEmpty() {
            break
        }
        if me.isStackRMatch(tokens.ADD, tokens.DoubleLiteral) {
            var lstTailNodes = me.stackPopN(2)
            v1 := lstTailNodes[1].getDoubleValue()
            v = v + v1
        } else if me.isStackRMatch(tokens.SUB, tokens.DoubleLiteral) {
            var lstTailNodes = me.stackPopN(2)
            v1 := lstTailNodes[1].getDoubleValue()
            v = v - v1
        } else if len(me.stack)==1 && me.isStackRMatch(tokens.DoubleLiteral) {
            it := me.stackPop()
            v += it.getDoubleValue()
            me.stackPush(newValueNode(v))
            return true
        } else {
            panic("invalid expression")
        }
    }
    return false
}
func (me *tParser) isStackEmpty() bool {
    return len(me.stack) == 0
}
func (me *tParser) isStackRMatch(args...tokens.TOKENS) bool {
    var iArgsSize = len(args)
    if iArgsSize <= 0 {
        return false
    }
    var iStackSize = len(me.stack)
    if iStackSize < iArgsSize {
        return false
    }
    for i,it := range args {
        var n = iStackSize - iArgsSize + i
        var xStackNode = me.stack[n]
        if it != xStackNode.getTokenType() {
            return false
        }
    }
    return true
}
func (me *tParser) isStackLMatch(args...tokens.TOKENS) bool {
    var iArgsSize = len(args)
    if iArgsSize <= 0 {
        return false
    }
    var iStackSize = len(me.stack)
    if iStackSize < iArgsSize {
        return false
    }
    for i,it := range args {
        var xStackNode = me.stack[i]
        if it != xStackNode.getTokenType() {
            return false
        }
    }
    return true
}
func (me *tParser) parse() (error, float64) {
    for {
        t := me.nextToken()
        if t == nil {
            break
        }
        me.stackPush(newTokenNode(t))
        me.reduce()
    }
    var iStackSize = len(me.stack)
    if iStackSize == 1 && me.stack[0].getTokenType() == tokens.DoubleLiteral {
        return nil, me.stack[0].getDoubleValue()
    }
    panic(fmt.Sprintf("failed parsing expression %s", me.showStack()))
}
func Parse(tokens []*tokens.Token) (error, float64) {
    parser := newParser(tokens)
    return parser.parse()
}

• golang实现ftp实时传输文件的案例
• golang http 连接超时和传输超时的例子
• Golang栈结构和后缀表达式实现计算器示例
• golang架构设计开闭原则手写实现
• golang 随机数的两种方式
• Golang切片删除指定元素的三种方法对比
• Golang 实现 RTP音视频传输示例详解