Replies: 2 comments 2 replies
-
|
All your examples are "or" operations. Does this mean you interpret "p and q or r" as [F, T]? |
Beta Was this translation helpful? Give feedback.
-
|
Yes. I follow BODMAS, the precedence of bracket and multiplication and addition here. So, it will be resolved like, (p and q) or r which results in [F, T]. The second value in tuple would be 1, if I'm looking for exactly one boolean to be True. |
Beta Was this translation helpful? Give feedback.
-
|
Also, what is the significance of the second element (the integer) in each of your example tuples? |
Beta Was this translation helpful? Give feedback.
-
|
The second element is the count of TRUE booleans, I am expecting in the expression. For example, ("p or q or r", 2) is True, has two True's and one False, so it evaluates to True. |
Beta Was this translation helpful? Give feedback.
Uh oh!
There was an error while loading. Please reload this page.
-
Hello there
I am trying to build a parser following this example. But how would I go about implementing say count of Booleans in my matches?
As you can see, I am interested in counting booleans in the last level while resolving.
Beta Was this translation helpful? Give feedback.
All reactions