I am confused about why it is not breaking a string? my exp string array does not contain anything when I debug that this split is wrong, what I'm trying to do is break up a very simple expression like 1 + 2 + 3 and then parse the values by making a calculator.
EDIT
Hello, why am I splitting into each character, because I am doing a calculator and reading something about converting an infix to a postfix, so I need to split the line and then skip each line and perform the check as shown below, however, when I debug , it shows that exp [] is empty
For each token in turn in the input infix expression:
* If the token is an operand, append it to the postfix output.
* If the token is an operator A then:
o While there is an operator B of higher or equal precidence than A at the top of the stack, pop B off the stack and append it to the output.
o Push A onto the stack.
* If the token is an opening bracket, then push it onto the stack.
* If the token is a closing bracket:
o Pop operators off the stack and append them to the output, until the operator at the top of the stack is a opening bracket.
o Pop the opening bracket off the stack.
When all the tokens have been read:
* While there are still operator tokens in the stack:
o Pop the operator on the top of the stack, and append it to the output.
public class Main {
public static void main(String[] args) {
calcExpChecker calc = new calcExpChecker("1+2+3+4");
calc.legitExp();
calc.displayPostfix();
}
}
package javaapplication4;
import java.util.*;
public class calcExpChecker {
private String originalExp;
private boolean isItLegitExp;
private boolean isItBlank;
private StringBuilder expression = new StringBuilder(50);
private Stack stack = new Stack();
calcExpChecker(String original)
{
originalExp = original;
}
public void isitBlank()
{
if(originalExp.equals(""))
{
isItBlank = true;
}
else
{
isItBlank = false;
}
}
public void legitExp()
{
String[] exp = originalExp.split(".");
for(int i = 0 ; i < exp.length ; i++)
{
if(exp[i].matches("[0-9]"))
{
expression.append(exp[i]);
}
else if(exp[i].matches("[+]"))
{
if(stack.empty())
{
stack.push(exp[i]);
}
else
{
while(stack.peek().equals("+"))
{
expression.append(stack.pop());
}
stack.push(exp[i]);
}
}
if (!stack.empty())
{
expression.append(stack.pop());
}
}
}
public void displayPostfix()
{
System.out.print(expression.toString());
}
}
sutoL source
share