evaluate boolean values in Java

I am trying to evaluate the following from a string

boolean value = evaluate("false || true && true && false || true");

I need to get a boolean value of true for this one.

A开发者_开发知识库ny ideas on how to solve this problem in the most efficient way?

---

String value = ("false || true && true && false || true");
boolean result = false;
for (String conj : value.split("\\|\\|")) {
    boolean b = true;
    for (String litteral : conj.split("&&"))
        b &= Boolean.parseBoolean(litteral.trim());
    result |= b;
}
System.out.println(result); // prints true

---

If the only operators are && and ||, then I think this will work:

  static boolean eval(String str) {
    String s = str.replaceAll("\\s|\\|\\|false|false\\|\\|", "");
    return !s.contains("false") || s.contains("||true");
  }

For more complicated expressions, I found this library just for that. Don't know how efficient it is though.

---

You'll need a small boolean expressions grammar. A bit of recursive parsing should do the trick.

If you don't know how to write such a parser, you may use JavaCC or something similar.

---

there are parsergenerators available for which you can define a grammar.

But if you only got || and && as operators and true and false as values you can easily do this by yourself, by implmenting a very simple finite state machine:

1.) Split the string into the tokens

2.) parse the left most value by using Boolean.parseBoolean(token) and safe it's value in some instance variable (your state)

3.) combine your instance variable with the next boolean token using the given operator

4.) Repeat step3 until you finished through the whole string

This seems to work although i havent thorougly tested it :)

public class BooleanFSParser {

    private boolean parse(String data) {
        String[] tokens=data.split("\\s");
        boolean state=Boolean.parseBoolean(tokens[0]);
        for (int i=1;i<(tokens.length / 2) + 1;i=i+2){
            if (tokens[i].equals("&&")){
                state=state && Boolean.parseBoolean(tokens[i+1]);
            }else{
                state=state || Boolean.parseBoolean(tokens[i+1]);
            }
        }
        return state;
    }

    public static void main(String[] args) {
        BooleanFSParser parser = new BooleanFSParser();
        boolean val = parser.parse("true && true || false");
        System.out.println(String.valueOf(val));
    }
}

thats should give you a cirrectly parsed value, but it will get a bit more complex if you allow brackets for example ;)

have fun and check here for the theory Finite-state_machine