#include <stdio.h>
#include <stdlib.h>
#include <ctype.h>
#include <string.h>

#define TYPE int
#define SIZE 1000

typedef struct{
    int top;
    TYPE stuff[SIZE];
}Stack;

void initialize(Stack *s)
{
    int i=0;
    s->top=0;
    for(i=0;i<SIZE;i++)
        s->stuff[i]=0;
}

int top(Stack *s)
 {
    return s->stuff[s->top];
 }

void push(Stack *s,TYPE value)
 {
     s->stuff[s->top++]=value;
 }

int isEmpty(Stack *s)
{
    return s->top==0?1:0 ;
}

int pop(Stack *s)
 {
    if(!isEmpty(s));
    return s->stuff[--s->top];
    printf("%d",s->stuff[--s->top]);
 }

int isfull(Stack *s)
{
    return s->top<SIZE?0:1 ;
}

void error()
{
    printf("Something is just not right. Try Again!\n");
    exit(-1);
}

int Precedence(char c)
{
    switch (c)
    {
    case '+':
        return 1;
    case '-':
        return 1;

    case '*':
        return 2;
    case '/':
        return 2;

    case '^':
        return 3;
    }
    return -1;
}

int evaluatePostfix(char postfix[],Stack *s)
{
    printf("Postfix= %s.\n",postfix);
    int i=0,flag=0,temp=0;
    char ch;
    while((ch=postfix[i++])!= '\n')
    {
        if (ch==' ')
        {
            flag=0;
            continue;
        }
        if (isdigit(ch))
            {
                temp=ch-48;
                if(flag==1)
                {
                    temp+=pop(s)*10;
                }
                push(s,temp);
                flag=1;
            }
        else if(ch=='+' || ch=='*' || ch=='-' || ch=='/')
            {
                flag=0;
                int val1,val2;
                if (isEmpty(s))
                    error();
                else
                    val1=pop(s);
                if (isEmpty(s))
                    error();
                else
                    val2=pop(s);
                switch (ch)
                    {
                    case '+':
                        push(s, val2 + val1);
                        break;
                    case '*':
                        push(s, val2 - val1);
                        break;
                    case '-':
                        push(s, val2 * val1);
                        break;
                    case '/':
                        push(s, val2/val1);
                        break;
                    }
            }
    }
    return pop(s);
}

void infixTopostfix(char infix[], char *postfix[])
{
    printf("Infix=%s.\n",infix);
    int i=0;
    Stack s1;
    initialize(&s1);
    char ch,ch1,*pt=infix,*temp=malloc(sizeof(infix));
    while(ch=*pt++)
    {
        if (ch>='0' && ch<='9')
        {
            temp[i]=ch;
            i++;
        }
        if (ch==' ')
        {
            temp[i]=ch;
            i++;
        }
        else switch(ch)
        {
        case '(':
        case '+':
        case '-':
        case '*':
        case '/':
            push(&s1,ch);
            break;
        case ')':
            while(!isEmpty(&s1))
            {
                ch1=pop(&s1);
                if (ch1=='(')
                    break;
                temp[i]=ch1;
                i++;
            }
        }
    }
    while(!isEmpty(&s1))
            {
                ch1=pop(&s1);
                if (ch1=='(')
                    break;
                temp[i]=ch1;
                i++;
            }
    *postfix=temp;
}

int main()
{
    Stack s;
    char *infix=malloc(sizeof(char)*50);
    char *postfix=malloc(sizeof(char)*50);
    initialize(&s);
    printf("Please enter an infix expression:\n");
    fflush(stdin);
    fgets(infix,50,stdin);
    infix[strlen(infix)-1]='\0';
    infixTopostfix(infix,&postfix);
    printf("Result = %d",evaluatePostfix(postfix,&s));

    return 0;
}