例句與造句

1. Converting infix expression to a postfix expression
   中綴表達(dá)式到后綴表達(dá)式的轉(zhuǎn)換
2. The second form is a postfix decrement operation
   第二種形式是后綴減量操作。
3. The second form is a postfix increment operation
   第二種形式是后綴增量操作。
4. Read the postfix expression from left to right
   從左到右讀入后綴表達(dá)式
5. Prefix and postfix notation have three common features
   前綴和后綴表示法有三項(xiàng)公共特征：
6. It's difficult to find postfix in a sentence. 用postfix造句挺難的
7. In postfix notation , the operator comes after its operands
   在后綴表示法中，操作符位于操作數(shù)后面。
8. You can use the following algorithm to evaluate postfix expressions
   您可以用如下算法對(duì)后綴表達(dá)式求值：
9. At the end of the postfix expression , pop a result from the stack
   到后綴表達(dá)式末尾，從堆棧中彈出結(jié)果。
10. Evaluating the postfix expression
    對(duì)后綴表達(dá)式求值
11. Postfix notation is also known as
    后綴表示法也稱
12. Yet sometimes i think that his name has a postfix of arsenal
    至今有時(shí)候我仍然認(rèn)為他的名字是阿森納的一個(gè)后綴？
13. If the postfix expression was correctly formed , the stack should be empty
    若后綴表達(dá)式格式正確，那么堆棧應(yīng)該為空。
14. 2 . postfix operators have the highest order of precedence in expression evaluation
    2 .后綴運(yùn)算符在表達(dá)式計(jì)算中具有最高的優(yōu)先級(jí)。
15. Evaluating a postfix expression is simpler than directly evaluating an infix expression
    對(duì)后綴表達(dá)式求值比直接對(duì)中綴表達(dá)式求值簡單。
16. Write the following in normal non - postfix notation , and simplify them if you can
    以通常（不帶后綴）的表示法編寫以下代碼，如果可以，則簡化它們：
更多例句：  下一頁