#region License Information /* HeuristicLab * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL) * * This file is part of HeuristicLab. * * HeuristicLab is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * HeuristicLab is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with HeuristicLab. If not, see . */ #endregion using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Encodings.IntegerVectorEncoding; using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Problems.GrammaticalEvolution { /// /// Position Independent (PI) Grammatical Evolution Mapper /// [Item("PIGEMapper", "")] [StorableClass] public class PIGEMapper : GenotypeToPhenotypeMapper { [StorableConstructor] protected PIGEMapper(bool deserializing) : base(deserializing) { } protected PIGEMapper(PIGEMapper original, Cloner cloner) : base(original, cloner) { } public PIGEMapper() : base() { } public override IDeepCloneable Clone(Cloner cloner) { return new PIGEMapper(this, cloner); } /// /// Maps a genotype (an integer vector) to a phenotype (a symbolic expression tree). /// PIGE approach. /// /// grammar definition /// integer vector, which should be mapped to a tree /// phenotype (a symbolic expression tree) public override SymbolicExpressionTree Map(ISymbolicExpressionGrammar grammar, IntegerVector genotype) { SymbolicExpressionTree tree = new SymbolicExpressionTree(); var rootNode = (SymbolicExpressionTreeTopLevelNode)grammar.ProgramRootSymbol.CreateTreeNode(); var startNode = (SymbolicExpressionTreeTopLevelNode)grammar.StartSymbol.CreateTreeNode(); rootNode.AddSubtree(startNode); tree.Root = rootNode; // TODO return tree; } } }