Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have this, I built it programmatically:
(( cat1:bobo AND ( ( cat2:jojo ) OR ( cat2:coco ) ) ))
For the sake of debugging, I am looking for a good method that would basically reduce it to least amount of parens needed:
cat1:bobo AND ( cat2:jojo OR cat2:coco )
I’m on C#, but if you have a good technique you’ve seen, I will port it.
Assuming you’re parsing the expression into some sort of tree structure, then the approach I’ve taken in the past is just to navigate through the tree and remove any nodes that are just a container for other nodes.