假设一个算术表达式中可包含如下符号：“（）”、“[]”、“{}”、 “/* */”可按任务次序嵌套使用，试利用栈的运算编写判别表达式中符号是否正确配对出现的算法-Assume that an arithmetic expression can contain the following symbols: () " " [] " ," {} " ," /**/" task order can be nested test prepare

1、编写函数，实现顺序栈的各种基本操作（可从上一实验中直接获取）； 2、编写函数，实现运算符的优先级处理； 3、编写函数，实现算术表达式的计算。 -1, write a function, the stack order to achieve a variety of basic operations (directly obtained from previous experiments) 2, write a function to achieve priority handl