可以仅使用队列将中缀表示法中的字符串转换为前缀表示法吗？ （考虑唯一的操作是 + 和 - 的情况）

Question

public class Convert{ 
/* the algorithm works as follows after inserting all elements of infix string 
into an empty Queue iterate over queue for infix.length() number of times and 
check if element at front of queue is an operator if yes enque the element to 
back of the queue else deque the operand and concatenate it with the empty 
prefix string here is an example then finally deque the queue elements with 
the prefix string*/                  

    public static String Pre(String in){
        int i = 0;
        Queue Q = new Queue(in.length());     //assuming a Queue of characters
        while(i<in.length()){
            Q.enque(in.charAt(i));       
        }
        i = in.length()-1;
        String pre = "";
        while(i>=0){                         //move operators to end of queue
            if(Q.peek()=='+'||'-'){           //if character is oper enque at end 
                Q.enque(Q.deque);}
            else{
                pre  = pre + Q.deque;
            }            // concatenate operands with prefix 
        }
        while(!Q.isEmpty) {                        //concatenate the operators 
            pre = Q.deque + pre;
        }
        return pre;                               // end of method
    }
}

Answer 1

“帖子”生产系统仅使用队列。它具有与图灵机相当的能力。

Answer 2

鉴于您指定的语法非常有限，对我来说，您似乎可以使用双端队列将中缀转换为前缀。如果语法更复杂，我怀疑这种方法是否有效。