haskell: Trivial reformatting.

Oh, and notice that we don't need flexible instances any more.

diff --git a/Makefile b/Makefile
index b79bf6a..6d4455d 100644 (file)
--- a/Makefile
+++ b/Makefile
@@ -70,7 +70,7 @@ c-fringe: c-fringe.o
 ### Haskell.
 
 HC                      = ghc
-HFLAGS                  = -O2 -XFlexibleInstances
+HFLAGS                  = -O2
 CLEANFILES             += *.hi *.hc
 .SUFFIXES: .hs
 .hs.o:; $(HC) -c $(HFLAGS) -o $@ $<

diff --git a/haskell-fringe.hs b/haskell-fringe.hs
index 4ca9a3e..f7aa711 100644 (file)
--- a/haskell-fringe.hs
+++ b/haskell-fringe.hs
@@ -1,13 +1,13 @@
--- -*-haskell-*-
---
--- Haskell implementation of a `same-fringe' solver.
+--- -*-haskell-*-
+---
+--- Haskell implementation of a `same-fringe' solver.
 
 import IO
 import System
 import Monad
 
 -----------------------------------------------------------------------------
--- Parser combinators.
+--- Parser combinators.
 
 -- A very simple parser monad.
 newtype Parser t a = Parser { runparse :: [t] -> Either String (a, [t]) }
@@ -56,7 +56,7 @@ eof = do
     _ -> fail "trailing junk"
 
 -----------------------------------------------------------------------------
--- Tree data type.
+--- Tree data type.
 
 data Tree a = Leaf | Node (Tree a) a (Tree a) deriving (Show)
 
@@ -85,7 +85,7 @@ parseTree cs = parse cs $ do t <- tree; eof; return t
       _ -> return Leaf
 
 -----------------------------------------------------------------------------
--- Main program.
+--- Main program.
 
 -- Report MSG as an error and quit.
 bail msg = do