• C

postfix calculator using stacks

I need to write a program that is a post fix calculator.
The program must be able to deal with the user either entering a floating point number or a '+' ,a '-',a '*' ,or a '/'.  If one or more numbers are entered and the user hits return before entering the operation symbols '*\+-', then the list of numbers must be printed out from the stack.  If a user enters an operation symbol (=-*/) then the operation must be performed on the two numbers previous to it and the result  must be placed on the stack which is then printed out.  If the user hits q then the current stck must be printed out. If the user enters an operation on the stack and only one number has been entered previously, then an error message must be printed.  How can i do this ?  The data is scanned in as a string..but then must be tested against atof...i have read that atofs behavior is undefined if it does not come against a number when called.  I don't know how to implement this all into a loop ? suggestions! please....  
lkitchenAsked:
Who is Participating?
I wear a lot of hats...

"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.

q2guoCommented:
I assume that you have a structure call stack
and it contains the following member functions

char pop(void);
void push(char x);
bool isEmpty();
----------------------------------------------------
#include <stdio.h>
#include <ctype.h>
main(void)
{
    Stack *postFixc = new Stack;
    char temp, opt1, opt2;
    char str1[2] = {' ', '\0'};
    char str2[2] = {' ', '\0'};

    do {
      temp = getNextChar();
      if (temp == '+') {
           if(!postFixc->isEmpty()) return 1;
           opt1 = postFixc->pop();
           if(!postFixc->isEmpty()) {
               while(!postFixc->isEmpty())
                   printf("%c\n", postFixc->pop())
               return 0;
           }
           opt2 = postFixc->pop();
           str1[0] = opt1;
           str2[0] = opt2;
           temp = atoi(str1) + atoi(str2);          
           printf("%d\n", temp);
           postFixc->push(temp);
      }
      elseif %2
0

Experts Exchange Solution brought to you by

Your issues matter to us.

Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.

Start your 7-day free trial
q2guoCommented:
Refer any standard book on Data structures and Algorithms. One of the first things that you will find is stacks and post fix notation.
0
bagalpCommented:
See page 75, K&R, "The C Programming Language"
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
C

From novice to tech pro — start learning today.