Turn isLink final

Author: AngledLuffa

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

@@ -33,7 +33,7 @@ public class NodePattern extends SemgrexPattern  {
    */
   private final Map<String, Pair<Object, Object>> attributes;
   private final boolean isRoot;
-  private boolean isLink;
+  private final boolean isLink;
   private final boolean isEmpty;
   private final String name;
   private String descString;
@@ -44,18 +44,19 @@ public class NodePattern extends SemgrexPattern  {
 
   public NodePattern(GraphRelation r, boolean negDesc,
                      Map<String, String> attrs,
-                     boolean root, boolean empty, String name) {
-    this(r, negDesc, attrs, root, empty, name,
+                     boolean root, boolean empty, boolean isLink, String name) {
+    this(r, negDesc, attrs, root, empty, isLink, name,
             new ArrayList<>(0));
   }
 
   // TODO: there is no capacity for named variable groups in the parser right now
   public NodePattern(GraphRelation r, boolean negDesc,
                      Map<String, String> attrs,
-                     boolean root, boolean empty, String name,
+                     boolean root, boolean empty, boolean isLink, String name,
                      List<Pair<Integer, String>> variableGroups) {
     this.reln = r;
     this.negDesc = negDesc;
+    this.isLink = isLink;
     // order the attributes so that the pattern stays the same when
     // printing a compiled pattern
     attributes = new LinkedHashMap<>();
@@ -193,10 +194,6 @@ public boolean nodeAttrMatch(IndexedWord node, final SemanticGraph sg, boolean i
     return !negDesc;
   }
 
-  public void makeLink() {
-    isLink = true;
-  }
-
   public boolean isRoot() {
     return isRoot;
   }

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

@@ -615,8 +615,7 @@ final public SemgrexPattern Root() throws ParseException {// Root pattern for th
       jj_la1[27] = jj_gen;
       ;
     }
-pat = new NodePattern(r, underNodeNegation, attributes.attributes(), attributes.root(), attributes.empty(), name != null ? name.image : null);
-           if (link) pat.makeLink();
+pat = new NodePattern(r, underNodeNegation, attributes.attributes(), attributes.root(), attributes.empty(), link, name != null ? name.image : null);
           {if ("" != null) return pat;}
     throw new Error("Missing return statement in function");
 }

src/edu/stanford/nlp/semgraph/semgrex/SemgrexParser.jj

@@ -304,8 +304,7 @@ NodePattern Description(GraphRelation r) : {
             }
 	  )?
 	)
-  	{ pat = new NodePattern(r, underNodeNegation, attributes.attributes(), attributes.root(), attributes.empty(), name != null ? name.image : null);
-	   if (link) pat.makeLink();
+  	{ pat = new NodePattern(r, underNodeNegation, attributes.attributes(), attributes.root(), attributes.empty(), link, name != null ? name.image : null);
 	  return pat;
 	}
 }