Scribd
Upload
159 views4 pages

Program-8: AIM: Program To Convert Infix Expression To Postfix Expression. Description

The document describes a program to convert an infix expression to a postfix expression. It defines infix and postfix expressions, with infix having the operator between operands and postfix having the operator after operands. It then provides code to implement a stack to perform the conversion, including functions to create and manipulate the stack, check for operands/operators, and compare operator precedence. The main function takes an infix expression as input and uses the stack to output the equivalent postfix expression.

Uploaded by

Ajay Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
159 views4 pages

Program-8: AIM: Program To Convert Infix Expression To Postfix Expression. Description

The document describes a program to convert an infix expression to a postfix expression. It defines infix and postfix expressions, with infix having the operator between operands and postfix having the operator after operands. It then provides code to implement a stack to perform the conversion, including functions to create and manipulate the stack, check for operands/operators, and compare operator precedence. The main function takes an infix expression as input and uses the stack to output the equivalent postfix expression.

Uploaded by

Ajay Kumar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

PROGRAM-8

AIM: Program to convert infix expression to postfix expression.


DESCRIPTION:
Infix expression: The expression of the form a op b. When an operator is in-between every
pair of operands.
Postfix expression: The expression of the form a b op. When an operator is followed for
every pair of operands.
CODE:

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

struct Stack
{
int top;
unsigned capacity;
int* array;
};

struct Stack* createStack( unsigned capacity )


{
struct Stack* stack = (struct Stack*) malloc(sizeof(struct Stack));

if (!stack)
return NULL;

stack->top = -1;
stack->capacity = capacity;

stack->array = (int*) malloc(stack->capacity * sizeof(int));

if (!stack->array)
return NULL;
return stack;
}
int isEmpty(struct Stack* stack)
{
return stack->top == -1 ;

10 | 2 k 1 8 / S E / 0 1 4
}
char peek(struct Stack* stack)
{
return stack->array[stack->top];
}
char pop(struct Stack* stack)
{
if (!isEmpty(stack))
return stack->array[stack->top--] ;
return '$';
}
void push(struct Stack* stack, char op)
{
stack->array[++stack->top] = op;
}

int isOperand(char ch)


{
return (ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z');
}

int Prec(char ch)


{
switch (ch)
{
case '+':
case '-':
return 1;

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

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

int infixToPostfix(char* exp)


{
int i, k;

11 | 2 k 1 8 / S E / 0 1 4
struct Stack* stack = createStack(strlen(exp));
if(!stack)
return -1 ;

for (i = 0, k = -1; exp[i]; ++i)


{
if (isOperand(exp[i]))
exp[++k] = exp[i];

else if (exp[i] == '(')


push(stack, exp[i]);

else if (exp[i] == ')')


{
while (!isEmpty(stack) && peek(stack) != '(')
exp[++k] = pop(stack);
if (!isEmpty(stack) && peek(stack) != '(')
return -1;
else
pop(stack);
}
else
{
while (!isEmpty(stack) && Prec(exp[i]) <= Prec(peek(stack)))
exp[++k] = pop(stack);
push(stack, exp[i]);
}

while (!isEmpty(stack))
exp[++k] = pop(stack );

exp[++k] = '\0';
printf( "%s", exp );
}

int main()
{
char exp[] = "a*b+c^d*e-f";
infixToPostfix(exp);
return 0;

12 | 2 k 1 8 / S E / 0 1 4
}
}
new_node->data = new_data;

new_node->next = (*top_ref);

(*top_ref) = new_node;
}

int pop(struct sNode** top_ref)


{
char res;
struct sNode *top;

if (*top_ref == NULL)
{
printf("Stack overflow n");
getchar();
exit(0);
}
else
{
top = *top_ref;
res = top->data;
*top_ref = top->next;
free(top);
return res;
}
}

OUTPUT:

13 | 2 k 1 8 / S E / 0 1 4

You might also like