... also fix the optional output for disjunctions

stanfordnlp · Jul 17, 2023 · 8659653 · 8659653
1 parent a9965b2
commit 8659653
Show file tree

Hide file tree

Showing 2 changed files with 7 additions and 1 deletion.
diff --git a/src/edu/stanford/nlp/trees/tregex/CoordinationPattern.java b/src/edu/stanford/nlp/trees/tregex/CoordinationPattern.java
@@ -58,12 +58,15 @@ public String toString() {
       if (isNegated()) {
         sb.append("!");
       }
+      if (isOptional()) {
+        sb.append("?");
+      }
       sb.append('[');
       for (Iterator<TregexPattern> iter = children.iterator(); iter.hasNext();) {
         TregexPattern node = iter.next();
         sb.append(node.toString());
         if (iter.hasNext()) {
-          sb.append(" |");
+          sb.append(" | ");
         }
       }
       sb.append(']');

diff --git a/test/src/edu/stanford/nlp/trees/tregex/TregexTest.java b/test/src/edu/stanford/nlp/trees/tregex/TregexTest.java
@@ -1566,6 +1566,9 @@ public void testOptionalToString() {
 
     pattern = TregexPattern.compile("A ?< B");
     assertEquals("Root (A ?< B )", pattern.toString());
+
+    pattern = TregexPattern.compile("A ?[< B | < C]");
+    assertEquals("Root (A ?[< B  | < C ])", pattern.toString());
   }
 
   /**