Free cookie consent management tool by TermsFeed Policy Generator

source: branches/OaaS/HeuristicLab.Problems.LawnMower/3.3/Grammar.cs @ 10206

Last change on this file since 10206 was 8163, checked in by mkommend, 12 years ago

#1876: * Removed unnecassary index positions during grammar configuration.

  • Removed unnecessary ref keyword in Interpreter for lawn mower programs.
  • Postponed firing of events in lawn mower Problem after configuration is completed.
File size: 2.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
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
22using System.Collections.Generic;
23using HeuristicLab.Common;
24using HeuristicLab.Core;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace 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) {
66        AddAllowedChildSymbol(sum, s);
67        AddAllowedChildSymbol(sum, s);
68        AddAllowedChildSymbol(prog, s);
69        AddAllowedChildSymbol(prog, s);
70        AddAllowedChildSymbol(frog, s);
71        AddAllowedChildSymbol(StartSymbol, s);
72      }
73    }
74  }
75}
Note: See TracBrowser for help on using the repository browser.