搜索资源列表
Caluate
- 将中缀表达式转换为后缀表达式,并计算任意四则运算表达式的结果,采用链表和队列实现,非文法和状态机-Infix expression would be converted to suffix expressions, and calculate the arithmetic expression of arbitrary results, the use of linked lists and queues to achieve, non-grammar and the state machine
ICCaluaten
- 将中缀表达式转换为后缀表达式,并计算任意四则运算表达式的结果果,采用链表和队列实现,非文法和状态机,已通过测试。 -Infix convert an expression for the postfix expression, and calculate any four of expression is the result fruit, using linked lists and queues, non-grammar and state machines, has been test
postfix-notation
- 1、给出文法如下: G[E] E->T|E+T T->F|T*F F->i(E) 对应的转化为逆波兰式的语义动作如下: E-> E(1)op E(2) {E.CODE:= E(1).CODE||E(2).CODE||op} E->(E(1)) { E.CODE := E(1).CODE} E->id { E.CODE := id} 2、利用实验5中的算符优先分析算法,结合上面给出的语义动作实现逆波兰式的构造