|
|||||||||||||||||||
| Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
| UnsignedShiftRightExpression.java | - | 0% | 0% | 0% |
|
||||||||||||||
| 1 | /* | |
| 2 | * DynamicJava - Copyright (C) 1999-2001 | |
| 3 | * | |
| 4 | * Permission is hereby granted, free of charge, to any person obtaining a | |
| 5 | * copy of this software and associated documentation files | |
| 6 | * (the "Software"), to deal in the Software without restriction, including | |
| 7 | * without limitation the rights to use, copy, modify, merge, publish, | |
| 8 | * distribute, sublicense, and/or sell copies of the Software, and to permit | |
| 9 | * persons to whom the Software is furnished to do so, subject to the | |
| 10 | * following conditions: | |
| 11 | * The above copyright notice and this permission notice shall be included | |
| 12 | * in all copies or substantial portions of the Software. | |
| 13 | * | |
| 14 | * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS | |
| 15 | * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF | |
| 16 | * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. | |
| 17 | * IN NO EVENT SHALL DYADE BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
| 18 | * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING | |
| 19 | * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER | |
| 20 | * DEALINGS IN THE SOFTWARE. | |
| 21 | * | |
| 22 | * Except as contained in this notice, the name of Dyade shall not be | |
| 23 | * used in advertising or otherwise to promote the sale, use or other | |
| 24 | * dealings in this Software without prior written authorization from | |
| 25 | * Dyade. | |
| 26 | * | |
| 27 | */ | |
| 28 | ||
| 29 | package koala.dynamicjava.tree; | |
| 30 | ||
| 31 | import koala.dynamicjava.tree.visitor.*; | |
| 32 | ||
| 33 | /** | |
| 34 | * This class represents the unsigned shift right expression nodes of the syntax tree | |
| 35 | * | |
| 36 | * @author Stephane Hillion | |
| 37 | * @version 1.0 - 1999/04/25 | |
| 38 | */ | |
| 39 | ||
| 40 | public class UnsignedShiftRightExpression extends BinaryExpression { | |
| 41 | /** | |
| 42 | * Initializes the expression | |
| 43 | * @param lexp the LHS expression | |
| 44 | * @param rexp the RHS expression | |
| 45 | * @exception IllegalArgumentException if lexp is null or rexp is null | |
| 46 | */ | |
| 47 | 0 | public UnsignedShiftRightExpression(Expression lexp, Expression rexp) { |
| 48 | 0 | this(lexp, rexp, SourceInfo.NONE); |
| 49 | } | |
| 50 | ||
| 51 | /** | |
| 52 | * Initializes the expression | |
| 53 | * @param lexp the LHS expression | |
| 54 | * @param rexp the RHS expression | |
| 55 | * @exception IllegalArgumentException if lexp is null or rexp is null | |
| 56 | */ | |
| 57 | 0 | public UnsignedShiftRightExpression(Expression lexp, Expression rexp, |
| 58 | SourceInfo si) { | |
| 59 | 0 | super(lexp, rexp, si); |
| 60 | } | |
| 61 | ||
| 62 | /** | |
| 63 | * Allows a visitor to traverse the tree | |
| 64 | * @param visitor the visitor to accept | |
| 65 | */ | |
| 66 | 0 | public <T> T acceptVisitor(Visitor<T> visitor) { |
| 67 | 0 | return visitor.visit(this); |
| 68 | } | |
| 69 | ||
| 70 | } |
|
||||||||||