Scribd
Upload
14 views2 pages

Infix to Postfix Converter in Java

This document contains code for a program that converts an infix mathematical expression to postfix notation. It uses a stack to evaluate operator precedence as it iterates through the infix string. If the character is an operand, it is added to the postfix string. If it is an operator, it is pushed onto the stack or popped off and added to postfix based on comparing its precedence to the top of the stack. Once complete, the postfix string is printed out.

Uploaded by

Chime Rosu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
14 views2 pages

Infix to Postfix Converter in Java

This document contains code for a program that converts an infix mathematical expression to postfix notation. It uses a stack to evaluate operator precedence as it iterates through the infix string. If the character is an operand, it is added to the postfix string. If it is an operator, it is pushed onto the stack or popped off and added to postfix based on comparing its precedence to the top of the stack. Once complete, the postfix string is printed out.

Uploaded by

Chime Rosu
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

package Tugasfix; import [Link]; import [Link].

Stack; public class InfixToPostfix { private String infix; private String postfix = ""; public void convertString(String a){ String str = ""; infix = a; Stack<String> stack = new Stack<String>(); for(int i = 0; i < [Link](); i++){ str = [Link](i,i+1); if([Link]("[a-zA-Z]|\\d")) postfix += str; else if (isOperator(str)){ if ([Link]()){ [Link](str); } else{ String stackTop = [Link](); while (getPrecedence(stackTop,str).equals(stackTop)&& !(stack. isEmpty())){ postfix += [Link](); if (!([Link]())) stackTop = [Link](); } [Link](str); } } } while(!([Link]())) postfix += [Link](); [Link]("Maka Expressi dari bentuk postfix-nya adalah " + postfix); [Link]();[Link](); [Link](" created by Amtsal Assakafhy"); } private boolean isOperator(String ch){ String operators = "*/%+-"; if ([Link](ch) != -1) return true; else return false; } private String getPrecedence(String op1, String op2){ String multiplicativeOps = "*/%"; String additiveOps = "+-"; if (([Link](op1) != -1) && ([Link](o p2) != -1)) return op1; else if (([Link](op2) != -1) && ([Link] xOf(op1) != -1)) return op2; else if(([Link](op1) != -1) && (multiplicativeOps .indexOf(op2) != -1))

return op1; else return op1; } public static void main(String[] args) { [Link]("Masukkan expressi dari bentuk infix:"); Scanner scanner = new Scanner([Link]); String expression = [Link](); new InfixToPostfix().convertString(expression); } }

You might also like