Changeset 15723 for branches/2886_SymRegGrammarEnumeration/HeuristicLab.Algorithms.DataAnalysis.SymRegGrammarEnumeration/GrammarEnumeration/Grammar.cs

Timestamp:

02/06/18 13:18:31 (6 years ago)

Author:

lkammere

Message:

#2886: Add simple data analysis tests and further informations about algorithm run.

File:

• branches/2886_SymRegGrammarEnumeration/HeuristicLab.Algorithms.DataAnalysis.SymRegGrammarEnumeration/GrammarEnumeration/Grammar.cs (modified) (4 diffs)

branches/2886_SymRegGrammarEnumeration/HeuristicLab.Algorithms.DataAnalysis.SymRegGrammarEnumeration/GrammarEnumeration/Grammar.cs

@@ -59 +59 @@
 
 
-      #region Production ruless
+      #region Production rules
+      // order of production is important, since they are accessed via index
+      // in memoization.
       StartSymbol = Expr;
 
@@ -89 +91 @@
     }
 
+    /*
+    #region Memoize subtrees
+
+    public void MemoizeSubtrees(SymbolString sentence) {
+      Stack<TerminalSymbol> parseStack = new Stack<TerminalSymbol>(sentence.OfType<TerminalSymbol>());
+
+      // Parse root symbol "+"
+      MemoizeSubtreeExpression(parseStack);
+    }
+
+    private SymbolString MemoizeSubtreeExpression(Stack<TerminalSymbol> parseStack) {
+      SymbolString subtree = new SymbolString();
+
+      if (ReferenceEquals(parseStack.Peek(), Addition)) {
+        subtree.Add(parseStack.Pop());
+        subtree.InsertRange(0, MemoizeSubtreeExpression(parseStack));
+        subtree.InsertRange(0, MemoizeSubtreeTerm(parseStack));
+
+        Expr.Alternatives[0].GeneratedSentences.Add(subtree);
+      } else {
+        subtree.InsertRange(0, MemoizeSubtreeTerm(parseStack));
+
+        Expr.Alternatives[1].GeneratedSentences.Add(subtree);
+      }
+
+      return subtree;
+    }
+
+    private SymbolString MemoizeSubtreeTerm(Stack<TerminalSymbol> parseStack) {
+      SymbolString subtree = new SymbolString();
+
+      if (ReferenceEquals(parseStack.Peek(), Multiplication)) {
+        subtree.Add(parseStack.Pop());
+        subtree.InsertRange(0, MemoizeSubtreeTerm(parseStack));
+        subtree.InsertRange(0, MemoizeSubtreeFactor(parseStack));
+
+        Term.Alternatives[0].GeneratedSentences.Add(subtree);
+      } else {
+        subtree.InsertRange(0, MemoizeSubtreeFactor(parseStack));
+
+        Term.Alternatives[1].GeneratedSentences.Add(subtree);
+      }
+
+      return subtree;
+    }
+
+    private SymbolString MemoizeSubtreeFactor(Stack<TerminalSymbol> parseStack) {
+      SymbolString subtree = new SymbolString(MemoizeSubtreeVar(parseStack));
+
+      Factor.Alternatives[0].GeneratedSentences.Add(subtree);
+      return subtree;
+    }
+
+    private SymbolString MemoizeSubtreeVar(Stack<TerminalSymbol> parseStack) {
+      SymbolString subtree = new SymbolString(parseStack.Pop().ToEnumerable());
+
+      // ... not really
+      //Var.Alternatives[0].GeneratedSentences.Add(subtree);
+      return subtree;
+    }
+
+
+    #endregion
+    */
+    
+    #region Hashing
     public int CalcHashCode(SymbolString sentence) {
       Debug.Assert(sentence.Any(), "Trying to evaluate empty sentence!");
@@ -99 +167 @@
     }
 
-    #region Hashing
     private int[] GetSubtreeHashes(TerminalSymbol currentSymbol, Stack<TerminalSymbol> parseStack) {
       List<int> childHashes = null;
@@ -166 +233 @@
       return childHashes.ToArray();
     }
-
 
     private int AggregateHashes(IEnumerable<int> hashes) {