a couple of cosmetic corrections

tests/Combinator.hs

@@ -121,7 +121,6 @@ prop_endBy1 n' c = checkParser p r s
           | c == '-' && n == 0 = posErr 0 s [uneCh '-', exCh 'a']
           | c /= '-'           = posErr (g n) s $ uneCh c :
                                  [exCh '-' | n > 0] ++
-                                 -- [exEof    | n > 1] ++
                                  [exCh 'a' | n == 0]
           | otherwise = Right (replicate n 'a')
         s = intersperse '-' (replicate n 'a') ++ [c]

tests/Expr.hs

@@ -130,7 +130,7 @@ arbitraryN2 0 = Val . getNonNegative <$> arbitrary
 arbitraryN2 n = elements [Sum,Sub,Pro,Div,Exp] <*> leaf <*> leaf
   where leaf = arbitraryN0 (n `div` 2)
 
--- Some helpers put here since we don't want to depend on
+-- Some helpers are put here since we don't want to depend on
 -- "Text.Megaparsec.Lexer".
 
 lexeme :: MonadParsec s m Char => m a -> m a