[8059] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[12969] | 3 | * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[8059] | 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
| 22 | using System.Collections.Generic;
|
---|
| 23 | using HeuristicLab.Common;
|
---|
| 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 |
|
---|
| 28 | namespace HeuristicLab.Problems.LawnMower {
|
---|
| 29 | [StorableClass]
|
---|
| 30 | [Item("Lawn Mower Grammar", "The grammar for the lawn mower GP problem.")]
|
---|
| 31 | public sealed class Grammar : SymbolicExpressionGrammar {
|
---|
| 32 | [StorableConstructor]
|
---|
| 33 | private Grammar(bool deserializing) : base(deserializing) { }
|
---|
| 34 | private Grammar(Grammar original, Cloner cloner)
|
---|
| 35 | : base(original, cloner) {
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | public Grammar()
|
---|
| 39 | : base("Grammar", "Gammar for the lawn mower demo GP problem.") {
|
---|
| 40 | Initialize();
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | [StorableHook(HookType.AfterDeserialization)]
|
---|
| 44 | private void AfterDeserialization() {
|
---|
| 45 | }
|
---|
| 46 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 47 | return new Grammar(this, cloner);
|
---|
| 48 | }
|
---|
| 49 | private void Initialize() {
|
---|
| 50 | // create all symbols
|
---|
| 51 | var sum = new Sum();
|
---|
| 52 | var prog = new Prog();
|
---|
| 53 | var frog = new Frog();
|
---|
| 54 | var left = new Left();
|
---|
| 55 | var forward = new Forward();
|
---|
| 56 | var constant = new Constant();
|
---|
| 57 |
|
---|
| 58 | var allSymbols = new List<ISymbol>() { sum, prog, frog, left, forward, constant };
|
---|
| 59 |
|
---|
| 60 | // add all symbols to the grammar
|
---|
| 61 | foreach (var s in allSymbols)
|
---|
| 62 | AddSymbol(s);
|
---|
| 63 |
|
---|
| 64 | // define grammar rules
|
---|
| 65 | foreach (var s in allSymbols) {
|
---|
[8163] | 66 | AddAllowedChildSymbol(sum, s);
|
---|
| 67 | AddAllowedChildSymbol(sum, s);
|
---|
| 68 | AddAllowedChildSymbol(prog, s);
|
---|
| 69 | AddAllowedChildSymbol(prog, s);
|
---|
| 70 | AddAllowedChildSymbol(frog, s);
|
---|
| 71 | AddAllowedChildSymbol(StartSymbol, s);
|
---|
[8059] | 72 | }
|
---|
| 73 | }
|
---|
| 74 | }
|
---|
| 75 | }
|
---|