Description: Suppose the expression is composed of monoalphabetic variables and binary operators;
(2) input any non-blank expression from the keyboard;
(3) use the stack to determine whether the input expression is a correct postfix expression;
(4) transform the correct postfix expression into a prefix expression;
File list (Check if you may need any files):
Download