diff options
| author | ajreynol <andrew.j.reynolds@gmail.com> | 2017-03-07 09:11:33 -0600 |
|---|---|---|
| committer | ajreynol <andrew.j.reynolds@gmail.com> | 2017-03-07 09:11:33 -0600 |
| commit | 105cae4ed94f0ce13b0525a348b29d2fc7d5af72 (patch) | |
| tree | 132f32f7d63410064c0dff735a62fc5040ee5877 /src/parser/cvc/Cvc.g | |
| parent | 9b7af3ef07120280d0ef4acd94f9de9e90a2b7b0 (diff) | |
Fix cvc parser for set compliment.
Diffstat (limited to 'src/parser/cvc/Cvc.g')
| -rw-r--r-- | src/parser/cvc/Cvc.g | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/parser/cvc/Cvc.g b/src/parser/cvc/Cvc.g index 0655359a9..267fe303e 100644 --- a/src/parser/cvc/Cvc.g +++ b/src/parser/cvc/Cvc.g @@ -441,7 +441,6 @@ Expr createPrecedenceTree(Parser* parser, ExprManager* em, Expr rhs = createPrecedenceTree(parser, em, expressions, operators, pivot + 1, stopIndex); switch(k) { - case kind::NOT : if(lhs.getType().isSet()) { k = kind::COMPLIMENT; } break; case kind::LEQ : if(lhs.getType().isSet()) { k = kind::SUBSET; } break; case kind::MINUS : if(lhs.getType().isSet()) { k = kind::SETMINUS; } break; case kind::BITVECTOR_AND: if(lhs.getType().isSet()) { k = kind::INTERSECTION; } break; @@ -449,7 +448,7 @@ Expr createPrecedenceTree(Parser* parser, ExprManager* em, default: break; } Expr e = em->mkExpr(k, lhs, rhs); - return negate ? em->mkExpr(kind::NOT, e) : e; + return negate ? em->mkExpr(e.getType().isSet() ? kind::COMPLIMENT : kind::NOT, e) : e; }/* createPrecedenceTree() recursive variant */ Expr createPrecedenceTree(Parser* parser, ExprManager* em, @@ -475,8 +474,9 @@ Expr createPrecedenceTree(Parser* parser, ExprManager* em, /** Add n NOTs to the front of e and return the result. */ Expr addNots(ExprManager* em, size_t n, Expr e) { + Kind k = e.getType().isSet() ? kind::COMPLIMENT : kind::NOT; while(n-- > 0) { - e = em->mkExpr(kind::NOT, e); + e = em->mkExpr(k, e); } return e; }/* addNots() */ |