com.sun.msv.grammar.ConcurExp Maven / Gradle / Ivy
/*
* Copyright (c) 2001-2013 Oracle and/or its affiliates. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* - Neither the name of Oracle nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package com.sun.msv.grammar;
/**
* <concur> pattern of TREX.
*
* None of the other language needs this expression.
* So application can deny processing this expression if neceesary,
* without hampering the multi-schema-ness.
*
* @author Kohsuke KAWAGUCHI
*/
public final class ConcurExp extends BinaryExp {
ConcurExp( Expression left, Expression right ) {
super(left,right);
}
public Object visit( ExpressionVisitor visitor ) {
return visitor.onConcur(this);
}
public Expression visit( ExpressionVisitorExpression visitor ) {
return visitor.onConcur(this);
}
public boolean visit( ExpressionVisitorBoolean visitor ) {
return visitor.onConcur(this);
}
public void visit( ExpressionVisitorVoid visitor ) {
visitor.onConcur(this);
}
protected boolean calcEpsilonReducibility() {
return exp1.isEpsilonReducible() && exp2.isEpsilonReducible();
}
// serialization support
private static final long serialVersionUID = 1;
}