Home/ Questions/Q 9158111
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-17T13:10:27+00:00

I’m looking for a solution to represent boolean algebra. Let’s say I have a

  • 0

I’m looking for a solution to represent boolean algebra.
Let’s say I have a lot of String objects that I’m displaying to the user. He can now multi-select them (make an && AND connection between them), and also make || OR connections. The final expression should also be shown to the user.

So, eg if he selects String1, String2, String3 I want to present String1 && String2 && String3. And maybe lateron the user should be able to build expressions like (String1 || String 2) && String 3.

My question is: how could I track reference on these boolean selections between the string objects?
Of course I could just create a String expression; and always append what he selected. But what if he deselects an object? Then I would have to parse the whole string an revaluate it.

I’m searching for something to keep a AND/OR reference between the objects and then having a method to build the String final expression based on these.

Any ideas are welcome!

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    It sounds like you just need a tree structure. Every inner node represents an operator (&&, ||, etc.), and every leaf node represents a term.

    See also: abstract syntax tree

    • 0