Suppose there is such an expression tree

 
Expression Expression1=c=& gt; (c.I d & gt; 5 & amp; & C.N ame. The Contains (" asdd ") | | (c.I d==1 | | c.I d==2). 

Now the expression c.I d & gt; 5, from ame. The Contains (" asdd ") this kind of has been parsed out do not have what problem

The key is how can the circle enclosed in parentheses "()" also parse out, otherwise such a condition, express not to come out of the original meaning

CodePudding user response:

Top that is too little????????????????????

CodePudding user response:

This is not need to parse parentheses, you need is you to recursive analytic expression tree (left, right)
And if it's not very special demand in particular, do not recommend their analytic expression tree, if the bracket is problem, believe that my question to you dare not imagine

CodePudding user response:

May be I think this is easy, I'm inherited ExpressionVisitor recursion, at first I was simply to get a put Stack Take out, the last time with respect to OK, but such a figure, the circular arc brackets don't come out;