Package io.jenetics.ext.rewriting
This package contains the implementation of a Tree (Term) Rewrite System.
It's main purpose is to deliver a DSL which simplifies the definition of
rewrite rules, which work on the existing
Tree
implementations. This DSL is also used in the io.jenetics.prog
module
for simplifying arithmetic expression trees.- Since:
- 5.0
- Version:
- 5.0
- See Also:
- TRS
-
Interface Summary Interface Description TreeRewriter<V> Interface for rewriting a given tree. -
Class Summary Class Description TreeMatcher<V> Implementation of a pattern based tree matcher.TreeMatchResult<V> The result of a tree match operation.TreePattern<V> This class serves two purposes.TreePattern.Decl<V> A sealed class, which constitutes the nodes of a pattern tree.TreePattern.Val<V> This class represents a constant pattern value, which can be part of a whole sub-tree.TreePattern.Var<V> Represents a placeholder (variable) for an arbitrary sub-tree.TreeRewriteRule<V> Represents a tree rewrite rule.TRS<V> This class represents a Tree Rewrite System, which consists of a set of Tree Rewrite Rules.