Changeset 10051 for branches/HeuristicLab.Problems.GPDL/Test

Timestamp:

10/17/13 15:19:45 (11 years ago)

Author:

gkronber

Message:

#2026 worked on a plugin for grammars (work-in-progress)

Location:

branches/HeuristicLab.Problems.GPDL/Test

Files:

• Test.csproj (modified) (2 diffs)
• TestGpdlExamples.cs (modified) (3 diffs)
• TestGrammar.cs (modified) (2 diffs)

branches/HeuristicLab.Problems.GPDL/Test/Test.csproj

@@ -22 +22 @@
     <DebugType>full</DebugType>
     <Optimize>false</Optimize>
-    <OutputPath>..\trunk\sources\bin\</OutputPath>
+    <OutputPath>..\..\..\trunk\sources\bin\</OutputPath>
     <DefineConstants>DEBUG;TRACE</DefineConstants>
     <ErrorReport>prompt</ErrorReport>
@@ -128 +128 @@
       <Name>HeuristicLab.Grammars-3.3</Name>
     </ProjectReference>
+    <ProjectReference Include="..\HeuristicLab.Problems.GPDL.CodeGen\3.4\HeuristicLab.Problems.GPDL.CodeGen-3.4.csproj">
+      <Project>{F8481248-2A5B-48A0-A485-D3E1619C1E44}</Project>
+      <Name>HeuristicLab.Problems.GPDL.CodeGen-3.4</Name>
+    </ProjectReference>
     <ProjectReference Include="..\HeuristicLab.Problems.GPDL.Views\3.4\HeuristicLab.Problems.GPDL.Views-3.4.csproj">
       <Project>{3f9e665a-3dcb-49c3-8806-0e47fc48ea52}</Project>

branches/HeuristicLab.Problems.GPDL/Test/TestGpdlExamples.cs

@@ -27 +27 @@
 using HeuristicLab.Algorithms.GeneticAlgorithm;
 using HeuristicLab.Problems.GPDL;
+using HeuristicLab.Problems.GPDL.CodeGen;
 using HeuristicLab.Problems.GPDL.Views;
 using HeuristicLab.SequentialEngine;
@@ -41 +42 @@
         Parser parser = new Parser(scanner);
         parser.Parse();
-        Assert.IsNotNull(parser.problem);
+        Assert.IsNotNull(parser.AbstractSyntaxTree);
 
         // test: run one generation
@@ -48 +49 @@
         ga.PopulationSize.Value = 100;
         ga.MaximumGenerations.Value = 1;
-        ga.Problem = parser.problem;
+
+        var problemGenerator = new ProblemGenerator();
+        ga.Problem = problemGenerator.GenerateFromAst(parser.AbstractSyntaxTree);
 
         var wh = new AutoResetEvent(false);

branches/HeuristicLab.Problems.GPDL/Test/TestGrammar.cs

@@ -20 +20 @@
 #endregion
 
+using System;
+using System.Collections.Generic;
 using System.Linq;
 using Microsoft.VisualStudio.TestTools.UnitTesting;
@@ -31 +33 @@
         @"S -> A
           A->a B
-          B ->S b | S a|B b 
-          B-> a  aa   aaa
+          B ->S b | S a|C b 
+          C-> a  aa   aaa
          ";
       var g = HeuristicLab.Grammars.Grammar.FromString(gStr);
-      Assert.AreEqual(g.StartSymbol, "S");
+      Assert.AreEqual(g.StartSymbol, new Symbol("S"));
       Assert.AreEqual(g.TerminalSymbols.Count(), 4);
-      Assert.AreEqual(g.NonTerminalSymbols.Count(), 3);
-      Assert.IsTrue(g.TerminalSymbols.Contains("aaa"));
-      Assert.IsTrue(g.TerminalSymbols.Contains("aa"));
-      Assert.IsTrue(g.NonTerminalSymbols.Contains("S"));
-      Assert.IsTrue(g.NonTerminalSymbols.Contains("B"));
-      Assert.IsTrue(g.NonTerminalSymbols.Contains("A"));
+      Assert.AreEqual(g.NonTerminalSymbols.Count(), 4);
+      Assert.IsTrue(g.TerminalSymbols.Contains(new Symbol("aaa")));
+      Assert.IsTrue(g.TerminalSymbols.Contains(new Symbol("aa")));
+      Assert.IsTrue(g.NonTerminalSymbols.Contains(new Symbol("S")));
+      Assert.IsTrue(g.NonTerminalSymbols.Contains(new Symbol("B")));
+      Assert.IsTrue(g.NonTerminalSymbols.Contains(new Symbol("C")));
+      Assert.IsTrue(g.NonTerminalSymbols.Contains(new Symbol("A")));
+    }
+
+
+    [TestMethod]
+    public void TestAttributedGrammar() {
+      var gStr =
+        @"S -> A
+          A<int a0, out int a1>->a B<a0, a1>
+          B<int a0, ref int a1> ->S b | S a|C<a0, a1> b 
+          C<int a0, ref int a1> -> a  aa   aaa
+         ";
+      var g = HeuristicLab.Grammars.AttributedGrammar.FromString(gStr);
+      Assert.AreEqual(g.StartSymbol, new Symbol("S"));
+      Assert.AreEqual(g.TerminalSymbols.Count(), 4);
+      Assert.AreEqual(g.NonTerminalSymbols.Count(), 4);
+      Assert.IsTrue(g.TerminalSymbols.Contains(new Symbol("aaa")));
+      Assert.IsTrue(g.TerminalSymbols.Contains(new Symbol("aa")));
+      Assert.IsTrue(g.NonTerminalSymbols.Contains(new Symbol("S")));
+      Assert.IsTrue(g.NonTerminalSymbols.Contains(new Symbol("B")));
+      Assert.IsTrue(g.NonTerminalSymbols.Contains(new Symbol("A")));
+      Assert.IsTrue(g.NonTerminalSymbols.Contains(new Symbol("C")));
+    }
+
+
+    [TestMethod]
+    public void TestLanguage() {
+      var gStr =
+        @"S -> a B | b A
+          A-> a | a S | b A A 
+          B -> b | b S | a B B
+         ";
+      var g = HeuristicLab.Grammars.Grammar.FromString(gStr);
+      var l = new Language(g);
+      var s2 = new string[][]
+        {
+          new string[] {"a", "b"},
+          new string[] {"b", "a"}
+        };
+      var s4 = new string[][]
+        {
+          new [] {"a", "a", "b", "b"},
+          new [] {"a", "b", "a", "b"},
+          new [] {"a", "b", "b", "a"},
+          new [] {"b", "b", "a", "a"},
+          new [] {"b", "a", "b", "a"},
+          new [] {"b", "a", "a", "b"}
+        };
+
+
+      var l2 = l.Where(s => s.Count() == 2).Take(2);
+      var l4 = l.Where(s => s.Count() == 4).Take(6);
+
+      Assert.IsTrue(l2.Intersect(s2, new SequenceComparer()).Count() == l2.Count());
+      Assert.IsTrue(l4.Intersect(s4, new SequenceComparer()).Count() == l4.Count());
+    }
+  }
+
+  public class SequenceComparer : IEqualityComparer<IEnumerable<string>> {
+    public bool Equals(IEnumerable<string> x, IEnumerable<string> y) {
+      return x.Count() == y.Count() &&
+        x.Zip(y, (s, t) => s == t).All(eq => eq);
+    }
+
+    public int GetHashCode(IEnumerable<string> obj) {
+      if (!obj.Any()) return 0;
+      else return obj.First().GetHashCode();
     }
   }