Class ASTPtRelationalNode

  • All Implemented Interfaces:
    java.lang.Cloneable, Node

    public class ASTPtRelationalNode
    extends ASTPtRootNode
    The parse tree created from the expression string consists of a hierarchy of node objects. This class represents relational operator(>, ≥, <, ≤, ==, !=) nodes in the parse tree.

    Each node of this type has exactly two children. The resolved type is a BooleanToken.

    Since:
    Ptolemy II 0.2
    Version:
    $Id$
    Author:
    Neil Smyth
    See Also:
    ASTPtRootNode, PtParser, Token
    Pt.AcceptedRating:
    Red (cxh)
    Pt.ProposedRating:
    Yellow (nsmyth)
    • Field Detail

      • _lexicalToken

        protected Token _lexicalToken
    • Constructor Detail

      • ASTPtRelationalNode

        public ASTPtRelationalNode​(int id)
      • ASTPtRelationalNode

        public ASTPtRelationalNode​(PtParser p,
                                   int id)
    • Method Detail

      • getOperator

        public Token getOperator()
        Return the lexical token representing the operation of this node.
        Returns:
        the token that represents the operation of this node.
      • isCongruent

        public boolean isCongruent​(ASTPtRootNode node,
                                   java.util.Map renaming)
        Return true if this node is (hierarchically) congruent to the given node, under the given renaming of bound identifiers. Derived classes should extend this method to add additional necessary congruency checks.
        Overrides:
        isCongruent in class ASTPtRootNode
        Parameters:
        node - The node to compare to.
        renaming - A map from String to String that gives a renaming from identifiers in this node to identifiers in the given node.
        Returns:
        True if the node is congruent.