//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\
// PLEASE DO NOT EDIT WITHOUT THE EXPLICIT CONSENT OF THE AUTHOR! \\
//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\//\\
package hlt.language.util;
/**
* This class is a concrete implementation of the abstract class RegExpOne to represent a
* regular expression that is a finite choice of powers ranging
* from m to n.
*
* @version Last modified on Thu Mar 31 17:20:02 2016 by hak
* @author Hassan Aït-Kaci
* @copyright © Hassan Aït-Kaci
*/
public class RegExpPowerRange extends RegExpOne
{
private int _lower = 0;
private int _upper = OMEGA;
public final int getLower ()
{
return _lower;
}
public final int getUpper ()
{
return _upper;
}
public final RegExp shallowCopy ()
{
return range(_arg,_lower,_upper);
}
public final RegExp deepCopy ()
{
return range(_arg.deepCopy(),_lower,_upper);
}
public final int type ()
{
return RANGE_EXP;
}
public final RegExpPowerRange setLower (int lower)
{
_lower = lower;
return this;
}
public final RegExpPowerRange setUpper (int upper)
{
_upper = upper;
return this;
}
public final RegExpPowerRange setRange (int lower, int upper)
{
_lower = lower;
_upper = upper;
return this;
}
/**
* Constructs a RegExpPowerRange with the specified
* RegExp, lower bound 0 and upper bound
* OMEGA.
*/
public RegExpPowerRange (RegExp arg)
{
super(arg);
}
/**
* Constructs a RegExpPowerRange with the specified
* RegExp and lower bound, and upper bound OMEGA.
*/
public RegExpPowerRange (RegExp arg, int lower)
{
super(arg);
setLower(lower);
}
/**
* Constructs a RegExpPowerRange with the specified
* RegExp, and lower and upper bounds.
*/
public RegExpPowerRange (RegExp arg, int lower, int upper)
{
super(arg);
setRange(lower,upper);
}
/**
* This returns this
* RegExpPowerRange's normal form according to the following
* rewrite rules:
*
*
*
* -
*
* [PR:E]
*
*
*
* ()_m^n
*
* →
*
*
* ()
*
*
*
*
-
*
* [PR:00]
*
*
*
* X_0^0
*
* →
*
*
* ()
*
*
*
*
-
*
* [PR:01]
*
*
*
* X_0^1
*
* →
*
*
* X?
*
*
*
*
-
*
* [PR:O]
*
*
*
* X_0~
*
* →
*
*
* X\*
*
*
*
*
-
*
* [PR:1_]
*
*
*
* X_1~
*
* →
*
*
* X+
*
*
*
*
-
*
* [PR:__]
*
*
*
* X_m^n
*
* →
*
*
* ()
*
*
* (if n < m)
*
*
-
*
* [PR:-n]
*
*
*
* X_m^n
*
* →
*
*
* X_0^n
*
*
* (if m < 0)
*
*
-
*
* [PR:m-]
*
*
*
* X_m^n
*
* →
*
*
* ()
*
*
* (if n < 0)
*
*
-
*
* [PR:mm]
*
*
*
* X_m^m
*
* →
*
*
* X^m
*
*
*
*
-
*
* [PR:O]
*
*
*
* X?_m^n
*
* →
*
*
* () | X_m^n
*
*
*
*
-
*
* [PR:P]
*
*
*
* X+_m^n
*
* →
*
*
* X_m~
*
*
*
*
-
*
* [PR:S]
*
*
*
* X\*_m^n
*
* →
*
*
* X\*
*
*
*
*
*/
public void normalize ()
{
String rule = null;
RegExp arg = arg();
out:
{
if (arg.isEmpty())
{
rule = "[PR:E] ()_m^n --> ()";
_normalForm = RegExpSymbol.EMPTY;
break out;
}
if (_lower == 0)
{
if (_upper <= 0)
{
rule = "[PR:00] X_0^0 --> ()";
_normalForm = RegExpSymbol.EMPTY;
break out;
}
if (_upper == 1)
{
rule = "[PR:01] X_0^1 --> X?";
_normalForm = option(arg);
break out;
}
if (_upper == OMEGA)
{
rule = "[PR:0_] X_0~ --> X*";
_normalForm = star(arg);
break out;
}
}
if (_lower == 1 && _upper == OMEGA)
{
rule = "[PR:1_] X_1~ --> X+";
_normalForm = plus(arg);
break out;
}
if (_lower > _upper)
{
rule = "[PR:__] X_m^n --> ()\t(if ntrue iff the specified object is a
* RegExpPowerRange that has the same argument, lower, and
* upper bounds as this one.
*/
public final boolean equals (Object other)
{
return super.equals(other)
&& _lower == ((RegExp)other).lower()
&& _upper == ((RegExp)other).upper();
}
/**
* Returns a printable form for this RegExpPowerRange.
*/
public final String toString ()
{
String upper = _upper==OMEGA ? "~" : "^"+_upper;
if (_arg.isBinary())
return "("+_arg+")_"+_lower+upper;
return _arg+"_"+_lower+upper;
}
public final String toNormalString ()
{
if (!inNormalForm())
return _normalForm.toNormalString();
String upper = _upper==OMEGA ? "~" : "^"+_upper;
if (_arg.isBinary())
return "("+_arg.toNormalString()+")_"+_lower+upper;
return _arg.toNormalString()+"_"+_lower+upper;
}
}