Still can't find out where the wrong is.....

Question

Here is the code I use to convert a String of infix expression
into a postfix array.
But I still can't find out where the problem is,can someone help me out, thanks...
public void i2p(String i,char p[])
       int position ,outpos = 0;
       char topsymb = '+', symb, del;
       Stack opstk = new Stack(20);
       System.out.println("the original infix expression is: " + i);
       for(position=0 ; position< i.length() ; position++)
            symb = i.charAt(position);
            if(isoperand(symb))
               p[outpos++] = symb;
            else
                 if(!opstk.empty()){
                      topsymb = opstk.pop();
                 prcdNum(topsymb, symb);
                 while(opstk.empty() == false && prcd(topsymb, symb) == true )
                 del = opstk.pop();
                 p[outpos++] = topsymb;
                 if(opstk.empty() == false && prcd(topsymb, symb) == false){
                    opstk.push(topsymb);
                    p[outpos++] = symb;
                 if(opstk.empty() == true && symb != ')'){
                    opstk.push(symb);
           while(!opstk.empty())
             p[outpos++] = opstk.pop();
  }

Answer 1

For example when I input a+b*c , it output abc* ,,,,,,,