typos

Author: Eric Lindblad

data/AlexWrappers.hs

@@ -145,7 +145,7 @@ alexGetByte (AlexInput {alexStr=cs,alexBytePos=n}) =
 -- Token positions
 
 -- `Posn' records the location of a token in the input text.  It has three
--- fields: the address (number of chacaters preceding the token), line number
+-- fields: the address (number of characters preceding the token), line number
 -- and column of a token within the file. `start_pos' gives the position of the
 -- start of the file and `eof_pos' a standard encoding for the end of file.
 -- `move_pos' calculates the new position after traversing a given character,

src/DFA.hs

@@ -132,7 +132,7 @@ nfa2pdfa nfa pdfa (ss:umkd)
 
         accs = sort_accs [acc| s<-ss, acc<-nst_accs (nfa!s)]
 
--- `sort_accs' sorts a list of accept values into decending order of priority,
+-- `sort_accs' sorts a list of accept values into descending order of priority,
 -- eliminating any elements that follow an unconditional accept value.
 
 sort_accs:: [Accept a] -> [Accept a]

src/DFS.hs

@@ -76,10 +76,10 @@ reverse_graph:: Graph -> Graph
 reverse_graph g@(sz,_) = mk_graph sz (rev_edges g)
 
 
--- `t_close' takes the transitive closure of a graph; `scc' returns the stronly
--- connected components of the graph and `top_sort' topologically sorts the
--- graph.  Note that the array is given one more element in order to avoid
--- problems with empty arrays.
+-- `t_close' takes the transitive closure of a graph; `scc' returns the
+-- strongly connected components of the graph and `top_sort' topologically
+-- sorts the graph.  Note that the array is given one more element in order
+-- to avoid problems with empty arrays.
 
 t_close:: Graph -> Graph
 t_close g@(sz,_) = (sz,\v->ar!v)

src/NFA.hs

@@ -5,7 +5,7 @@
 -- (c) Chris Dornan 1995-2000, Simon Marlow 2003
 --
 -- The `scanner2nfa' takes a `Scanner' (see the `RExp' module) and
--- generates its equivelent nondeterministic finite automaton.  NFAs
+-- generates its equivalent nondeterministic finite automaton.  NFAs
 -- are turned into DFAs in the DFA module.
 -- 
 -- See the chapter on `Finite Automata and Lexical Analysis' in the

src/Output.hs

@@ -4,7 +4,7 @@
 --
 -- (c) Simon Marlow 2003
 --
--- Code-outputing and table-generation routines
+-- Code-outputting and table-generation routines
 --
 -- ----------------------------------------------------------------------------}
 

src/ParseMonad.hs

@@ -57,7 +57,7 @@ alexGetByte (p,_,[],(c:s))  = let p' = alexMove p c
 -- Token positions
 
 -- `Posn' records the location of a token in the input text.  It has three
--- fields: the address (number of charaters preceding the token), line number
+-- fields: the address (number of characters preceding the token), line number
 -- and column of a token within the file. `start_pos' gives the position of the
 -- start of the file and `eof_pos' a standard encoding for the end of file.
 -- `move_pos' calculates the new position after traversing a given character,