Lots of bad TAB eliminations.

I started from tabs that are not on the beginning of lines, and in
several places I did further cleanings.

If you're worried about knowing who wrote some code, for example, if you
get to this commit in "git blame", then note that you can use the "-w"
flag in many git commands to ignore whitespaces.  For example, to see
per-line authors, use "git blame -w <file>".  Another example: to see
the (*much* smaller) non-whitespace changes in this (or any other)
commit, use "git log -p -w -1 <sha1>".

original commit: 672910f27b856549ad08d38832b6714edf226c8e

collects/parser-tools/private-yacc/graph.rkt

@@ -12,7 +12,7 @@
   ;; We use a hash-table to represent the result function 'a -> 'b set, so
   ;; the values of type 'a must be comparable with eq?.
   (define (digraph nodes edges f- union fail)
-    (letrec (
+    (letrec [
              ;; Will map elements of 'a to 'b sets
              (results (make-hash-table))
              (f (lambda (x) (hash-table-get results x fail)))
@@ -51,7 +51,7 @@
                         (set-N p +inf.0)
                         (hash-table-put! results p (f x))
                         (if (not (eq? x p))
-			    (loop (pop)))))))))
+                            (loop (pop))))))))]
       (for-each (lambda (x)
                   (if (= 0 (get-N x))
                       (traverse x)))
@@ -59,8 +59,3 @@
       f))
 
 )
-
-
-
-
-

collects/parser-tools/private-yacc/lalr.rkt

@@ -134,7 +134,6 @@
                (f (map follow l)))
           (apply bitwise-ior (cons 0 f))))))
 
-
   (define (print-DR dr a g)
     (print-input-st-sym dr "DR" a g print-output-terms))
   (define (print-Read Read a g)
@@ -230,7 +229,7 @@
   ;; Computes (f x) = (f- x) union Union{(f y) | y in (edges x)}
   ;; A specialization of digraph in the file graph.rkt
   (define (digraph-tk->terml nodes edges f- num-states)
-    (letrec (
+    (letrec [
              ;; Will map elements of trans-key to term sets represented as bit vectors
              (results (init-tk-map num-states))
              
@@ -269,13 +268,10 @@
                       (set-N p +inf.0)
                       (set-f p (get-f x))
                       (unless (equal? x p)
-                        (loop (pop)))))))))
+                        (loop (pop))))))))]
       (for-each (lambda (x)
                   (when (= 0 (get-N x))
                     (traverse x)))
                 nodes)
       get-f))
 )
-
-
-