source: trunk/sources/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Grammars/ArithmeticExpressionGrammar.cs @ 14826

Last change on this file since 14826 was 14826, checked in by gkronber, 6 months ago

#2650: merged the factors branch into trunk

File size: 3.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2016 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;
27using HeuristicLab.PluginInfrastructure;
28
29namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
30  [NonDiscoverableType]
31  [StorableClass]
32  [Item("ArithmeticExpressionGrammar", "Represents a grammar for functional expressions using only arithmetic operations.")]
33  public class ArithmeticExpressionGrammar : SymbolicExpressionGrammar, ISymbolicDataAnalysisGrammar {
34
35    [StorableConstructor]
36    protected ArithmeticExpressionGrammar(bool deserializing) : base(deserializing) { }
37    protected ArithmeticExpressionGrammar(ArithmeticExpressionGrammar original, Cloner cloner) : base(original, cloner) { }
38    public ArithmeticExpressionGrammar()
39      : base(ItemAttribute.GetName(typeof(ArithmeticExpressionGrammar)), ItemAttribute.GetDescription(typeof(ArithmeticExpressionGrammar))) {
40      Initialize();
41    }
42    public override IDeepCloneable Clone(Cloner cloner) {
43      return new ArithmeticExpressionGrammar(this, cloner);
44    }
45
46    private void Initialize() {
47      var add = new Addition();
48      var sub = new Subtraction();
49      var mul = new Multiplication();
50      var div = new Division();
51      var constant = new Constant();
52      constant.MinValue = -20;
53      constant.MaxValue = 20;
54      var variableSymbol = new HeuristicLab.Problems.DataAnalysis.Symbolic.Variable();
55      var binFactorVariableSymbol = new BinaryFactorVariable();
56      var factorVariableSymbol = new FactorVariable();
57
58      var allSymbols = new List<Symbol>() { add, sub, mul, div, constant, variableSymbol, binFactorVariableSymbol, factorVariableSymbol};
59      var functionSymbols = new List<Symbol>() { add, sub, mul, div };
60
61      foreach (var symb in allSymbols)
62        AddSymbol(symb);
63
64      foreach (var funSymb in functionSymbols) {
65        SetSubtreeCount(funSymb, 1, 3);
66      }
67      SetSubtreeCount(constant, 0, 0);
68      SetSubtreeCount(variableSymbol, 0, 0);
69      SetSubtreeCount(binFactorVariableSymbol, 0, 0);
70      SetSubtreeCount(factorVariableSymbol, 0, 0);
71
72      // allow each symbol as child of the start symbol
73      foreach (var symb in allSymbols) {
74        AddAllowedChildSymbol(StartSymbol, symb);
75        AddAllowedChildSymbol(DefunSymbol, symb);
76      }
77
78      // allow each symbol as child of every other symbol (except for terminals that have maxSubtreeCount == 0)
79      foreach (var parent in functionSymbols) {
80        foreach (var child in allSymbols)
81          AddAllowedChildSymbol(parent, child);
82      }
83    }
84  }
85}
Note: See TracBrowser for help on using the repository browser.