Uses of Class
laser.regularlanguage.regularexpression.TreeNode

Packages that use TreeNode
laser.regularlanguage.regularexpression Contains classes and interfaces for creating and manipulating regular expressions (REs). 
laser.regularlanguage.regularexpression.parser Provides classes for lexing and parsing (regular) expressions.
 
laser.regularlanguage.regularexpression.reparser Provides classes for lexing and parsing REs. 
laser.regularlanguage.regularexpression.util Utility classes commonly useful for REs.
 
laser.regularlanguage.util Utility classes commonly useful for regular languages (RLs). 
 

Uses of TreeNode in laser.regularlanguage.regularexpression
 

Subclasses of TreeNode in laser.regularlanguage.regularexpression
 class BinaryTreeNode<L extends LabelInterface>
          The BinaryTreeNode class represents a TreeNode with two children.
 class ChoiceNode<L extends LabelInterface>
          ChoiceNode represents a choice between two regular expressions, meaning either the first or second expression occurs.
 class ClassSetNode<L extends LabelInterface>
          ClassSetNode is a leaf node in the Regular Expression Parse Tree representing a set of labels, meaning a choice between any label in the set.
 class ConcatenationNode<L extends LabelInterface>
          ConcatenationNode represents the Concatenation of two regular expressions, meaning the first expression occurs then the second expression occurs.
 class DotNode<L extends LabelInterface>
          DotNode is a leaf node in the Regular Expression representing a wildcard, meaning a choice among any label.
 class EmptyNode<L extends LabelInterface>
          EmptyNode represents the empty language.
 class EpsilonNode<L extends LabelInterface>
          LabelNode is a leaf node in the Regular Expression representing an event.
 class ExponentNode<L extends LabelInterface>
          ExponentNode represents an Exponent (^) in the regular expression.
 class KleenePlusNode<L extends LabelInterface>
          KleenePlusNode represents a Kleene Plus (+) in the regular expression, meaning the expression occurs one or more times.
 class KleeneStarNode<L extends LabelInterface>
          KleeneStarNode represents a Kleene Star (*) in the regular expression, meaning the expression occurs zero or more times.
 class LabelNode<L extends LabelInterface>
          LabelNode is a leaf node in the Regular Expression representing an event.
 class NotClassSetNode<L extends LabelInterface>
          NotClassSetNode is a node in the Regular Expression representing the negation of a set of labels, meaning a choice between any label not in the set.
 class OptionNode<L extends LabelInterface>
          OptionNode represents an Option (?) in the regular expression parse tree, meaning the expression can occur 0 or 1 times.
 class UnaryTreeNode<L extends LabelInterface>
          The UnaryTreeNode class represents a TreeNode with a single child.
 

Methods in laser.regularlanguage.regularexpression that return TreeNode
abstract  TreeNode<L> TreeNode.copyTree()
          Returns a copy of the Tree rooted at this node.
 TreeNode<L> UnaryTreeNode.getChild()
          Gets the child of this node.
 TreeNode<L> BinaryTreeNode.getLeftChild()
          Gets the left child of this node.
 TreeNode<L> RE.getRegularExpression()
          Gets the regular expression.
 TreeNode<L> BinaryTreeNode.getRightChild()
          Gets the right child of this node.
 

Methods in laser.regularlanguage.regularexpression that return types with arguments of type TreeNode
 java.util.List<TreeNode<L>> UnaryTreeNode.getChildren()
          Returns a List of the children of this TreeNode.
abstract  java.util.List<TreeNode<L>> TreeNode.getChildren()
          Returns a List of the children of this TreeNode.
 java.util.List<TreeNode<L>> NotClassSetNode.getChildren()
          Returns a List of the children of this TreeNode.
 java.util.List<TreeNode<L>> LabelNode.getChildren()
          Returns a List of the children of this TreeNode.
 java.util.List<TreeNode<L>> EpsilonNode.getChildren()
          Returns a List of the children of this TreeNode.
 java.util.List<TreeNode<L>> EmptyNode.getChildren()
          Returns a List of the children of this TreeNode.
 java.util.List<TreeNode<L>> DotNode.getChildren()
          Returns a List of the children of this TreeNode.
 java.util.List<TreeNode<L>> ClassSetNode.getChildren()
          Returns a List of the children of this TreeNode.
 java.util.List<TreeNode<L>> BinaryTreeNode.getChildren()
          Returns a List of the children of this TreeNode.
 java.util.Set<TreeNode<L>> RE.getUniqueTerms()
          Returns the Set of unique terms in this RE.
 

Methods in laser.regularlanguage.regularexpression with parameters of type TreeNode
 RE<L> REFactory.createRE(AlphabetInterface<L> alphabet, TreeNode<L> rootNode, java.lang.Object... args)
          Creates a new RE with the given alphabet and regular expression.
 RE<L> DefaultREFactory.createRE(AlphabetInterface<L> alphabet, TreeNode<L> rootNode, java.lang.Object... args)
          Creates a new RE with the given alphabet and regular expression.
 boolean UnaryTreeNode.equalsTree(TreeNode<L> node2)
          Returns true if the tree rooted at this node and the tree rooted at the given node are equal and false otherwise.
 boolean TreeNode.equalsTree(TreeNode<L> node2)
          Returns true if the tree rooted at this node and the tree rooted at the given node are equal and false otherwise.
 boolean NotClassSetNode.equalsTree(TreeNode<L> node2)
          Returns true if the tree rooted at this node and the tree rooted at the given node are equal and false otherwise.
 boolean LabelNode.equalsTree(TreeNode<L> node2)
          Returns true if the tree rooted at this node and the tree rooted at the given node are equal and false otherwise.
 boolean ExponentNode.equalsTree(TreeNode<L> node2)
          Returns true if the tree rooted at this node and the tree rooted at the given node are equal and false otherwise.
 boolean ClassSetNode.equalsTree(TreeNode<L> node2)
          Returns true if the tree rooted at this node and the tree rooted at the given node are equal and false otherwise.
 boolean BinaryTreeNode.equalsTree(TreeNode<L> node2)
          Returns true if the tree rooted at this node and the tree rooted at the given node are equal and false otherwise.
 

Constructors in laser.regularlanguage.regularexpression with parameters of type TreeNode
BinaryTreeNode(TreeNode<L> leftChild, TreeNode<L> rightChild)
          Creates a new BinaryTreeNode with the given children.
BinaryTreeNode(TreeNode<L> leftChild, TreeNode<L> rightChild)
          Creates a new BinaryTreeNode with the given children.
ChoiceNode(TreeNode<L> left, TreeNode<L> right)
          Creates a new ChoiceNode
ChoiceNode(TreeNode<L> left, TreeNode<L> right)
          Creates a new ChoiceNode
ConcatenationNode(TreeNode<L> left, TreeNode<L> right)
          Creates a new ConcatenationNode
ConcatenationNode(TreeNode<L> left, TreeNode<L> right)
          Creates a new ConcatenationNode
ExponentNode(TreeNode<L> child, Exponent exponent)
          Creates a new ExponentNode
KleenePlusNode(TreeNode<L> child)
          Creates a new KleenePlusNode
KleeneStarNode(TreeNode<L> child)
          Creates a new KleeneStarNode
OptionNode(TreeNode<L> child)
          Creates a new OptionNode
RE(REFactory<L> reFactory, AlphabetInterface<L> alphabet, TreeNode<L> re)
          Creates a new RE PRECONDITION: The regular expression must use only labels in the given alphabet.
UnaryTreeNode(TreeNode<L> child)
          Creates a new UnaryTreeNode with the given child.
 

Uses of TreeNode in laser.regularlanguage.regularexpression.parser
 

Methods in laser.regularlanguage.regularexpression.parser that return TreeNode
 TreeNode RegularExpressionParser.classSet()
          classSet := ( LBRACKET labelList RBRACKET | TILDE LBRACKET labelList RBRACKET ) A ClassSet is either a choice between a list of events (the rule without with TILDE), or a choice between a list of events that can't occur (the rule with the TILDE).
 TreeNode RegularExpressionParser.expression()
          expression := term (CHOICE term)* A regular expression is a list of terms separarated by the CHOICE operator.
 TreeNode RegularExpressionParser.leafExpression()
          leafExpression := ( DOT | label | classSet | LPAREN expression RPAREN | EPSILON )
 TreeNode RegularExpressionParser.modifiedExpression()
          modifiedExpression := expression (modifier)?
 TreeNode RegularExpressionParser.modifier(TreeNode expression_)
          modifier := ( KLEENESTAR | KLEENEPLUS | OPTION | EXPONENT exponent ) A modifier to a regular expression.
 TreeNode RegularExpressionParser.regularExpression(AlphabetInterface alphabet)
          regularExpression := EMPTY | expression A regular expression is either empty or an expression.
 TreeNode RegularExpressionParser.term()
          term := modifiedExpression (CONCAT modifiedExpression)* A Term is a list of ModifiedExpressions separated by the CONCAT operator.
 

Methods in laser.regularlanguage.regularexpression.parser with parameters of type TreeNode
 TreeNode RegularExpressionParser.modifier(TreeNode expression_)
          modifier := ( KLEENESTAR | KLEENEPLUS | OPTION | EXPONENT exponent ) A modifier to a regular expression.
 

Uses of TreeNode in laser.regularlanguage.regularexpression.reparser
 

Methods in laser.regularlanguage.regularexpression.reparser that return TreeNode
 TreeNode REParser.classSet()
           
 TreeNode REParser.expression()
           
 TreeNode REParser.leafExpression()
           
 TreeNode REParser.modifiedExpression()
           
 TreeNode REParser.modifier(TreeNode expression_)
           
 TreeNode REParser.regularExpression(AlphabetInterface alphabet)
           
 TreeNode REParser.term()
           
 

Methods in laser.regularlanguage.regularexpression.reparser with parameters of type TreeNode
 TreeNode REParser.modifier(TreeNode expression_)
           
 

Uses of TreeNode in laser.regularlanguage.regularexpression.util
 

Methods in laser.regularlanguage.regularexpression.util that return TreeNode
protected  TreeNode<L> AbstractREConverter.convert(TreeNode<L> oldTreeNode)
          Converts from the old TreeNode into the corresponding new TreeNode.
protected  TreeNode<L> StringREtoREConverter.convert(TreeNode<StringLabel> inNode)
          Converts from the given input TreeNode that uses StringLabels to the corresponding output TreeNode that uses the specified Labels.
 TreeNode<L> StringREtoREConverter.convert(TreeNode<StringLabel> inRE, AlphabetInterface<L> theAlphabet)
          Converts from the given input RE that uses StringLabels to the corresponding output RE that uses the specified Labels.
 TreeNode<L> StringREtoREConverter.getResult()
          Gets the result as a TreeNode.
 TreeNode<L> AbstractREConverter.getResult()
          Gets the result as a TreeNode.
 

Methods in laser.regularlanguage.regularexpression.util with parameters of type TreeNode
protected  TreeNode<L> AbstractREConverter.convert(TreeNode<L> oldTreeNode)
          Converts from the old TreeNode into the corresponding new TreeNode.
protected  TreeNode<L> StringREtoREConverter.convert(TreeNode<StringLabel> inNode)
          Converts from the given input TreeNode that uses StringLabels to the corresponding output TreeNode that uses the specified Labels.
 TreeNode<L> StringREtoREConverter.convert(TreeNode<StringLabel> inRE, AlphabetInterface<L> theAlphabet)
          Converts from the given input RE that uses StringLabels to the corresponding output RE that uses the specified Labels.
protected  void REPrinter.internalPrint(TreeNode<L> node)
          Prints out the given TreeNode to the specified Writer.
 void REPrinter.print(TreeNode<L> node)
          Prints out the given TreeNode to the specified Writer.
 void StringREtoREConverter.setResult(TreeNode<L> node)
          Sets the result as a TreeNode.
 void AbstractREConverter.setResult(TreeNode<L> newTreeNode)
          Sets the result as a TreeNode.
 

Uses of TreeNode in laser.regularlanguage.util
 

Subclasses of TreeNode in laser.regularlanguage.util
 class MarkerNode<L extends LabelInterface>
          MarkerNode is the special end of regular expression node that is needed in the RE to DFA algorithm.
 

Methods in laser.regularlanguage.util that return TreeNode
protected  TreeNode<L> REtoDFABuilder.addMarkerNode(TreeNode<L> oldRootNode)
          Adds a right end MarkerNode to the given regular expression.
 

Methods in laser.regularlanguage.util that return types with arguments of type TreeNode
 java.util.List<TreeNode<L>> MarkerNode.getChildren()
          Returns a List of the children of this TreeNode.
 

Methods in laser.regularlanguage.util with parameters of type TreeNode
protected  TreeNode<L> REtoDFABuilder.addMarkerNode(TreeNode<L> oldRootNode)
          Adds a right end MarkerNode to the given regular expression.
protected  laser.regularlanguage.util.REtoNFAConverter.REtoNFAInfo REtoNFAConverter.convert(TreeNode<L> node)
          Converts from an RE to an NFA
 REtoDFAInfo REtoDFABuilder.generateNodeInfo(TreeNode<L> node, java.util.List<TreeNode<L>> leafNodes)
          Generates the firstpos, lastpos, followpos sets and nullable flag.
protected  java.lang.Object[] REtoDFABuilder.getCreateArgs(MutableFSAInterface<L> newFSA, TreeNode<L> oldTreeNode)
          Gets any required arguments for the state factory method from the given TreeNode.
protected  java.lang.Object[] REtoNFAConverter.getCreateArgsForState(MutableFSAInterface<L> newFSA, TreeNode<L> oldTreeNode)
          Gets any required arguments for the state factory method from the given TreeNode.
protected  REtoDFAInfo REtoDFABuilder.getNodeInfo(TreeNode<L> node)
          Gets the REToDFAInfo Object associated with the given TreeNode.
 java.lang.String REtoDFAInfoPrinter.print(TreeNode<L> node, java.lang.String prefix)
          Produces an output of a TreeNode's REToDFAInfo Object that is indented at each tree level.
 

Method parameters in laser.regularlanguage.util with type arguments of type TreeNode
 REtoDFAInfo REtoDFABuilder.generateNodeInfo(TreeNode<L> node, java.util.List<TreeNode<L>> leafNodes)
          Generates the firstpos, lastpos, followpos sets and nullable flag.
 

Constructors in laser.regularlanguage.util with parameters of type TreeNode
REtoDFAInfoPrinter(TreeNode<L> rootNode, java.util.Map<TreeNode<L>,REtoDFAInfo> nodeToInfo)
          Creates a new REtoDFAInfoPrinter.
 

Constructor parameters in laser.regularlanguage.util with type arguments of type TreeNode
REtoDFAInfoPrinter(TreeNode<L> rootNode, java.util.Map<TreeNode<L>,REtoDFAInfo> nodeToInfo)
          Creates a new REtoDFAInfoPrinter.