Reader in1 = new StringReader("a.f(a,c,b,X)"); // Use FileReader instead Reader in2 = new StringReader("a.f(a,b,c,X)"); // Use FileReader instead Reader inN = new StringReader("b#X,c#X"); // Use FileReader instead final NodeFactory factory = new NodeFactory(); InputParser parser = new InputParser(factory); EquationSystem<EquivarianceProblem> eqSys = new EquationSystem<EquivarianceProblem>() { public EquivarianceProblem newEquation(NominalTerm t, NominalTerm s) { return new EquivarianceProblem(t, s); } }; parser.parseEquation(in1, in2, eqSys); FreshnessCtx nablaIn = parser.parseNabla(inN); Collection<? extends Atom> atomSet = factory.getAllByType(factory.classAtom); Permutation pi = new Equivariance(eqSys, atomSet, nablaIn) .compute(factory, false, DebugLevel.SILENT, null); System.out.println(pi);
Author: | Alexander Baumgartner | |
Project: | SToUT - Symbolic Computation Techniques for Unranked Terms |