in reply to Re^7: Parsing Boolean expressions (hack)
in thread Parsing Boolean expressions
(Back from walking the dog.) If you need to worry about and/or precedence, you can do essentially the same thing for ands (with left associativity if you scan from left to right). But sometimes formal logic people require expressions to be fully parenthesized (as the OP's are), so you might not need to. Yes, I see that you got precedence and associativity for free and I didn't.