pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.expressions.binary
Class TransitiveClosureExpression

java.lang.Object
  |
  +--pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.AbstractSyntaxTree
        |
        +--pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.Expression
              |
              +--pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.expressions.BinaryExpression
                    |
                    +--pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.expressions.NonAlgebraicExpression
                          |
                          +--pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.expressions.binary.TransitiveClosureExpression
All Implemented Interfaces:
java.io.Serializable

public class TransitiveClosureExpression
extends NonAlgebraicExpression

The TransitiveClosureExpression class represents the binary expression nodes in the abstract syntax tree.

Author:
Jakub Trzetrzelewski, jakub_trzetrzelewski@yahoo.com
See Also:
Serialized Form

Fields inherited from class pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.expressions.BinaryExpression
l, r
 
Constructor Summary
TransitiveClosureExpression(Expression l, Expression r, KeywordTerminal lk, KeywordTerminal rk)
          Creates a new binary expression node with the given expressions l and r and terminals lk and rk.
 
Method Summary
 java.lang.String getSpellingAndPosition()
          Returns the spelling and positions of all terminals in a node.
 java.lang.String getTypeAsString()
          Returns the abstract syntax tree node type as a string value.
 
Methods inherited from class pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.expressions.NonAlgebraicExpression
accept
 
Methods inherited from class pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.expressions.BinaryExpression
show
 
Methods inherited from class pl.edu.pjwstk.yaod.yaql.abstractsyntaxtree.AbstractSyntaxTree
getLongestTypeAsSpacesString, getPreparedTypeAsString, show
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

TransitiveClosureExpression

public TransitiveClosureExpression(Expression l,
                                   Expression r,
                                   KeywordTerminal lk,
                                   KeywordTerminal rk)
Creates a new binary expression node with the given expressions l and r and terminals lk and rk.
Parameters:
l - any expression.
r - any expression.
lk - keyword terminal.
rk - keyword terminal.
Method Detail

getTypeAsString

public java.lang.String getTypeAsString()
Returns the abstract syntax tree node type as a string value.
Overrides:
getTypeAsString in class AbstractSyntaxTree
Returns:
the abstract syntax tree node type as string.

getSpellingAndPosition

public java.lang.String getSpellingAndPosition()
Returns the spelling and positions of all terminals in a node.
Overrides:
getSpellingAndPosition in class AbstractSyntaxTree
Returns:
the spelling and positions of all terminals in a node.