Free cookie consent management tool by TermsFeed Policy Generator

source: branches/symbreg-factors-2650/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Formatters/SymbolicDataAnalysisExpressionCSharpFormatter.cs @ 14502

Last change on this file since 14502 was 14502, checked in by gkronber, 7 years ago

#2650: another small fix in the C# formatter

File size: 12.4 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;
23using System.Collections.Generic;
24using System.Globalization;
25using System.Linq;
26using System.Text;
27using HeuristicLab.Common;
28using HeuristicLab.Core;
29using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
30using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
31
32namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
33  [Item("C# Symbolic Expression Tree Formatter", "A string formatter that converts symbolic expression trees to C# code.")]
34  [StorableClass]
35  public sealed class CSharpSymbolicExpressionTreeStringFormatter : NamedItem, ISymbolicExpressionTreeStringFormatter {
36    [StorableConstructor]
37    private CSharpSymbolicExpressionTreeStringFormatter(bool deserializing) : base(deserializing) { }
38    private CSharpSymbolicExpressionTreeStringFormatter(CSharpSymbolicExpressionTreeStringFormatter original, Cloner cloner) : base(original, cloner) { }
39    public CSharpSymbolicExpressionTreeStringFormatter()
40      : base() {
41      Name = ItemName;
42      Description = ItemDescription;
43    }
44    public override IDeepCloneable Clone(Cloner cloner) {
45      return new CSharpSymbolicExpressionTreeStringFormatter(this, cloner);
46    }
47
48    public string Format(ISymbolicExpressionTree symbolicExpressionTree) {
49      // skip root and start symbols
50      StringBuilder strBuilder = new StringBuilder();
51      GenerateHeader(strBuilder, symbolicExpressionTree);
52      FormatRecursively(symbolicExpressionTree.Root.GetSubtree(0).GetSubtree(0), strBuilder);
53      GenerateFooter(strBuilder);
54      return strBuilder.ToString();
55    }
56
57    private string VariableName2Identifier(string name) {
58      return "_" + string.Join("_", Encoding.UTF8.GetBytes(name));
59    }
60
61    private void FormatRecursively(ISymbolicExpressionTreeNode node, StringBuilder strBuilder) {
62      // TODO: adapt to interpreter semantics. The HL interpreter also allows Boolean operations on reals
63      if (node.Subtrees.Any()) {
64        if (node.Symbol is Addition) {
65          FormatOperator(node, "+", strBuilder);
66        } else if (node.Symbol is And) {
67          FormatOperator(node, "&&", strBuilder);
68        } else if (node.Symbol is Average) {
69          FormatFunction(node, "Average", strBuilder);
70        } else if (node.Symbol is Cosine) {
71          FormatFunction(node, "Math.Cos", strBuilder);
72        } else if (node.Symbol is Division) {
73          FormatDivision(node, strBuilder);
74        } else if (node.Symbol is Exponential) {
75          FormatFunction(node, "Math.Exp", strBuilder);
76        } else if (node.Symbol is GreaterThan) {
77          FormatOperator(node, ">", strBuilder);
78        } else if (node.Symbol is IfThenElse) {
79          FormatFunction(node, "EvaluateIf", strBuilder);
80        } else if (node.Symbol is LessThan) {
81          FormatOperator(node, "<", strBuilder);
82        } else if (node.Symbol is Logarithm) {
83          FormatFunction(node, "Math.Log", strBuilder);
84        } else if (node.Symbol is Multiplication) {
85          FormatOperator(node, "*", strBuilder);
86        } else if (node.Symbol is Not) {
87          FormatOperator(node, "!", strBuilder);
88        } else if (node.Symbol is Or) {
89          FormatOperator(node, "||", strBuilder);
90        } else if (node.Symbol is Xor) {
91          FormatOperator(node, "^", strBuilder);
92        } else if (node.Symbol is Sine) {
93          FormatFunction(node, "Math.Sin", strBuilder);
94        } else if (node.Symbol is Subtraction) {
95          FormatSubtraction(node, strBuilder);
96        } else if (node.Symbol is Tangent) {
97          FormatFunction(node, "Math.Tan", strBuilder);
98        } else if (node.Symbol is Square) {
99          FormatSquare(node, strBuilder);
100        } else if (node.Symbol is SquareRoot) {
101          FormatFunction(node, "Math.Sqrt", strBuilder);
102        } else if (node.Symbol is Power) {
103          FormatFunction(node, "Math.Pow", strBuilder);
104        } else if (node.Symbol is Root) {
105          FormatRoot(node, strBuilder);
106        } else {
107          throw new NotSupportedException("Formatting of symbol: " + node.Symbol + " not supported for C# symbolic expression tree formatter.");
108        }
109      } else {
110        if (node is VariableTreeNode) {
111          var varNode = node as VariableTreeNode;
112          strBuilder.AppendFormat("{0} * {1}", VariableName2Identifier(varNode.VariableName), varNode.Weight.ToString("g17", CultureInfo.InvariantCulture));
113        } else if (node is ConstantTreeNode) {
114          var constNode = node as ConstantTreeNode;
115          strBuilder.Append(constNode.Value.ToString("g17", CultureInfo.InvariantCulture));
116        } else if (node.Symbol is FactorVariable) {
117          var factorNode = node as FactorVariableTreeNode;
118          FormatFactor(factorNode, strBuilder);
119        } else if (node.Symbol is BinaryFactorVariable) {
120          var binFactorNode = node as BinaryFactorVariableTreeNode;
121          FormatBinaryFactor(binFactorNode, strBuilder);
122        } else {
123          throw new NotSupportedException("Formatting of symbol: " + node.Symbol + " not supported for C# symbolic expression tree formatter.");
124        }
125      }
126    }
127
128    private void FormatFactor(FactorVariableTreeNode node, StringBuilder strBuilder) {
129      strBuilder.AppendFormat("EvaluateFactor({0}, new [] {{ {1} }}, new [] {{ {2} }})", VariableName2Identifier(node.VariableName),
130        string.Join(",", node.Symbol.GetVariableValues(node.VariableName).Select(name => "\"" + name + "\"")), string.Join(",", node.Weights.Select(v => v.ToString(CultureInfo.InvariantCulture))));
131    }
132
133    private void FormatBinaryFactor(BinaryFactorVariableTreeNode node, StringBuilder strBuilder) {
134      strBuilder.AppendFormat(CultureInfo.InvariantCulture, "EvaluateBinaryFactor({0}, \"{1}\", {2})", VariableName2Identifier(node.VariableName), node.VariableValue, node.Weight);
135    }
136
137    private void FormatSquare(ISymbolicExpressionTreeNode node, StringBuilder strBuilder) {
138      strBuilder.Append("Math.Pow(");
139      FormatRecursively(node.GetSubtree(0), strBuilder);
140      strBuilder.Append(", 2)");
141    }
142
143    private void FormatRoot(ISymbolicExpressionTreeNode node, StringBuilder strBuilder) {
144      strBuilder.Append("Math.Pow(");
145      FormatRecursively(node.GetSubtree(0), strBuilder);
146      strBuilder.Append(", 1.0 / (");
147      FormatRecursively(node.GetSubtree(1), strBuilder);
148      strBuilder.Append("))");
149    }
150
151    private void FormatDivision(ISymbolicExpressionTreeNode node, StringBuilder strBuilder) {
152      if (node.SubtreeCount == 1) {
153        strBuilder.Append("1.0 / ");
154        FormatRecursively(node.GetSubtree(0), strBuilder);
155      } else {
156        FormatRecursively(node.GetSubtree(0), strBuilder);
157        strBuilder.Append("/ (");
158        for (int i = 1; i < node.SubtreeCount; i++) {
159          if (i > 1) strBuilder.Append(" * ");
160          FormatRecursively(node.GetSubtree(i), strBuilder);
161        }
162        strBuilder.Append(")");
163      }
164    }
165
166    private void FormatSubtraction(ISymbolicExpressionTreeNode node, StringBuilder strBuilder) {
167      if (node.SubtreeCount == 1) {
168        strBuilder.Append("-");
169        FormatRecursively(node.GetSubtree(0), strBuilder);
170        return;
171      }
172      //Default case: more than 1 child
173      FormatOperator(node, "-", strBuilder);
174    }
175
176    private void FormatOperator(ISymbolicExpressionTreeNode node, string symbol, StringBuilder strBuilder) {
177      strBuilder.Append("(");
178      foreach (var child in node.Subtrees) {
179        FormatRecursively(child, strBuilder);
180        if (child != node.Subtrees.Last())
181          strBuilder.Append(" " + symbol + " ");
182      }
183      strBuilder.Append(")");
184    }
185
186    private void FormatFunction(ISymbolicExpressionTreeNode node, string function, StringBuilder strBuilder) {
187      strBuilder.Append(function + "(");
188      foreach (var child in node.Subtrees) {
189        FormatRecursively(child, strBuilder);
190        if (child != node.Subtrees.Last())
191          strBuilder.Append(", ");
192      }
193      strBuilder.Append(")");
194    }
195
196    private void GenerateHeader(StringBuilder strBuilder, ISymbolicExpressionTree symbolicExpressionTree) {
197      strBuilder.AppendLine("using System;");
198      strBuilder.AppendLine("using System.Linq;" + Environment.NewLine);
199      strBuilder.AppendLine("namespace HeuristicLab.Models {");
200      strBuilder.AppendLine("public static class Model {");
201      GenerateAverageSource(strBuilder);
202      GenerateIfThenElseSource(strBuilder);
203      GenerateFactorSource(strBuilder);
204      GenerateBinaryFactorSource(strBuilder);
205      strBuilder.Append(Environment.NewLine + "public static double Evaluate (");
206
207      // here we don't have access to problemData to determine the type for each variable (double/string) therefore we must distinguish based on the symbol type
208      HashSet<string> doubleVarNames = new HashSet<string>();
209      foreach (var node in symbolicExpressionTree.IterateNodesPostfix().Where(x => x is VariableTreeNode || x is VariableConditionTreeNode)) {
210        doubleVarNames.Add(((IVariableTreeNode)node).VariableName);
211      }
212
213      HashSet<string> stringVarNames = new HashSet<string>();
214      foreach (var node in symbolicExpressionTree.IterateNodesPostfix().Where(x => x is BinaryFactorVariableTreeNode || x is FactorVariableTreeNode)) {
215        stringVarNames.Add(((IVariableTreeNode)node).VariableName);
216      }
217
218      var orderedNames = stringVarNames.OrderBy(n => n, new NaturalStringComparer()).Select(n => "string " + VariableName2Identifier(n) + " /* " + n + " */");
219      strBuilder.Append(string.Join(", ", orderedNames));
220
221      if (stringVarNames.Any() && doubleVarNames.Any())
222        strBuilder.AppendLine(",");
223      orderedNames = doubleVarNames.OrderBy(n => n, new NaturalStringComparer()).Select(n => "double " + VariableName2Identifier(n) + " /* " + n + " */");
224      strBuilder.Append(string.Join(", ", orderedNames));
225
226
227      strBuilder.AppendLine(") {");
228      strBuilder.Append("double result = ");
229    }
230
231    private void GenerateFooter(StringBuilder strBuilder) {
232      strBuilder.AppendLine(";");
233
234      strBuilder.AppendLine("return result;");
235      strBuilder.AppendLine("}");
236      strBuilder.AppendLine("}");
237      strBuilder.AppendLine("}");
238    }
239
240    private void GenerateAverageSource(StringBuilder strBuilder) {
241      strBuilder.AppendLine("private static double Average(params double[] values) {");
242      strBuilder.AppendLine("  return values.Average();");
243      strBuilder.AppendLine("}");
244    }
245
246    private void GenerateIfThenElseSource(StringBuilder strBuilder) {
247      strBuilder.AppendLine("private static double EvaluateIf(bool condition, double then, double @else) {");
248      strBuilder.AppendLine("   return condition ? then : @else;");
249      strBuilder.AppendLine("}");
250    }
251
252    private void GenerateFactorSource(StringBuilder strBuilder) {
253      strBuilder.AppendLine("private static double EvaluateFactor(string factorValue, string[] factorValues, double[] constants) {");
254      strBuilder.AppendLine("   for(int i=0;i<factorValues.Length;i++) " +
255                            "      if(factorValues[i] == factorValue) return constants[i];" +
256                            "   throw new ArgumentException();");
257      strBuilder.AppendLine("}");
258    }
259
260    private void GenerateBinaryFactorSource(StringBuilder strBuilder) {
261      strBuilder.AppendLine("private static double EvaluateBinaryFactor(string factorValue, string targetValue, double weight) {");
262      strBuilder.AppendLine("  return factorValue == targetValue ? weight : 0.0;");
263      strBuilder.AppendLine("}");
264    }
265
266  }
267}
Note: See TracBrowser for help on using the repository browser.