1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
|
%-------------------------------= --------------------------------------------
\subsection{Main program}
%-------------------------------= --------------------------------------------
%if codeOnly || showModuleHeader
> module Main ( main )
> where
>
> import Data.Char ( isSpace )
> import Data.List ( isPrefixOf )
> import System.IO ( hClose, hFlush, stderr, stdout, openFile, IOMode(..), Handle(..) )
> import System.IO.UTF8 ( hPutStr, hPutStrLn, hGetLine )
> import System.Directory ( copyFile )
> import System.Console.GetOpt
> import Text.Regex ( matchRegex, mkRegexWithOpts )
> import System.Environment
> import System.Exit
> import System.Process
> import Version
> import Control.Monad
>
> -- import IOExts
> import TeXCommands
> import TeXParser
> import qualified Verbatim
> import qualified Typewriter
> import qualified Math
> import qualified MathPoly as Poly
> import qualified NewCode
> import Directives
> import Document
> import StateT
> import qualified FiniteMap as FM
> import Auxiliaries
> import Value
>
> import FileNameUtils
> --import Directory
%endif
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
\subsubsection{Main loop}
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
> main :: IO ()
> main = getArgs >>= main'
> main' :: [String] -> IO ()
> main' args = case getOpt Permute options args of
> (o,n,[]) -> do (flags,initdirs,styles)
> <- foldM (\(s,d,x) (sf,df,ns) -> do s' <- sf s
> return (s',df d,ns ++ x))
> (state0,[],[]) o
> case reverse styles of
> [] -> lhs2TeX Poly flags (reverse initdirs) n
> -- ks, 22.11.2005, changed default style to |Poly|
> [Help] -> quitSuccess (usageInfo uheader options)
> [SearchPath] -> quitSuccess (init . unlines $ searchPath)
> [Version] -> quitSuccess programInfo
> [Copying] -> quitSuccess (programInfo ++ "\n\n" ++ copying)
> [Warranty] -> quitSuccess (programInfo ++ "\n\n" ++ warranty)
> [Pre] | length n >= 3 -> preprocess flags (reverse initdirs) False n -- used as preprocessor -pgmF -F
> [Pre,Help] | length n >= 3 -> preprocess flags (reverse initdirs) True n -- used as literate preprocessor -pgmL
> [s] -> lhs2TeX s flags (reverse initdirs) n
> _ -> quitError (incompatibleStylesError styles)
> when (output flags /= stdout) (hClose (output flags))
> (_,_,errs) -> do hPutStrLn stderr $ (concat errs)
> hPutStrLn stderr $ "Trying compatibility mode option handling ..."
> cstyle args
> where
> quitSuccess s = do hPutStrLn stdout $ s
> exitWith ExitSuccess
> quitError s = do hPutStrLn stderr $ usageInfo (s ++ "\n" ++ uheader) options
> exitFailure
> incompatibleStylesError ss = "only one style allowed from: "
> ++ unwords (map (\s -> "--" ++ decode s) ss) ++ "\n"
> type Formatter = XIO Exc State ()
State.
> type CondInfo = (FilePath, LineNo, Bool, Bool)
> data State = State { style :: Style,
> lang :: Lang,
> verbose :: Bool,
> searchpath :: [FilePath],
> file :: FilePath, -- also used for `hugs'
> lineno :: LineNo,
> ofile :: FilePath,
> olineno :: LineNo,
> atnewline :: Bool,
> fldir :: Bool, -- file/linenumber directives
> pragmas :: Bool, -- generate LINE pragmas?
> output :: Handle,
> opts :: String, -- options for `hugs'
> files :: [(FilePath, LineNo)], -- includees (?)
> path :: FilePath, -- for relative includes
> fmts :: Formats,
> subst :: Substs,
> stack :: [Formats], -- for grouping
> toggles :: Toggles, -- @%let@ defined toggles
> conds :: [CondInfo], -- for conditional directives
> align :: Maybe Int, -- math: internal alignment column
> stacks :: (Math.Stack, Math.Stack), -- math: indentation stacks
> separation :: Int, -- poly: separation
> latency :: Int, -- poly: latency
> pstack :: Poly.Stack, -- poly: indentation stack
> externals :: Externals -- handles for external processes (hugs,ghci)
> }
Initial state.
> state0 :: State
> state0 = State { lang = Haskell,
> verbose = False,
> searchpath = searchPath,
> lineno = 0,
> olineno = 0,
> atnewline = True,
> fldir = False,
> pragmas = True,
> output = stdout,
> opts = "",
> files = [],
> path = "",
> fmts = FM.empty,
> subst = FM.empty,
> stack = [],
> conds = [],
> align = Nothing,
> stacks = ([], []),
> separation = 2,
> latency = 2,
> pstack = [],
> -- ks, 03.01.04: added to prevent warnings during compilation
> style = error "uninitialized style",
> file = error "uninitialized filename",
> ofile = error "uninitialized filename",
> toggles = error "uninitialized toggles",
> externals = FM.empty
> }
> initState :: Style -> FilePath -> [FilePath] -> State -> State
> initState sty filePath ep s = s { style = sty,
> file = filePath,
> ofile = filePath,
> searchpath = ep,
> toggles = FM.fromList toggles0
> }
> where toggles0 = --[(decode CodeOnly, Bool (sty == CodeOnly))]
> [("style", Int (fromEnum sty))]
> ++ [("version", Int numversion)]
> ++ [("pre", Int pre)]
> ++ [("lang", Int (fromEnum (lang s)))]
> ++ [ (decode s, Int (fromEnum s)) | s <- [(minBound :: Style) .. maxBound] ]
> ++ [ (decode s, Int (fromEnum s)) | s <- [(minBound :: Lang) .. maxBound] ]
> -- |++ [ (s, Bool False) || s <- ["underlineKeywords", "spacePreserving", "meta", "array", "latex209", "times", "euler" ] ]|
> preprocess :: State -> [Class] -> Bool -> [String] -> IO ()
> preprocess flags dirs lit (f1:f2:f3:_)
> = if (f1 == f2) && not lit
> then copyFile f2 f3
> else do c <- readFile f1
> case matchRegex (mkRegexWithOpts "^%include" True False) c of
> Nothing -> if lit then
> do h <- openFile f3 WriteMode
> lhs2TeX NewCode (flags { output = h }) (Directive Include "lhs2TeX.fmt" : dirs) [f1]
> hClose h
> else copyFile f2 f3
> Just _ -> -- supposed to be an lhs2TeX file
> do h <- openFile f3 WriteMode
> lhs2TeX NewCode (flags { output = h }) dirs [f1]
> hClose h
> preprocess _ _ _ _ = error "preprocess: too few arguments"
> lhs2TeX :: Style -> State -> [Class] -> [String] -> IO ()
> lhs2TeX s flags dirs files = do (str, file) <- input files
> expandedpath <- expandPath (searchpath flags)
> toIO (do store (initState s file expandedpath flags)
> formats (map (No 0) dirs) `handle` abort
> formatStr (addEndEOF str)
> stopexternals)
> where addEndEOF = (++"%EOF\n") . unlines . lines
> input :: [String] -> IO (String, FilePath)
> input [] = do s <- getContents; return (s, "<stdin>")
> input ["-"] = do s <- getContents; return (s, "<stdin>")
> input (filePath : _) = do chaseFile [] filePath
Converting command line options into directives.
> uheader :: String
> uheader = "lhs2TeX [ options ] files\n\nAvailable options:\n"
ks, 20.07.2003: The short option for @--align@ has been changed into @-A@. Otherwise
@-align@ would not trigger compatibility mode, but be interpreted as a valid option
usage.
ks, 24.03.2004: The long option @--verbose@ has been removed for now,
because with some versions of GHC it triggers ambiguity errors with
@--verb@.
> options :: [OptDescr (State -> IO State,[Class] -> [Class],[Style])]
> options =
> [ Option ['h','?'] ["help"](NoArg (return, id, [Help])) "get this help"
> , Option ['v'] [] {- ["verbose"] -}
> (NoArg (\s -> return $ s { verbose = True }, id, [])) "be verbose"
> , Option ['V'] ["version"] (NoArg (return, id, [Version])) "show version"
> , Option [] ["tt"] (NoArg (return, id, [Typewriter])) "typewriter style"
> , Option [] ["math"] (NoArg (return, id, [Math])) "math style"
> , Option [] ["poly"] (NoArg (return, id, [Poly])) "poly style (default)"
> , Option [] ["code"] (NoArg (return, id, [CodeOnly])) "code style"
> , Option [] ["newcode"] (NoArg (return, id, [NewCode])) "new code style"
> , Option [] ["verb"] (NoArg (return, id, [Verb])) "verbatim"
> , Option [] ["haskell"] (NoArg (\s -> return $ s { lang = Haskell}, id, [])) "Haskell lexer (default)"
> , Option [] ["agda"] (NoArg (\s -> return $ s { lang = Agda}, id, [])) "Agda lexer"
> , Option [] ["pre"] (NoArg (return, id, [Pre])) "act as ghc preprocessor"
> , Option ['o'] ["output"] (ReqArg (\f -> (\s -> do h <- openFile f WriteMode
> return $ s { output = h }, id, [])) "file") "specify output file"
> , Option [] ["file-directives"]
> (NoArg (\s -> return $ s { fldir = True }, id, [])) "generate %file directives"
> , Option [] ["no-pragmas"]
> (NoArg (\s -> return $ s { pragmas = False }, id, [])) "no LINE pragmas"
> , Option ['A'] ["align"] (ReqArg (\c -> (return, (Directive Align c:), [])) "col") "align at <col>"
> , Option ['i'] ["include"] (ReqArg (\f -> (return, (Directive Include f:), [])) "file") "include <file>"
> , Option ['l'] ["let"] (ReqArg (\s -> (return, (Directive Let s:), [])) "equation") "assume <equation>"
> , Option ['s'] ["set"] (ReqArg (\s -> (return, (Directive Let (s ++ "=True"):), [])) "flag") "set <flag>"
> , Option ['u'] ["unset"] (ReqArg (\s -> (return, (Directive Let (s ++ "=False"):), [])) "flag") "unset <flag>"
> , Option ['P'] ["path"] (ReqArg (\p -> (\s -> return $ s { searchpath = modifySearchPath (searchpath s) p }, id , [])) "path")
> "modify search path"
> , Option [] ["searchpath"]
> (NoArg (return, id, [SearchPath])) "show searchpath"
> , Option [] ["copying"] (NoArg (return, id, [Copying])) "display license"
> , Option [] ["warranty"](NoArg (return, id, [Warranty])) "info about warranty"
> ]
>
> formatStr :: String -> Formatter
> formatStr str = formats (texparse 1 str) `handle` abort
Compatibility mode option handling.
> cstyle :: [String] -> IO ()
> cstyle args@(('-':a) : x) = case encode a of
> Just sty -> cstyle' sty x
> Nothing -> cstyle' Typewriter args
> cstyle args = cstyle' Typewriter args
> cstyle' :: Style -> [String] -> IO ()
> cstyle' s args = let (dirs,files) = coptions args
> in lhs2TeX s state0 dirs files
> coptions :: [String] -> ([Class], [String])
> coptions = foldr (<|) ([], [])
> where
> "-align" <| (ds, s : as) = (Directive Align s : ds, as)
> "-i" <| (ds, s : as) = (Directive Include s : ds, as)
> "-l" <| (ds, s : as) = (Directive Let s : ds, as)
> ('-' : 'i' : s) <| (ds, as) = (Directive Include s : ds, as)
> ('-' : 'l' : s) <| (ds, as) = (Directive Let s : ds, as)
> s <| (ds, as) = (ds, s : as)
We abort immediately if an error has occured.
> abort :: Exc -> Formatter
> abort (msg, context) = do st <- fetch
> fromIO (hPutStrLn stderr (text st))
> fromIO (exitWith (ExitFailure 1))
> where text st = "*** Error in " ++ at (file st) (lineno st) ++ ": \n"
> ++ unlines [ "included from " ++ at f l | (f, l) <- (files st) ]
> ++ msg ++ "\n"
> ++ unlines (take 4 (lines context))
> at f n = "file " ++ f ++ " line " ++ show n
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
\subsubsection{Formatting}
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
> formats :: [Numbered Class] -> Formatter
> formats [] = return ()
> formats (No n (Directive d s) : ts)
> | conditional d = do update (\st -> st{lineno = n})
> st <- fetch
> directive (lang st)
> d s (file st,n)
> (conds st) (toggles st) ts
> formats (No n t : ts) = do update (\st -> st{lineno = n})
> format t
> formats ts
> format :: Class -> Formatter
> -- |format (Many ('%' : '%' : _)) = return ()| -- @%%@-Kommentare werden entfernt
> format (Many s) = out (Text s)
> format (Inline s) = inline s
> format (Command Hs s) = inline s
> format (Command (Vrb b) s) = out (Verbatim.inline b s)
> format (Command Eval s) = do st <- fetch
> when (not (style st `elem` [CodeOnly,NewCode])) $
> do result <- external (map unNL s)
> inline result
> format (Command Perform s) = do st <- fetch
> when (not (style st `elem` [CodeOnly,NewCode])) $
> do result <- external s
> out (Text (trim result))
> where
Remove trailing blank line.
> trim = reverse .> skip .> reverse
>
> skip s | all isSpace t = u
> | otherwise = s
> where (t, u) = breakAfter (== '\n') s
> format (Environment Haskell_ s)
> = display s
> format (Environment Code s) = display s
> format (Environment Spec s) = do st <- fetch
> when (not (style st `elem` [CodeOnly,NewCode])) $
> display s
> format (Environment Evaluate s )
> = do st <- fetch
> result <- external (map unNL s)
> --fromIO (hPutStrLn stderr result) -- TEST
> display result
> format (Environment Hide s) = return ()
> format (Environment Ignore s) = return ()
> format (Environment (Verbatim b) s)
> = out (Verbatim.display 120 b s)
> format (Directive Format s) = do st <- fetch
> b@(n,e) <- fromEither (parseFormat (lang st) s)
> store (st{fmts = FM.add b (fmts st)})
> format (Directive Subst s) = do st <- fetch
> b <- fromEither (parseSubst (lang st) s)
> store (st{subst = FM.add b (subst st)})
> format (Directive Include arg)= do st <- fetch
> let d = path st
> let sp = searchpath st
> update (\st@State{file = f', lineno = l'} ->
> st{file = f, files = (f', l') : files st, path = d ++ dir f})
> -- |d <- fromIO getCurrentDirectory|
> -- |fromIO (setCurrentDirectory (dir f))|
> (str,f) <- fromIO (chaseFile sp (d ++ f))
> update (\st -> st { file = f })
> fromIO (when (verbose st) (hPutStr stderr $ "(" ++ f))
> formatStr (addEndNL str)
> -- |fromIO (setCurrentDirectory d)|
> update (\st'@State{files = (f, l) : fs} ->
> st'{file = f, lineno = l, files = fs, path = d})
> fromIO (when (verbose st) (hPutStrLn stderr $ ")"))
> where f = withoutSpaces arg
> addEndNL = (++"\n") . unlines . lines
ks, 25.01.2003: If added the above function at the suggestion of NAD, but
I am not completely sure if this is the right thing to do. Maybe we should
strip blank lines from the end of a file as well, maybe we should do nothing
at all. Hard to say what people think is intuitive. Anyway, the reason why
I added it is this: if an %include directive is immediately followed
by another line and the included file does not end in a blank line, then
there will not be a single space between the last character of the included
file and the first character of the following line. It would be possible
to split a TeX control sequence over two different files that way. Seems
strange. So we add a newline, or even two if none has been there before,
to make sure that exactly one linebreak ends up in the output, but not
more, as a double newline is interpreted as a \par by TeX, and that might
also not be desired.
> format (Directive Begin _) = update (\st -> st{stack = fmts st : stack st})
> format (Directive End _) = do st <- fetch
> when (null (stack st)) $
> do fromIO (hPutStrLn stderr $ "unbalanced %} in line "
> ++ show (lineno st))
> update (\st -> st{stack = [fmts st]})
> update (\st@State{stack = d:ds} -> st{fmts = d, stack = ds})
ks, 11.09.03: added exception handling for unbalanced grouping
\Todo{|toggles| should be saved, as well.}
> format (Directive Let s) = do st <- fetch
> t <- fromEither (define (lang st) (toggles st) s)
> store st{toggles = FM.add t (toggles st)}
> format (Directive Align s)
> | all isSpace s = update (\st -> st{align = Nothing, stacks = ([], [])})
> | otherwise = update (\st -> st{align = Just (read s), stacks = ([], [])})
\NB @%align@ also resets the left identation stacks.
Also, the @poly@ directives @%separation@ and @%latency@ reset
the corresponding indentation stack |pstack|.
> format (Directive Separation s )
> = update (\st -> st{separation = read s, pstack = []})
> format (Directive Latency s) = update (\st -> st{latency = read s, pstack = []})
> format (Directive File s) = update (\st -> st{file = withoutSpaces s})
> format (Directive Options s) = update (\st -> st{opts = trim s})
> where trim = dropWhile isSpace .> reverse .> dropWhile isSpace .> reverse
> format (Error exc) = raise exc
Printing documents.
%{
%format d1
%format d2
> eject :: Doc -> Formatter
> eject Empty = return ()
> eject (Text s) = do st <- fetch
> let (ls,enl) = checkNLs 0 s
> when (fldir st && not (null s) && atnewline st && (ofile st /= file st || olineno st /= lineno st)) $
> do fromIO (hPutStr (output st) ("%file " ++ show (lineno st) ++ " " ++ (show $ file st) ++ "\n"))
> store (st { ofile = file st, olineno = lineno st })
>
> fromIO (hPutStr (output st) s)
> update (\st -> st { olineno = olineno st + ls, atnewline = enl (atnewline st)})
> where
> checkNLs n ('\n':[]) = (n+1,const True)
> checkNLs n (_:[]) = (n,const False)
> checkNLs n [] = (n,id)
> checkNLs n ('\n':xs) = checkNLs (n+1) xs
> checkNLs n (_:xs) = checkNLs n xs
> eject (d1 :^: d2) = eject d1 >> eject d2
> eject (Embedded s) = formatStr s
> eject (Sub s ds) = do st <- fetch; substitute (subst st)
> where
> substitute d = case FM.lookup s d of
> Nothing -> raise (undef s, "")
> Just sub -> eject (sub ds)
>
> undef :: String -> String
> undef s = "`" ++ s ++ "' is not defined;\n\
> \perhaps you forgot to include \"lhs2TeX.fmt\"?"
%}
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
\subsubsection{Style dependent formatting}
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
> out :: Doc -> Formatter
> out d = do st <- fetch; eject (select (style st))
> where select CodeOnly = Empty
> select NewCode = Empty
> select _ = d
> inline, display :: String -> Formatter
> inline s = do st <- fetch
> d <- fromEither (select (style st) st)
> eject d
> where select Verb st = Right (Verbatim.inline False s)
> select Typewriter st = Typewriter.inline (lang st) (fmts st) s
> select Math st = Math.inline (lang st) (fmts st) (isTrue (toggles st) auto) s
> select Poly st = Poly.inline (lang st) (fmts st) (isTrue (toggles st) auto) s
> select CodeOnly st = return Empty
> select NewCode st = return Empty -- generate PRAGMA or something?
> display s = do st <- fetch
> (d, st') <- fromEither (select (style st) st)
> store st'
> eject d
> where select Verb st = return (Verbatim.display 120 False s, st)
> select Typewriter st = do d <- Typewriter.display (lang st) (fmts st) s; return (d, st)
> select Math st = do (d, sts) <- Math.display (lang st) (fmts st) (isTrue (toggles st) auto) (stacks st) (align st) s
> return (d, st{stacks = sts})
> select Poly st = do (d, pstack') <- Poly.display (lang st) (fmts st) (isTrue (toggles st) auto) (separation st) (latency st) (pstack st) s
> return (d, st{pstack = pstack'})
> select NewCode st = do d <- NewCode.display (lang st) (fmts st) s
> let p = sub'pragma $ Text ("LINE " ++ show (lineno st + 1) ++ " " ++ show (takeFileName $ file st))
> return ((if pragmas st then ((p <> sub'nl) <>) else id) d, st)
> select CodeOnly st = return (Text (trim s), st)
> auto = "autoSpacing"
> isTrue togs s = bool (value togs s)
Delete leading and trailing blank line (only the first!).
> trim :: String -> String
> trim = skip .> reverse .> skip .> reverse
> where
> skip :: String -> String
> skip "" = ""
> skip s | all isSpace t = u
> | otherwise = s
> where (t, u) = breakAfter (== '\n') s
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
\subsubsection{Conditional directives}
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
A stack of Boolean values holds the conditions of
@%if@-directives. Perhaps surpsingly, each @%if@ gives rise
to \emph{two} entries; if @%elif@ is not used the second entry is
always |True|, otherwise it holds the negation of all previous
conditions of the current @%if@-chain.
ks, 16.08.2004: At the end of the input, we might want to check for unbalanced if's or
groups.
> directive :: Lang -> Directive -> String
> -> (FilePath,LineNo) -> [CondInfo] -> Toggles
> -> [Numbered Class] -> Formatter
> directive lang d s (f,l) stack togs ts
> = dir d s stack
> where
> dir If s bs = do b <- fromEither (eval lang togs s)
> skipOrFormat ((f, l, bool b, True) : bs) ts
> dir Elif s ((f,l,b2,b1):bs) = do b <- fromEither (eval lang togs s)
> skipOrFormat ((f, l, bool b, not b2 && b1) : bs) ts
> dir Else _ ((f,l,b2,b1):bs) = skipOrFormat ((f, l, not b2 && b1, True) : bs) ts
> dir Endif _ ((f,l,b2,b1):bs)= skipOrFormat bs ts
> dir EOF _ [] = return () -- nothing left to do
> dir EOF s bs = raise (init $ unlines (map unBalancedIf bs), s)
> dir d s _ = raise ("spurious %" ++ decode d, s)
> skipOrFormat :: [CondInfo] -> [Numbered Class] -> Formatter
> skipOrFormat stack ts = do update (\st -> st{conds = stack})
> if andS stack then formats ts
> else skip ts
> andS :: [CondInfo] -> Bool
> andS = and . map (\(_,_,x,y) -> x && y)
> unBalancedIf :: CondInfo -> String
> unBalancedIf (f,l,_,_) = "%if at " ++ f ++ " line " ++ show l ++ " not closed"
> skip :: [Numbered Class] -> Formatter
> skip [] = return ()
> skip ts@(No n (Directive d s) : _)
> | conditional d = formats ts
> skip (t : ts) = skip ts
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
\subsubsection{Active commands}
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
ks, 23.10.2003: extended to work with @ghci@, too.
ks, 03.01.2004: fixed to work with @ghci-6.2@, hopefully without breaking
@hugs@ or old @ghci@ compatibility.
New, 26.01.2006: we're now starting an external process @ghci@ or @hugs@
using the System.Process library. The process is then reused for subsequent
computations, which should dramatically improve compilation time for
documents that make extensive use of @\eval@ and @\perform@.
> type Externals = FM.FiniteMap Char ProcessInfo
> type ProcessInfo = (Handle, Handle, Handle, ProcessHandle)
The function |external| can be used to call the process. It is discouraged
to call any programs except @ghci@ or @hugs@, because we make a number of
assumptions about the program being called. Input is the expression to evaluate.
Output is the result in string form.
> external :: String -> XIO Exc State String
> external expr = do st <- fetch
> let os = opts st
> f = file st
> ex = externals st
> ghcimode = "ghci" `isPrefixOf` os
> cmd
> | ghcimode = os ++ " -v0 -ignore-dot-ghci " ++ f
> | otherwise = (if null os then "hugs " else os ++ " ") ++ f
> script = "putStrLn " ++ show magic ++ "\n"
> ++ expr ++ "\n"
> ++ "putStrLn " ++ show magic ++ "\n"
> pi <- case FM.lookup f ex of
> Just pi -> return pi
> Nothing -> -- start new external process
> fromIO $ do
> when (verbose st) $
> hPutStrLn stderr $ "Starting external process: " ++ cmd
> runInteractiveCommand cmd
> store (st {externals = FM.add (f,pi) ex})
> let (pin,pout,_,_) = pi
> fromIO $ do
> -- hPutStrLn stderr ("sending: " ++ script)
> hPutStr pin script
> hFlush pin
> extract' pout
This function can be used to stop all external processes by sending the
@:q@ command to them.
> stopexternals :: Formatter
> stopexternals = do st <- fetch
> let ex = externals st
> pis = map (ex FM.!) (FM.keys ex)
> when (not . null $ pis) $ fromIO $ do
> when (verbose st) $
> hPutStrLn stderr $ "Stopping external processes."
> mapM_ (\(pin,_,_,pid) -> do hPutStrLn pin ":q"
> hFlush pin
> waitForProcess pid) pis
To extract the answer from @ghci@'s or @hugs@' output
we use a simple technique which should work in
most cases: we print the string |magic| before and after
the expression we are interested in. We assume that everything
that appears before the first occurrence of |magic| on the same
line is the prompt, and everything between the first |magic|
and the second |magic| plus prompt is the result we look for.
> magic :: String
> magic = "!@#$^&*"
>
> extract' :: Handle -> IO String
> extract' h = fmap (extract . unlines) (readMagic 2)
> where readMagic :: Int -> IO [String]
> readMagic 0 = return []
> readMagic n = do l <- hGetLine h
> -- hPutStrLn stderr ("received: " ++ l)
> let n' | (null . snd . breaks (isPrefixOf magic)) l = n
> | otherwise = n - 1
> fmap (l:) (readMagic n')
> extract :: String -> String
> extract s = v
> where (t, u) = breaks (isPrefixOf magic) s
> -- t contains everything up to magic, u starts with magic
> -- |u' = tail (dropWhile (/='\n') u)|
> pre = reverse . takeWhile (/='\n') . reverse $ t
> prelength = if null pre then 0 else length pre + 1
> -- pre contains the prefix of magic on the same line
> u' = drop (length magic + prelength) u
> -- we drop the magic string, plus the newline, plus the prefix
> (v, _) = breaks (isPrefixOf (pre ++ magic)) u'
> -- we look for the next occurrence of prefix plus magic
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
\subsubsection{Reading files}
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
> dir, nondir :: FilePath -> FilePath
> dir filePath
> | null d = ""
> | otherwise = reverse d
> where d = dropWhile (/= '/') (reverse filePath)
>
> nondir = reverse . takeWhile (/= '/') . reverse
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
\subsubsection{GPL-related program information}
% - - - - - - - - - - - - - - - = - - - - - - - - - - - - - - - - - - - - - - -
> programInfo :: String
> programInfo =
> "lhs2TeX " ++ version ++ ", Copyright (C) 1997-2008 Ralf Hinze, Andres Loeh\n\n\
> \lhs2TeX comes with ABSOLUTELY NO WARRANTY;\n\
> \for details type `lhs2TeX --warranty'.\n\
> \This is free software, and you are welcome to redistribute it\n\
> \under certain conditions; type `lhs2TeX --copying' for details."
> copying :: String
> copying =
> "\t\t GNU GENERAL PUBLIC LICENSE\n\
> \\t\t Version 2, June 1991\n\
> \\n\
> \ Copyright (C) 1989, 1991 Free Software Foundation, Inc.\n\
> \ 59 Temple Place - Suite 330\n\
> \ Boston, MA 02111-1307, USA.\n\
> \ Everyone is permitted to copy and distribute verbatim copies\n\
> \ of this license document, but changing it is not allowed.\n\
> \\n\
> \\t\t\t Preamble\n\
> \\n\
> \ The licenses for most software are designed to take away your\n\
> \freedom to share and change it. By contrast, the GNU General Public\n\
> \License is intended to guarantee your freedom to share and change free\n\
> \software--to make sure the software is free for all its users. This\n\
> \General Public License applies to most of the Free Software\n\
> \Foundation's software and to any other program whose authors commit to\n\
> \using it. (Some other Free Software Foundation software is covered by\n\
> \the GNU Library General Public License instead.) You can apply it to\n\
> \your programs, too.\n\
> \\n\
> \ When we speak of free software, we are referring to freedom, not\n\
> \price. Our General Public Licenses are designed to make sure that you\n\
> \have the freedom to distribute copies of free software (and charge for\n\
> \this service if you wish), that you receive source code or can get it\n\
> \if you want it, that you can change the software or use pieces of it\n\
> \in new free programs; and that you know you can do these things.\n\
> \\n\
> \ To protect your rights, we need to make restrictions that forbid\n\
> \anyone to deny you these rights or to ask you to surrender the rights.\n\
> \These restrictions translate to certain responsibilities for you if you\n\
> \distribute copies of the software, or if you modify it.\n\
> \\n\
> \ For example, if you distribute copies of such a program, whether\n\
> \gratis or for a fee, you must give the recipients all the rights that\n\
> \you have. You must make sure that they, too, receive or can get the\n\
> \source code. And you must show them these terms so they know their\n\
> \rights.\n\
> \\n\
> \ We protect your rights with two steps: (1) copyright the software, and\n\
> \(2) offer you this license which gives you legal permission to copy,\n\
> \distribute and/or modify the software.\n\
> \\n\
> \ Also, for each author's protection and ours, we want to make certain\n\
> \that everyone understands that there is no warranty for this free\n\
> \software. If the software is modified by someone else and passed on, we\n\
> \want its recipients to know that what they have is not the original, so\n\
> \that any problems introduced by others will not reflect on the original\n\
> \authors' reputations.\n\
> \\n\
> \ Finally, any free program is threatened constantly by software\n\
> \patents. We wish to avoid the danger that redistributors of a free\n\
> \program will individually obtain patent licenses, in effect making the\n\
> \program proprietary. To prevent this, we have made it clear that any\n\
> \patent must be licensed for everyone's free use or not licensed at all.\n\
> \\n\
> \ The precise terms and conditions for copying, distribution and\n\
> \modification follow.\n\
> \\f\n\
> \\t\t GNU GENERAL PUBLIC LICENSE\n\
> \ TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION\n\
> \\n\
> \ 0. This License applies to any program or other work which contains\n\
> \a notice placed by the copyright holder saying it may be distributed\n\
> \under the terms of this General Public License. The \"Program\", below,\n\
> \refers to any such program or work, and a \"work based on the Program\"\n\
> \means either the Program or any derivative work under copyright law:\n\
> \that is to say, a work containing the Program or a portion of it,\n\
> \either verbatim or with modifications and/or translated into another\n\
> \language. (Hereinafter, translation is included without limitation in\n\
> \the term \"modification\".) Each licensee is addressed as \"you\".\n\
> \\n\
> \Activities other than copying, distribution and modification are not\n\
> \covered by this License; they are outside its scope. The act of\n\
> \running the Program is not restricted, and the output from the Program\n\
> \is covered only if its contents constitute a work based on the\n\
> \Program (independent of having been made by running the Program).\n\
> \Whether that is true depends on what the Program does.\n\
> \\n\
> \ 1. You may copy and distribute verbatim copies of the Program's\n\
> \source code as you receive it, in any medium, provided that you\n\
> \conspicuously and appropriately publish on each copy an appropriate\n\
> \copyright notice and disclaimer of warranty; keep intact all the\n\
> \notices that refer to this License and to the absence of any warranty;\n\
> \and give any other recipients of the Program a copy of this License\n\
> \along with the Program.\n\
> \\n\
> \You may charge a fee for the physical act of transferring a copy, and\n\
> \you may at your option offer warranty protection in exchange for a fee.\n\
> \\n\
> \ 2. You may modify your copy or copies of the Program or any portion\n\
> \of it, thus forming a work based on the Program, and copy and\n\
> \distribute such modifications or work under the terms of Section 1\n\
> \above, provided that you also meet all of these conditions:\n\
> \\n\
> \ a) You must cause the modified files to carry prominent notices\n\
> \ stating that you changed the files and the date of any change.\n\
> \\n\
> \ b) You must cause any work that you distribute or publish, that in\n\
> \ whole or in part contains or is derived from the Program or any\n\
> \ part thereof, to be licensed as a whole at no charge to all third\n\
> \ parties under the terms of this License.\n\
> \\n\
> \ c) If the modified program normally reads commands interactively\n\
> \ when run, you must cause it, when started running for such\n\
> \ interactive use in the most ordinary way, to print or display an\n\
> \ announcement including an appropriate copyright notice and a\n\
> \ notice that there is no warranty (or else, saying that you provide\n\
> \ a warranty) and that users may redistribute the program under\n\
> \ these conditions, and telling the user how to view a copy of this\n\
> \ License. (Exception: if the Program itself is interactive but\n\
> \ does not normally print such an announcement, your work based on\n\
> \ the Program is not required to print an announcement.)\n\
> \\f\n\
> \These requirements apply to the modified work as a whole. If\n\
> \identifiable sections of that work are not derived from the Program,\n\
> \and can be reasonably considered independent and separate works in\n\
> \themselves, then this License, and its terms, do not apply to those\n\
> \sections when you distribute them as separate works. But when you\n\
> \distribute the same sections as part of a whole which is a work based\n\
> \on the Program, the distribution of the whole must be on the terms of\n\
> \this License, whose permissions for other licensees extend to the\n\
> \entire whole, and thus to each and every part regardless of who wrote it.\n\
> \\n\
> \Thus, it is not the intent of this section to claim rights or contest\n\
> \your rights to work written entirely by you; rather, the intent is to\n\
> \exercise the right to control the distribution of derivative or\n\
> \collective works based on the Program.\n\
> \\n\
> \In addition, mere aggregation of another work not based on the Program\n\
> \with the Program (or with a work based on the Program) on a volume of\n\
> \a storage or distribution medium does not bring the other work under\n\
> \the scope of this License.\n\
> \\n\
> \ 3. You may copy and distribute the Program (or a work based on it,\n\
> \under Section 2) in object code or executable form under the terms of\n\
> \Sections 1 and 2 above provided that you also do one of the following:\n\
> \\n\
> \ a) Accompany it with the complete corresponding machine-readable\n\
> \ source code, which must be distributed under the terms of Sections\n\
> \ 1 and 2 above on a medium customarily used for software interchange; or,\n\
> \\n\
> \ b) Accompany it with a written offer, valid for at least three\n\
> \ years, to give any third party, for a charge no more than your\n\
> \ cost of physically performing source distribution, a complete\n\
> \ machine-readable copy of the corresponding source code, to be\n\
> \ distributed under the terms of Sections 1 and 2 above on a medium\n\
> \ customarily used for software interchange; or,\n\
> \\n\
> \ c) Accompany it with the information you received as to the offer\n\
> \ to distribute corresponding source code. (This alternative is\n\
> \ allowed only for noncommercial distribution and only if you\n\
> \ received the program in object code or executable form with such\n\
> \ an offer, in accord with Subsection b above.)\n\
> \\n\
> \The source code for a work means the preferred form of the work for\n\
> \making modifications to it. For an executable work, complete source\n\
> \code means all the source code for all modules it contains, plus any\n\
> \associated interface definition files, plus the scripts used to\n\
> \control compilation and installation of the executable. However, as a\n\
> \special exception, the source code distributed need not include\n\
> \anything that is normally distributed (in either source or binary\n\
> \form) with the major components (compiler, kernel, and so on) of the\n\
> \operating system on which the executable runs, unless that component\n\
> \itself accompanies the executable.\n\
> \\n\
> \If distribution of executable or object code is made by offering\n\
> \access to copy from a designated place, then offering equivalent\n\
> \access to copy the source code from the same place counts as\n\
> \distribution of the source code, even though third parties are not\n\
> \compelled to copy the source along with the object code.\n\
> \\f\n\
> \ 4. You may not copy, modify, sublicense, or distribute the Program\n\
> \except as expressly provided under this License. Any attempt\n\
> \otherwise to copy, modify, sublicense or distribute the Program is\n\
> \void, and will automatically terminate your rights under this License.\n\
> \However, parties who have received copies, or rights, from you under\n\
> \this License will not have their licenses terminated so long as such\n\
> \parties remain in full compliance.\n\
> \\n\
> \ 5. You are not required to accept this License, since you have not\n\
> \signed it. However, nothing else grants you permission to modify or\n\
> \distribute the Program or its derivative works. These actions are\n\
> \prohibited by law if you do not accept this License. Therefore, by\n\
> \modifying or distributing the Program (or any work based on the\n\
> \Program), you indicate your acceptance of this License to do so, and\n\
> \all its terms and conditions for copying, distributing or modifying\n\
> \the Program or works based on it.\n\
> \\n\
> \ 6. Each time you redistribute the Program (or any work based on the\n\
> \Program), the recipient automatically receives a license from the\n\
> \original licensor to copy, distribute or modify the Program subject to\n\
> \these terms and conditions. You may not impose any further\n\
> \restrictions on the recipients' exercise of the rights granted herein.\n\
> \You are not responsible for enforcing compliance by third parties to\n\
> \this License.\n\
> \\n\
> \ 7. If, as a consequence of a court judgment or allegation of patent\n\
> \infringement or for any other reason (not limited to patent issues),\n\
> \conditions are imposed on you (whether by court order, agreement or\n\
> \otherwise) that contradict the conditions of this License, they do not\n\
> \excuse you from the conditions of this License. If you cannot\n\
> \distribute so as to satisfy simultaneously your obligations under this\n\
> \License and any other pertinent obligations, then as a consequence you\n\
> \may not distribute the Program at all. For example, if a patent\n\
> \license would not permit royalty-free redistribution of the Program by\n\
> \all those who receive copies directly or indirectly through you, then\n\
> \the only way you could satisfy both it and this License would be to\n\
> \refrain entirely from distribution of the Program.\n\
> \\n\
> \If any portion of this section is held invalid or unenforceable under\n\
> \any particular circumstance, the balance of the section is intended to\n\
> \apply and the section as a whole is intended to apply in other\n\
> \circumstances.\n\
> \\n\
> \It is not the purpose of this section to induce you to infringe any\n\
> \patents or other property right claims or to contest validity of any\n\
> \such claims; this section has the sole purpose of protecting the\n\
> \integrity of the free software distribution system, which is\n\
> \implemented by public license practices. Many people have made\n\
> \generous contributions to the wide range of software distributed\n\
> \through that system in reliance on consistent application of that\n\
> \system; it is up to the author/donor to decide if he or she is willing\n\
> \to distribute software through any other system and a licensee cannot\n\
> \impose that choice.\n\
> \\n\
> \This section is intended to make thoroughly clear what is believed to\n\
> \be a consequence of the rest of this License.\n\
> \\f\n\
> \ 8. If the distribution and/or use of the Program is restricted in\n\
> \certain countries either by patents or by copyrighted interfaces, the\n\
> \original copyright holder who places the Program under this License\n\
> \may add an explicit geographical distribution limitation excluding\n\
> \those countries, so that distribution is permitted only in or among\n\
> \countries not thus excluded. In such case, this License incorporates\n\
> \the limitation as if written in the body of this License.\n\
> \\n\
> \ 9. The Free Software Foundation may publish revised and/or new versions\n\
> \of the General Public License from time to time. Such new versions will\n\
> \be similar in spirit to the present version, but may differ in detail to\n\
> \address new problems or concerns.\n\
> \\n\
> \Each version is given a distinguishing version number. If the Program\n\
> \specifies a version number of this License which applies to it and \"any\n\
> \later version\", you have the option of following the terms and conditions\n\
> \either of that version or of any later version published by the Free\n\
> \Software Foundation. If the Program does not specify a version number of\n\
> \this License, you may choose any version ever published by the Free Software\n\
> \Foundation.\n\
> \\n\
> \ 10. If you wish to incorporate parts of the Program into other free\n\
> \programs whose distribution conditions are different, write to the author\n\
> \to ask for permission. For software which is copyrighted by the Free\n\
> \Software Foundation, write to the Free Software Foundation; we sometimes\n\
> \make exceptions for this. Our decision will be guided by the two goals\n\
> \of preserving the free status of all derivatives of our free software and\n\
> \of promoting the sharing and reuse of software generally.\n\
> \\n"
> ++ warranty ++
> "\n\n\
> \\t\t END OF TERMS AND CONDITIONS\n\
> \\f\n\
> \\t How to Apply These Terms to Your New Programs\n\
> \\n\
> \ If you develop a new program, and you want it to be of the greatest\n\
> \possible use to the public, the best way to achieve this is to make it\n\
> \free software which everyone can redistribute and change under these terms.\n\
> \\n\
> \ To do so, attach the following notices to the program. It is safest\n\
> \to attach them to the start of each source file to most effectively\n\
> \convey the exclusion of warranty; and each file should have at least\n\
> \the \"copyright\" line and a pointer to where the full notice is found.\n\
> \\n\
> \ <one line to give the program's name and a brief idea of what it does.>\n\
> \ Copyright (C) 19yy <name of author>\n\
> \\n\
> \ This program is free software; you can redistribute it and/or modify\n\
> \ it under the terms of the GNU General Public License as published by\n\
> \ the Free Software Foundation; either version 2 of the License, or\n\
> \ (at your option) any later version.\n\
> \\n\
> \ This program is distributed in the hope that it will be useful,\n\
> \ but WITHOUT ANY WARRANTY; without even the implied warranty of\n\
> \ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n\
> \ GNU General Public License for more details.\n\
> \\n\
> \ You should have received a copy of the GNU General Public License\n\
> \ along with this program; see the file COPYING. If not, write to\n\
> \ the Free Software Foundation, Inc., 59 Temple Place - Suite 330,\n\
> \ Boston, MA 02111-1307, USA.\n\
> \\n\
> \Also add information on how to contact you by electronic and paper mail.\n\
> \\n\
> \If the program is interactive, make it output a short notice like this\n\
> \when it starts in an interactive mode:\n\
> \\n\
> \ Gnomovision version 69, Copyright (C) 19yy name of author\n\
> \ Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.\n\
> \ This is free software, and you are welcome to redistribute it\n\
> \ under certain conditions; type `show c' for details.\n\
> \\n\
> \The hypothetical commands `show w' and `show c' should show the appropriate\n\
> \parts of the General Public License. Of course, the commands you use may\n\
> \be called something other than `show w' and `show c'; they could even be\n\
> \mouse-clicks or menu items--whatever suits your program.\n\
> \\n\
> \You should also get your employer (if you work as a programmer) or your\n\
> \school, if any, to sign a \"copyright disclaimer\" for the program, if\n\
> \necessary. Here is a sample; alter the names:\n\
> \\n\
> \ Yoyodyne, Inc., hereby disclaims all copyright interest in the program\n\
> \ `Gnomovision' (which makes passes at compilers) written by James Hacker.\n\
> \\n\
> \ <signature of Ty Coon>, 1 April 1989\n\
> \ Ty Coon, President of Vice\n\
> \\n\
> \This General Public License does not permit incorporating your program into\n\
> \proprietary programs. If your program is a subroutine library, you may\n\
> \consider it more useful to permit linking proprietary applications with the\n\
> \library. If this is what you want to do, use the GNU Library General\n\
> \Public License instead of this License."
> warranty :: String
> warranty =
> "\t\t\t NO WARRANTY\n\
> \\n\
> \ 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY\n\
> \FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN\n\
> \OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES\n\
> \PROVIDE THE PROGRAM \"AS IS\" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED\n\
> \OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF\n\
> \MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS\n\
> \TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE\n\
> \PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,\n\
> \REPAIR OR CORRECTION.\n\
> \\n\
> \ 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING\n\
> \WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR\n\
> \REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,\n\
> \INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING\n\
> \OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED\n\
> \TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY\n\
> \YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER\n\
> \PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE\n\
> \POSSIBILITY OF SUCH DAMAGES."
|