Breaking News: Grepper is joining You.com. Read the official announcement!

infix to prefix converter algorithm in c

Troubled Tarsier answered on December 27, 2021 Popularity 8/10 Helpfulness 1/10

answer infix to prefix converter algorithm in c

infix to prefix converter algorithm in c

Comment

Step 1. Push “)” onto STACK, and add “(“ to end of the A
Step 2. Scan A from right to left and repeat step 3 to 6 for each element of A until the STACK is empty
Step 3. If an operand is encountered add it to B
Step 4. If a right parenthesis is encountered push it onto STACK
Step 5. If an operator is encountered then:
	 a. Repeatedly pop from STACK and add to B each operator (on the top of STACK) which has same 
        or higher precedence than the operator.
     b. Add operator to STACK
Step 6. If left parenthesis is encontered then
	 a. Repeatedly pop from the STACK and add to B (each operator on top of stack until a left parenthesis is encounterd)
	 b. Remove the left parenthesis
Step 7. Exit

Popularity 8/10 Helpfulness 1/10 Language whatever

Source: scanftree.com

Tags: algorithm c converter prefix whatever

Link to this answer
Share Copy Link

Contributed on Dec 27 2021

Troubled Tarsier

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

infix to prefix converter algorithm in c

Contents

More Related Answers

infix to prefix converter algorithm in c

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.