Conversion of Infix to Postfix Notation lab program

 #include<stdio.h>

#include<ctype.h>

char stack[20];

int top = -1;

void push(char);

char pop();

int precedence(char);

int main()

{

char infix[20],postfix[20];

int i,j=0;

printf("Enter an Infix expression:-\t");

gets(infix);

for (i = 0 ; infix[i] != '\0' ; i++)

{

if(isalnum(infix[i]))

{

postfix[j] = infix[i];

j++;

}

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

push(infix[i]);

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

{

while(stack[top] != '(')

{

postfix[j] = pop();

j++;

}

pop();

}

else

{

while((top != -1 && stack[top] != '(') && (precedence(stack[top]) >= precedence(infix[i])))

{

postfix[j] = pop();

j++;

}

push(infix[i]);

}

}

while(top != -1)

{

postfix[j] = pop();

j++;

}

postfix[j] = '\0';

printf("PostFix Expression = %s\n",postfix);

return 0;

}

void push(char c)

{

top++;

stack[top] = c;

}

char pop()

{

char c;

c = stack[top];

top--;

return c;

}

int precedence(char c)

{

switch(c)

{

case '+': 

case '-': return 1;

case '*':

case '/': return 2;

}

}


Comments

Post a Comment

Popular posts from this blog

Data Structures UNIT-1 Chapter-1

Image
  Unit 1 Algorithm Analysis:- Algorithm Analysis : Introduction to Algorithm, Algorithm Analysis, Asymptotic Notations. Introduction to arrays and Abstract Data Type (ADT) Lists : List using arrays and linked list- Singly Linked List, Doubly Linked List, Circular Linked List. Introduction to Algorithm Algorithm Definition: - An algorithm is a set of instructions that are used to solve a problem. (Or) An algorithm is a Step By Step process to solve a problem, where each step indicates an intermediate task. Algorithm contains finite number of steps that leads to the solution of the problem. Properties/Characteristics of an algorithm:- Algorithm has the following basic properties 1. Input: - An algorithm has zero (0) or more inputs. 2. Output: - An algorithm must produce one (1) or more outputs. 3. Finiteness:- An algorithm must contain a finite/countable number of steps. 4. Definiteness: - Each step of an algorithm must be stated clearly and unambiguously. 5.
Read more

Unit-2 chapter-1 STACKS AND ITS APPLICTIONS

                                                  UNIT-2                                     STACKS and QUEUES     Unit-II: Stacks and Queues Stacks: The Stack: Definition, operations, implementation using arrays, linked list and Stack applications: Infix to postfix expression conversion, Evaluation of Postfix expressions, balancing the symbols. Queue: definition, operations, implementation using arrays, linked list&it’sApplications. Circular queue : Definition &its operations, implementation, Dequeue : definition & its types, implementation. Learning Material Stack is a linear data structure. Stack can be defined as a collection of homogeneous elements, where insertion and deletion operations takes place at only one end called TOP . The insertion operation is termed as PUSH and deletion operation is termed as POP
Read more

Single linked List Lab program

 #include<stdio.h> #include<stdlib.h> struct node {     int data;     struct node *link; }; struct node *root=NULL; void create() {  struct node *second,*third,*fourth,*fifth;  clrscr();  root=malloc(sizeof(struct node));  second=malloc(sizeof(struct node));  third=malloc(sizeof(struct node));  fourth=malloc(sizeof(struct node));  fifth=malloc(sizeof(struct node));  root->data=10;  second->data=20;  third->data=30;  fourth->data=40;  fifth->data=50;  root->link=second;  second->link=third;  third->link=fourth; fourth->link=fifth; fifth->link=NULL; } void addFirst(int val) { struct node *temp=malloc(sizeof(struct node)); temp->data=val; temp->link=root; root=temp; printf("new node is inserted at beginning"); } void addEnd(int val) { struct node *temp=malloc(sizeof(struct node)); temp->data=val; temp->link=NULL; if(root==NULL) { root=temp; } else { struct node *p; p=root; while(p->link!=NULL) { p=p->link; } p->link=
Read more