try { String in = "C(f(X)) << g(f(a,b),h(f(a),f))"; MatchProblem p = new MatchProblem(); new InputParser(p, new NodeFactory()).parseEqSystem(in, null); new MatchAlgorithm(new MatchSystem(p, new Substitution())) .match(DebugLevel.PROGRESS, System.out, System.out, true); } catch (Exception e) { e.printStackTrace(); }
Author: | Alexander Baumgartner | |
Project: | SToUT - Symbolic Computation Techniques for Unranked Terms |