C Tutorial

C Tutorial C Language Environment Setup Execution flow of C program C printf and Scanf C Data type C Token Variable in C Operators in C Comments in C Escape Sequence in C C – Storage Classes C Decision control statement Loop Statement in C Break, continue and goto statement in C Type Casting in C Function in C Recursion in C String in C C Array Pointer in C Dynamic memory allocation C –Structure Nested Structure in C Union in C File Handling in C C pre-processor Static Function In C Sizeof In C Selection Sort In C Scope Of Variables In C Runtime Vs Compile Time In C Random Access Lseek In C Queue Implementation In C Pseudo Code In C Prototype In C Pointer To Pointer In C Pointer Arithmetic In C Passing Array To Function In C Null Character In C Merge Sort In C Macros In C Library Functions In C Memory Leak In C Int In C Goto And Labels In C Fibonacci Series In C Fflush In C Derived Data Types In C Data Types In C Const Vs Volatile In C Character Set In C Character Class Tests In C Calloc In C C Pointers Arrays In C Include In C Clrscr In C C Vs Java String Literals In C Types Of Pointers In C Variables In C Volatile In C Why C Is A Middle Level Language Infix To Postfix Program In C Ceil function in C LCM of two numbers in C Quick sort in C Static in C function pointer as argument in C Top Array Keywords in C Add two numbers using the function in C Armstrong program in C using function Array, Declaring Arrays and Array Initialization Limitations of Inline Function in C Merge and Merge sort with example in C Do-While Loop in C For Loop in C While-Loop in C Difference between while and do-while loop in C Array Of Structures in C Data Structures And Algorithms in C Types Of Structures In C How to Avoid Structure Padding in C Use of Structure in C Do WHILE LOOP in C Programming Examples For Loop in C Programming Examples Entry Control Loop in C Exit control loop in C Infinite loop in C Nested loop in C pow() function in C String Handling functions in C

Infix to Postfix program in C

Infix Expression: In infix expression, an operator is placed between the two operands. Example: x + y, here operator + is placed between operands x and y.

Postfix Expression: In postfix expression, an operator is placed after the operands. Example: xy+, here operator + is placed after the operands x and y.

Algorithm for the conversion from infix to postfix

  1. Start
  2. Read the expression from user.
  3. Scan the expression character by character, if the character is alphabet or number print it to the console
  4. If the expression is operator then,
    • If the precedence of current character operator is greater than top of the stack (or the stack is empty) then push an operator into the stack.
    • If the precedence of current character operator is less than the top of stack, pop all elements from the stack whose precedence is greater than or equal to the current element.
  5. If the operator is ‘(‘, push it on stack.
  6. If the operator is ‘) ‘, pop all elements from stack until we get ‘(‘and also remove ‘(‘and ‘) ‘operator from the stack.
  7. Repeat the steps from 3 to 6 until the expression becomes empty.
  8. Print the output to screen
  9. Pop all elements from the stack and print the output to console.
  10. End

Example

Consider the below code:

#include<stdio.h>

#include<ctype.h>

char stack[100];

int top = -1;

void push(char x)

{

    stack[++top] = x;

}

char pop()

{

    if(top == -1)

        return -1;

    else

        return stack[top--];

}

int priority(char x)

{

    if(x == '(')

        return 0;

    if(x == '+' || x == '-')

        return 1;

    if(x == '*' || x == '/')

        return 2;

    return 0;

}

int main()

{

    char exp[100];

    char *e, x;

    printf("Enter the expression : ");

    scanf("%s",exp);

    printf("\n");

    e = exp;

    printf("Postfix expression : ");

    while(*e != '\0')

    {

        if(isalnum(*e))

            printf("%c ",*e);

        else if(*e == '(')

            push(*e);

        else if(*e == ')')

        {

            while((x = pop()) != '(')

                printf("%c ", x);

        }

        else

        {

            while(priority(stack[top]) >= priority(*e))

                printf("%c ",pop());

            push(*e);

        }

        e++;

    }

    while(top != -1)

    {

        printf("%c ",pop());

    }return 0;

}

Output:

Enter the expression: a*(b+c)-d

Postfix expression: a b c + * d –

Explanation of Code:

  1. As the program execution starts from the main(), in main() firstly we are reading expression in exp character array. Assigning this char array to pointer variable e.
  2. We are scanning the expression character by character and checking if the character is alphabet or a number then print that character to the screen.
  3. Next, we are checking if the character is ‘(‘then push it into the stack.
  4. If the character is ‘) ‘, then pop all elements from the stack and print them to the screen until we get ‘) ‘and remove the both parenthesis ‘(‘and ‘) ‘.
  5. Next checking is if the character is operator then check if priority of current operator is greater than top of stack element then push the current character into the stack. Else if, the priority of current operator is less than top of stack then pop all elements with higher priority from the stack, print them and then push current operator into the stack.
  6. Move to the next character and repeat the steps from 2 to 5 until the expression ends.
  7. Pop all elements from the stack and print them to console. This is the functionality of main().
  8. As we are using stack in this solution, we had to write the code for stack functionalities. Stack works on last in first out property and top is the pointer which points to the top element of stack.
  9. In push(), insert the element into the stack and increment the top by 1.
  10. In pop(), return the top most element and decrement the top by 1.
  11. Next priority(), returns the priority of operators.



ADVERTISEMENT
ADVERTISEMENT