jpaul.RegExps
Class RegExp.Union<A>
java.lang.Object
jpaul.RegExps.RegExp<A>
jpaul.RegExps.RegExp.Union<A>
- All Implemented Interfaces:
- java.io.Serializable, java.lang.Cloneable
- Enclosing class:
- RegExp<A>
public static class RegExp.Union<A>
- extends RegExp<A>
The regular expression that matches any string matched by at
least one of two specific regular expression.
- See Also:
- Serialized Form
Constructor Summary |
RegExp.Union(RegExp<A> left,
RegExp<A> right)
Creates a Union regular expression that
matches any string that is matched by (at least one of)
left and right . |
Methods inherited from class java.lang.Object |
clone, finalize, getClass, notify, notifyAll, wait, wait, wait |
left
public final RegExp<A> left
right
public final RegExp<A> right
RegExp.Union
public RegExp.Union(RegExp<A> left,
RegExp<A> right)
- Creates a
Union
regular expression that
matches any string that is matched by (at least one of)
left
and right
.
accept
public <Res> Res accept(RegExp.Visitor<A,Res> visitor)
- Description copied from class:
RegExp
- Method for the visitor pattern. This method will dynamically
select and execute the
visit
method of the
visitor
that corresponds to the dynamic type of
the regular expression. E.g., in the case of a regular
expression that is a RegExp.Concat
object,
accept
executes the code of
visit(RegExp.Concat)
.
- Overrides:
accept
in class RegExp<A>
equals
public boolean equals(java.lang.Object o)
- Overrides:
equals
in class java.lang.Object
_hashCode
protected int _hashCode()
- Description copied from class:
RegExp
- Does the real work behing
hashCode
.
- Specified by:
_hashCode
in class RegExp<A>
- See Also:
RegExp.hashCode()
toString
public java.lang.String toString()
- Overrides:
toString
in class java.lang.Object
allTransTerms
public java.util.List<RegExp<A>> allTransTerms()
- Returns all transitive terms of this
Union
.
More details: this Union
regexp may be the
root of a subtree of Union
internal nodes,
modeling the union of several regexps: e.g.,
a|((b|c)|d)
. This method returns all the
leaves of this subtree; for the previous example, it
returns [a,b,c,d]
.
Copyright 2005 Alexandru Salcianu - salcianu@alum.mit.edu