regenerate .nw from parsed .nw via syncweb -merge_files

arch/dummy/dummy.nw

@@ -331,7 +331,7 @@ let simple =
 
 The [[return]] instruction for a possibly alternate return.
 
-<<calling convention>>= 
+<<calling convention>>=
 let return k n ~ra =
     if k = 0 && n = 0 
     then store pc ra

arch/mips/mipscall.nw

@@ -321,7 +321,7 @@ let spec =
 @
 <<mipscall.ml>>=
 let c' ~return_to cut auto =
-    <<callspec specification>> 
+    <<callspec specification>>
     in
     let t = CS.to_call cut (rtn return_to) auto spec in
         { t with (* fix what callspec got wrong *)

arch/mips/mipsrec.nw

@@ -419,7 +419,7 @@ and loc = function
     | RP.Slice _                -> error "cannot handle slice"
 @
 
-<<tail>>= 
+<<tail>>=
 let effect = function
     <<special cases for [[Store]]>>
     | RP.Store(l,e,w)           -> conStore (loc l) (exp e) w

arch/x86/x86asm.nw

@@ -210,7 +210,7 @@ method value (v:Bits.bits) =
 <<utilities>>=
 let mask32 = Int64.pred (Int64.shift_left Int64.one 32)
 @ 
-<<assembly methods>>=            
+<<assembly methods>>=
 method addr a =
   match Reloc.if_bare a with
   | Some b -> this#value b

front_ir/opshape.nw

@@ -201,14 +201,14 @@ let shape scheme = match scheme with
 | [
    <<'a>>
    ; 
-   <<'a>>           
+   <<'a>>
     ], 
-    <<'a>>               
+    <<'a>>
     -> Binop ((), ())
 | [
    <<'a>>
     ], 
-    <<'a>>               
+    <<'a>>
    -> Unop ()
 | [
    <<'a>>

front_ir/proc.nw

@@ -101,9 +101,9 @@ incoming overflow results, some deallocated by the
 \end{itemize}
 
 <<proc.mli>>=
-<<type t>> 
+<<type t>>
 @ 
 
-<<proc.ml>>= 
-<<type t>> 
+<<proc.ml>>=
+<<type t>>
 @

front_nelab/elabstmt.nw

@@ -256,7 +256,7 @@ let arm (rgs, ss) =
     | [] -> E.error "case arm has an empty range list"
     | (rg, w) :: rgs ->
         let strip w (rg, w') = if w = w' then rg else 
-         <<exn on range type mismatch>> 
+         <<exn on range type mismatch>>
         in
         ((rg :: List.map (strip w) rgs), ss), w) in
 @ 
@@ -266,11 +266,11 @@ We check this requirement and strip the width off everything in sight.
 <<elaboration utilities>>=
 let striprange w (rg, w') =
   if w = w' then rg else 
-   <<exn on case range type mismatch>> 
+   <<exn on case range type mismatch>>
    in
 let striparms w =
   let strip (arm, w') = if w = w' then arm else  
-    <<exn on arm type mismatch>> 
+    <<exn on arm type mismatch>>
   in
   List.map strip in
 @ 
@@ -312,7 +312,7 @@ let assign lhs rhs =
   try E.ematch (E.Raise.list (List.map2 effect lhs rhs)) (fun es ->
     Assign (vrtl (srcmap, r) (Rtl.par es)))
   with Invalid_argument _ -> 
-   <<complain about length mismatch in assignment>> 
+   <<complain about length mismatch in assignment>>
   in
 @ 
 <<elaboration utilities>>=

front_rtl/types.nw

@@ -192,7 +192,7 @@ type size = Const  of int
 @ 
 
 <<types.ml>>=
-<<exported type definitions>>  
+<<exported type definitions>>
  (* types from the interface definition *)
 @
 \emph{Rather than having a fixed operator [[Double]] we could implement a

front_zipcfg/zipcfg.nw

@@ -504,7 +504,7 @@ module Blocks : BLOCKS with type t = block UM.t = struct
   let iter = UM.iter
 end
 @ 
-<<zipcfg.ml>>=  
+<<zipcfg.ml>>=
 type graph  = Blocks.t
 type zgraph = zblock * Blocks.t
 type nodes   = zgraph -> zgraph (* sequence of nodes in Hughes's representation *)