AST pattern matching with relaxed constraints

matchtest.groovy

    void testRelaxedBinaryExpressionWithConstrainedToken() {
        use(ASTMatcher) {
            def ast1 = macro { a + b }
            def ast2 = macro { a - b }
            def ast3 = macro { a * b }
            def ast4 = macro { a + c }
            def pattern = macro {
                a + b
            }.withConstraints {
                token {
                    type in [Types.PLUS, Types.MINUS]
                }
            }
            assert ast1.matches(pattern)
            assert ast2.matches(pattern)
            assert !ast3.matches(pattern)
            assert !ast4.matches(pattern)
        }
    }