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.
35 lines
1.1 KiB
35 lines
1.1 KiB
/*
|
|
* @(#)UnaryExpression.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.expressions;
|
|
|
|
import triangle.abstractSyntaxTrees.terminals.Operator;
|
|
import triangle.abstractSyntaxTrees.visitors.ExpressionVisitor;
|
|
import triangle.syntacticAnalyzer.SourcePosition;
|
|
|
|
public class UnaryExpression extends Expression {
|
|
|
|
public UnaryExpression(Operator oAST, Expression eAST, SourcePosition position) {
|
|
super(position);
|
|
O = oAST;
|
|
E = eAST;
|
|
}
|
|
|
|
public <TArg, TResult> TResult visit(ExpressionVisitor<TArg, TResult> v, TArg arg) {
|
|
return v.visitUnaryExpression(this, arg);
|
|
}
|
|
|
|
public final Expression E;
|
|
public final Operator O;
|
|
}
|
|
|