/*package*/ public NonTerminalType(IConstructor cons) {
// TODO refactor this into different factory methods in RascalTypeFactory
if (cons.getConstructorType() == RascalValueFactory.Tree_Appl) {
// Note that here we go from * to + lists if the list is not empty
this.symbol = TreeAdapter.getType((ITree) cons);
} else if (cons.getConstructorType() == RascalValueFactory.Tree_Amb) {
ISet alts = TreeAdapter.getAlternatives((ITree) cons);
if (!alts.isEmpty()) {
ITree first = (ITree) alts.iterator().next();
this.symbol = TreeAdapter.getType(first);
} else {
this.symbol =
IRascalValueFactory.getInstance().constructor(RascalValueFactory.Symbol_Empty);
}
} else if (cons.getConstructorType() == RascalValueFactory.Tree_Cycle) {
this.symbol = TreeAdapter.getType((ITree) cons);
} else if (cons.getType() == RascalValueFactory.Symbol) {
this.symbol = cons;
} else if (cons.getType() == RascalValueFactory.Production) {
this.symbol = ProductionAdapter.getType(cons);
} else {
throw new ImplementationError("Invalid concrete syntax type constructor:" + cons);
}
}
private boolean checkIndent(ISet o) {
if (indent && o.size() > 1) {
for (IValue x : o) {
Type type = x.getType();
return indented(type);
}
}
return false;
}
public IValue visitSet(ISet o) throws IOException {
append('{');
boolean indent = checkIndent(o);
tab();
indent(indent);
Iterator<IValue> setIterator = o.iterator();
if (setIterator.hasNext()) {
setIterator.next().accept(this);
while (setIterator.hasNext()) {
append(",");
indent(indent);
setIterator.next().accept(this);
}
}
untab();
indent(indent);
append('}');
return o;
}
public ITree filterAmbiguity(ITree ambCluster, Object environment) {
ISet alts = (ISet) ambCluster.get("alternatives");
if (alts.size() == 0) {
return null;
}
Environment env = (Environment) environment;
Result<IValue> var = env.getFrameVariable("amb");
if (var != null && var instanceof ICallableValue) {
Type type = RascalTypeFactory.getInstance().nonTerminalType(ambCluster);
ICallableValue func = (ICallableValue) var;
try {
Result<IValue> result = func.call(new Type[] {TF.setType(type)}, new IValue[] {alts}, null);
if (result.getType().isBottom()) {
return ambCluster;
}
ITree r = (ITree) result.getValue();
if (TreeAdapter.isAmb(r)) {
ISet returnedAlts = TreeAdapter.getAlternatives(r);
if (returnedAlts.size() == 1) {
return (ITree) returnedAlts.iterator().next();
} else if (returnedAlts.size() == 0) {
return null;
} else {
return r;
}
}
return (ITree) result.getValue();
} catch (ArgumentMismatch e) {
return ambCluster;
}
}
return ambCluster;
}