Fix parsefuzz: Emit space between unary minusses

parsefuzz.scala

@@ -103,7 +103,7 @@ lazy val ReturnStatement: Node = "return " ++ Expression.? ++ ";\n    "
 lazy val Expression: Node =
   Ind(Expression) ++ " " ++ OneOf(List("!=", "*", "+", "-", "/", "<=", "<", "==", "=", ">=", ">", "%", "&&", "||")) ++ " " ++ Ind(Expression) |
   UnaryExpression
-lazy val UnaryExpression: Node = PostfixExpression | ("!" | "-") ++ Ind(UnaryExpression)
+lazy val UnaryExpression: Node = PostfixExpression | ("!" | "- ") ++ Ind(UnaryExpression)
 lazy val PostfixExpression: Node = PrimaryExpression ++ PostfixOp.*()
 lazy val PostfixOp: Node = MethodInvocation | FieldAccess | ArrayAccess
 lazy val MethodInvocation: Node = "." ++ IDENT ++ "(" ++ Arguments ++ ")"

pos-parser/sane1.mj

@@ -41,7 +41,7 @@ class z {
     ;
    a[] e;
     if (new boolean[false].f())
-    while (-7.k.n()[!5 - !!!!h % new t() < false != --!new a() - -false == true + u < false || -(!!true)][null].e().u.p())
+    while (-7.k.n()[!5 - !!!!h % new t() < false != - -!new a() - -false == true + u < false || -(!!true)][null].e().u.p())
     {
     return ;
 
@@ -51,7 +51,7 @@ int s;
 
   }
   public static void g(String[] k) {
-    while (----!!2)
+    while (- - - -!!2)
     {
     int d = -q;
     {
@@ -70,14 +70,14 @@ int s;
   }
 
   }
-boolean e = !-!-!true * new t() && new int[---new x[o()] >= -true / (-false) / this % !-(!4) != -this].q() < this || z(!w);
+boolean e = !-!-!true * new t() && new int[- - -new x[o()] >= -true / (-false) / this % !-(!4) != -this].q() < this || z(!w);
 
   }
   public void m;
   public static void p(String[] d) {
     return ;
     int z;
-    int k = !-new boolean[!--!m() && s()[8][(!--g) / -!this == new int[2 || new int[-(-this < 1)] < 3 < 5 || !new int[-!!-new g()] + -f <= -3] >= !true < new boolean[!-null]].u][];
+    int k = !-new boolean[!- -!m() && s()[8][(!- -g) / -!this == new int[2 || new int[-(-this < 1)] < 3 < 5 || !new int[-!!-new g()] + -f <= -3] >= !true < new boolean[!-null]].u][];
 
   }
   public static void a(String[] e) {
@@ -94,7 +94,7 @@ class g {
 
   }
   public g[] c(boolean l, d x) {
-    while (i()[!---b()].z.h.k())
+    while (i()[!- - -b()].z.h.k())
     return -this <= 4[z[d() % -(r()) + 9 || c].i];
 
   }
@@ -114,7 +114,7 @@ class i {
   public int d(k v, void[][][] x) {
     a v;
     {
-    !a(null, this, --null)[!!true < 8].i.o().y[new int[new boolean[-n()] % 9 % --k()] % true == -j()];
+    !a(null, this, - -null)[!!true < 8].i.o().y[new int[new boolean[-n()] % 9 % - -k()] % true == -j()];
 
   }
 
@@ -139,7 +139,7 @@ class u {
 
   }
   public void y() {
-    while ((!(2).u() = null[v() == b() + (this) * new r() && !--!(false == null) = !!new int[this != null > !m() / !w] = !6 <= false >= 0 + true * (3) = !-!6 = new c()] >= new int[l][][]))
+    while ((!(2).u() = null[v() == b() + (this) * new r() && !- -!(false == null) = !!new int[this != null > !m() / !w] = !6 <= false >= 0 + true * (3) = !-!6 = new c()] >= new int[l][][]))
     ;
 
   }