Question: void infixToPostfix ( char * infix, char * postfix ) { int i , j; int top = - 1 ; char stack [ Max

void infixToPostfix(char* infix, char* postfix){ int i, j; int top =-1; char stack[Max_Length]; for (i =0, j =0; infix[i]!='\0'; i++){ if (isOperand(infix[i])){ postfix[j++]= infix[i]; } else if (infix[i]=='('){ stack[++top]= infix[i]; } else if (infix[i]==')'){ while (top !=-1 && stack[top]!='('){ postfix[j++]= stack[top--]; } top--; // Pop '(' from the stack } else { while (top !=-1 && precedence(infix[i])<= precedence(stack[top])){ postfix[j++]= stack[top--]; } stack[++top]= infix[i]; }} while (top !=-1){ postfix[j++]= stack[top--]; } postfix[j]='\0';}
I want you to modify that i can change from infix to postifx corrctly

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

Q:

booleanEvaluation.c #include #include #include #include #include "stack.h" #include "booleanEvaluation.h" #include "booleanWithError.h" /* evaluatePostfix* input: a postfix expression* output: T, F,...

Q:

I need to finish the function evaluatePostfix and postfixToInfix in the booleanEvaluation.c with the insutration that I post above. booleanEvaluation.c #include #include #include #include #include...

Q:

Write function infixToPostfix() for infix to postfix conversion c++; #include "linkedStack.h" void infixToPostfix(string str){ /* CODE HERE */ } int main(){ string str = "3+4*5"; cout

Q:

Total point: 15 Introduction: For this assignment you have to write a c program that will take an infix expression as input and display the postfix expression of the input. After converting the...

Q:

*** USING C*** Compile and run the program with optimization, but with profiling for timing: gcc -c -pg -O2 main.c gcc -c -pg -O2 bubbleSort.c gcc -c -pg -O2 quickSort.c gcc main.o bubbleSort.o...

Q:

void infixToPostfix ( char * infix, char * postfix ) { int i , j; int top = - 1 ; char stack [ Max _ Length ] ; for ( i = 0 , j = 0 ; infix [ i ] ! = ' \ 0 ' ; i + + ) { if ( isOperand ( infix [ i ]...

Q:

Infix to Prefix Expression Linked List Please kindly advise why my current output is not as per expected output and the possible solution: Write a function, in2preLL() to convert an infix expression...

Q:

computer security course, please I need help it due 3 hours. 1 Lab Overview The learning objective of this lab is for students to gain the first-hand experience on buffer-overflow vulner- ability by...

Q:

Files required LABYRINTH.JAVA import java.io.*; import java.util.*; import javax.swing.JFrame; import javax.swing.JPanel; /** * The Labyrinth class creates a window that shows a hexagon-tile based...

Q:

This program determines the winners at a particular talent competition. Your task: 1. Code review: read and understand this program (**** Please code this program in C language ***) 2. Call the...

Q:

Assume that Regal's manager invests in a $30,000 piece of equipment that increases sales by $35,000 while increasing operating expenses by $15,000. Regal Company reports the following: Net operating...

Q:

Austin has invested $25,000 as one of 10 limited partners in a large shopping center that was purchased for $800,000. The shopping center has been unsuccessful and the four general partners fear that...

Q:

How can you use the normal probability plot to evaluate whether a set of data is normally distributed?

Q:

The first scenario will be a Verbal Judo scenario in which your scenario follows the standard Verbal Judo interaction: You need to ask somebody to modify their behavior either to do something or to...

Q:

What are the risk management exposures revealed in the case? And, how might these be addressed?

Q:

Identify each of the parties affected by events reported in the case.

Q:

Is SHRD compatible with individual career aspirations