You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
39 lines
1.3 KiB
39 lines
1.3 KiB
/*
|
|
* @(#)BinaryOperatorDeclaration.java 2.1 2003/10/07
|
|
*
|
|
* Copyright (C) 1999, 2003 D.A. Watt and D.F. Brown
|
|
* Dept. of Computing Science, University of Glasgow, Glasgow G12 8QQ Scotland
|
|
* and School of Computer and Math Sciences, The Robert Gordon University,
|
|
* St. Andrew Street, Aberdeen AB25 1HG, Scotland.
|
|
* All rights reserved.
|
|
*
|
|
* This software is provided free for educational use only. It may
|
|
* not be used for commercial purposes without the prior written permission
|
|
* of the authors.
|
|
*/
|
|
|
|
package triangle.abstractSyntaxTrees.declarations;
|
|
|
|
import triangle.abstractSyntaxTrees.terminals.Operator;
|
|
import triangle.abstractSyntaxTrees.types.TypeDenoter;
|
|
import triangle.abstractSyntaxTrees.visitors.DeclarationVisitor;
|
|
import triangle.syntacticAnalyzer.SourcePosition;
|
|
|
|
public class BinaryOperatorDeclaration extends Declaration {
|
|
|
|
public BinaryOperatorDeclaration(Operator oAST, TypeDenoter arg1AST, TypeDenoter arg2AST, TypeDenoter resultAST,
|
|
SourcePosition position) {
|
|
super(position);
|
|
O = oAST;
|
|
ARG1 = arg1AST;
|
|
ARG2 = arg2AST;
|
|
RES = resultAST;
|
|
}
|
|
|
|
public <TArg, TResult> TResult visit(DeclarationVisitor<TArg, TResult> v, TArg arg) {
|
|
return v.visitBinaryOperatorDeclaration(this, arg);
|
|
}
|
|
|
|
public final Operator O;
|
|
public final TypeDenoter ARG1, ARG2, RES;
|
|
}
|
|
|