Get started connected edges to the VariableStrings as well. This gonna suck, considering how many relations need to be edited... probably the satisfies() and iterate() methods both need updates

Author: AngledLuffa

src/edu/stanford/nlp/semgraph/semgrex/GraphRelation.java

@@ -255,7 +255,7 @@ void initialize() {
   // GOVERNOR graph relation: ">" ===============================================
 
   static private class GOVERNOR extends GraphRelation {
-    GOVERNOR(String reln, String name, String edgeName) {
+    GOVERNOR(String reln, String name, String edgeName, List<Pair<Integer,String>> varGroups) {
       super(">", reln, name, edgeName);
     }
 
@@ -1453,31 +1453,35 @@ public static boolean isKnownRelation(String reln) {
   public static GraphRelation getRelation(String reln,
                                           String type,
                                           String name,
-                                          String edgeName) throws ParseException {
+                                          String edgeName,
+                                          List<Pair<Integer,String>> varGroups) throws ParseException {
     if (reln == null && type == null)
       return null;
     if (!isKnownRelation(reln)) {
       throw new ParseException("Unknown relation " + reln);
     }
     switch (reln) {
       case ">":
-        return new GOVERNOR(type, name, edgeName);
+        return new GOVERNOR(type, name, edgeName, varGroups);
       case ">++":
-        return new GOVERNOR_RIGHT(type, name, edgeName);
+        return new GOVERNOR_RIGHT(type, name, edgeName, varGroups);
       case ">--":
-        return new GOVERNOR_LEFT(type, name, edgeName);
+        return new GOVERNOR_LEFT(type, name, edgeName, varGroups);
       case "<":
-        return new DEPENDENT(type, name, edgeName);
+        return new DEPENDENT(type, name, edgeName, varGroups);
       case "<++":
-        return new DEPENDENT_RIGHT(type, name, edgeName);
+        return new DEPENDENT_RIGHT(type, name, edgeName, varGroups);
       case "<--":
-        return new DEPENDENT_LEFT(type, name, edgeName);
+        return new DEPENDENT_LEFT(type, name, edgeName, varGroups);
       case "<>":
-        return new CONNECTED(type, name, edgeName);
+        return new CONNECTED(type, name, edgeName, varGroups);
     }
     if (edgeName != null) {
       throw new ParseException("Relation " + reln + " does not allow for named edges");
     }
+    if (varGroups.size() != 0) {
+      throw new ParseException("Relation " + reln + " does not allow for capturing variable groups");
+    }
     switch (reln) {
       case ">>":
         return new GRANDPARENT(type, name);