Files
FormeleMethoden/src/com/imegumii/codevandocent/RegExp.java
T
2017-05-02 14:20:19 +02:00

141 lines
4.0 KiB
Java

package com.imegumii.codevandocent;
import java.util.*;
/**
* Voorbeeld class voor het representeren van reguliere expressies
*
*/
public class RegExp
{
Operator operator;
String terminals;
// De mogelijke operatoren voor een reguliere expressie (+, *, |, .)
// Daarnaast ook een operator definitie voor 1 keer repeteren (default)
public enum Operator { PLUS, STAR, OR, DOT, ONE}
RegExp left;
RegExp right;
static final Comparator<String> compareByLength
= new Comparator<String> ()
{
public int compare(String s1, String s2)
{
if (s1.length() == s2.length())
{return s1.compareTo(s2);}
else
{return s1.length() - s2.length();}
}
};
public RegExp()
{
operator = Operator.ONE;
terminals = "";
left = null;
right = null;
}
public RegExp(String p)
{
operator = Operator.ONE;
terminals = p;
left = null;
right = null;
}
public RegExp plus()
{
RegExp result = new RegExp();
result.operator = Operator.PLUS;
result.left = this;
return result;
}
public RegExp star()
{
RegExp result = new RegExp();
result.operator = Operator.STAR;
result.left = this;
return result;
}
public RegExp or(RegExp e2)
{
RegExp result = new RegExp();
result.operator = Operator.OR;
result.left = this;
result.right = e2;
return result;
}
public RegExp dot(RegExp e2)
{
RegExp result = new RegExp();
result.operator = Operator.DOT;
result.left = this;
result.right = e2;
return result;
}
public SortedSet <String> getLanguage(int maxSteps)
{
SortedSet<String> emptyLanguage = new TreeSet<String>(compareByLength);
SortedSet<String> languageResult = new TreeSet<String>(compareByLength);
SortedSet<String> languageLeft, languageRight;
if (maxSteps < 1) return emptyLanguage;
switch (this.operator) {
case ONE:
{languageResult.add(terminals);}
case OR:
languageLeft = left == null ? emptyLanguage : left.getLanguage(maxSteps - 1);
languageRight = right == null ? emptyLanguage : right.getLanguage(maxSteps - 1);
languageResult.addAll (languageLeft);
languageResult.addAll (languageRight);
break;
case DOT:
languageLeft = left == null ? emptyLanguage : left.getLanguage(maxSteps - 1);
languageRight = right == null ? emptyLanguage : right.getLanguage(maxSteps - 1);
for (String s1 : languageLeft)
for (String s2 : languageRight)
{languageResult.add (s1 + s2);}
break;
// STER(*) en PLUS(+) kunnen we bijna op dezelfde manier uitwerken:
case STAR:
case PLUS:
languageLeft = left == null ? emptyLanguage : left.getLanguage(maxSteps - 1);
languageResult.addAll(languageLeft);
for (int i = 1; i < maxSteps; i++)
{ HashSet<String> languageTemp = new HashSet<String>(languageResult);
for (String s1 : languageLeft)
{ for (String s2 : languageTemp)
{ languageResult.add (s1+s2);
}
}
}
if (this.operator == Operator.STAR)
{languageResult.add("");}
break;
default:
System.out.println ("getLanguage is nog niet gedefinieerd voor de operator: " + this.operator);
break;
}
return languageResult;
}
}