ONP2e

public class Onp2 {

	public static void main(String[] args) {
		int j = 0;
		String[] stack = new String[10];
		int stackPosition = -1;
		for(String str: args)
		{
			stack[j] = "";
			if(str.endsWith("=")){
				for(int i=0; i< str.length(); i++)
					if(str.charAt(i) >= '0' && str.charAt(i) <= '9' || str.charAt(i) == '.'){
						stack[++stackPosition] = str.charAt(i) + " ";
					}
					else{
						switch(str.charAt(i)){
						case '-':
						case '+':{
								stack[--stackPosition] = "( " + stack[stackPosition] + str.charAt(i) + " " + stack[stackPosition+1] + ") ";
							break;
						}
						case '*':
						case '/':
						case '^':
							stack[--stackPosition] = stack[stackPosition] + str.charAt(i) + " " + stack[stackPosition+1];
							break;
						case '=':
							stack[stackPosition] += str.charAt(i) + " ";
							break;
						default:
							break;

					}
					}
			}
			else
				System.out.println(str + ": Bledne rownanie");
			System.out.println(args[j]);
			System.out.println(stack[j]);
			j++;
		}

	}

}