Doc.hs revision d543cf2bb0c810781625c76fe135476d46270d88
{- |
Module : $Header$
Copyright : (c) Christian Maeder and Uni Bremen 2006
License : similar to LGPL, see HetCATS/LICENSE.txt or LIZENZ.txt
Maintainer : maeder@tzi.de
Stability : provisional
Portability : portable
Description : document data type 'Doc' for (pretty) printing in various formats
This module contains a document data type 'Doc' for displaying
(heterogenous) CASL specifications at least as plain text and latex
(and maybe html as well)
Inspired by John Hughes's and Simon Peyton Jones's Pretty Printer
Combinators in "Text.PrettyPrint.HughesPJ", Thomas Hallgren's
Daan Leijen's PPrint: A prettier printer 2001, and Olaf Chiti's Pretty
printing with lazy Dequeues 2003
The main combinators are those from "Text.PrettyPrint.HughesPJ" except
nest, hang and $$. Instead of $$ '$+$' must be used that always forces a
line break. Indentation must be constructed using '<>' or '<+>', i.e.
'text' \"spec\" '<+>' MultilineBlock.
Also char, ptext, int, integer, float, double and rational do not
exist. These can all be simulated using 'text' (and 'show'). There's
an instance for 'Int' in "Common.DocUtils".
Furthermore, documents can no longer be tested with isEmpty. 'empty'
documents are silently ignored (as by "Text.PrettyPrint.HughesPJ") and
often it is more natural (or even necessary anyway) to test the
original data structure for emptiness.
Putting a document into braces has changed to 'specBraces' (a function
braces is simply not exported), ensuring that opening and closing
braces are in the same column if the whole document does not fit on a
single line.
Rendering of documents is achieved by translations to the old
"Common.Lib.Pretty". For plain text simply 'show' can be
used. Any document can be translated to LaTeX via 'toLatex' and then
processed further by "Common.PrintLatex". If you like the output is a
different question, but the result should be legal LaTeX in
conjunction with the hetcasl.sty file.
For nicer looking LaTeX the predefined symbol constants should be
used! There is a difference between 'bullet' and 'dot' that is not
visible in plain text.
There are also three kinds of keywords, a plain 'keyword', a
'topSigKey' having the width of \"preds\", and a 'topKey' having the
width of \"view\". In plain text only inserted spaces are visible.
Strings in small caps are created by 'structId' and
'indexed'. The latter puts the string also into a LaTeX index.
In order to avoid considering display annotations and precedences,
documents can be constructed using 'annoDoc', 'idDoc', and 'idApplDoc'.
Currently only a few annotations (i.e. labels and %implied) are
printed 'flushRight'. This function is problematic as it does not
prevent something to be appended using '<>' or '<+>'. Furthermore
flushed parts are currently only visible in plain text, if they don't
fit on the same line (as nest is used for indenting).
Further functions are documented in "Common.DocUtils".
-}
module Common.Doc
( -- * the document type
Doc -- Abstract
-- * primitive documents
, empty
, space
, semi
, comma
, colon
, quMarkD
, equals
, lparen
, rparen
, lbrack
, rbrack
, lbrace
, rbrace
-- * converting strings into documents
, text
, keyword
, topSigKey
, topKey
, indexed
, structId
-- * wrapping documents in delimiters
, parens
, brackets
, specBraces
, quotes
, doubleQuotes
-- * combining documents
, (<>)
, (<+>)
, hcat
, hsep
, ($+$)
, ($++$)
, vcat
, vsep
, sep
, cat
, fsep
, fcat
, punctuate
, sepByCommas
-- * symbols
, dot
, bullet
, defn
, less
, greater
, lambda
, mapsto
, funArrow
, pfun
, cfun
, pcfun
, exequal
, forallDoc
, exists
, unique
, cross
, bar
, notDoc
, inDoc
, andDoc
, orDoc
, implies
, equiv
-- * docifying annotations and ids
, annoDoc
, codeToken
, idDoc
, idLabelDoc
, predIdApplDoc
, idApplDoc
-- * transforming to existing formats
, toText
, toLatex
-- * manipulating documents
, flushRight
, changeGlobalAnnos
, rmTopKey
) where
import Common.Id
import Common.Keywords
import Common.AS_Annotation
import Common.GlobalAnnotations
import qualified Common.Lib.Map as Map
import qualified Common.Lib.Set as Set
import qualified Common.Lib.Pretty as Pretty
import Common.LaTeX_funs
import Common.ConvertLiteral
import Common.Prec
import Data.Char
import Data.List
infixl 6 <>
infixl 6 <+>
infixl 5 $+$
infixl 5 $++$
-- * the data type
data LabelKind = IdDecl | IdAppl deriving (Show, Eq)
data TextKind =
IdKind | IdSymb | Symbol | Comment | Keyword | TopKey Int
| Indexed | StructId | Native | HetsLabel
| IdLabel LabelKind TextKind Id
data Format = Small | FlushRight
data ComposeKind
= Vert -- ($+$) (no support for $$!)
| Horiz -- (<>)
| HorizOrVert -- either Horiz or Vert
| Fill
deriving Eq
data Doc
= Empty -- creates an empty line if composed vertically
| AnnoDoc Annotation -- we know how to print annotations
| IdDoc LabelKind Id -- for plain ids outside applications
| IdApplDoc Bool Id [Doc] -- for mixfix applications and literal terms
| Text TextKind String -- non-empty and no white spaces inside
| Cat ComposeKind [Doc]
| Attr Format Doc -- for annotations
| ChangeGlobalAnnos (GlobalAnnos -> GlobalAnnos) Doc
instance Show Doc where
showsPrec _ doc cont =
Pretty.renderStyle' cont Pretty.style $ toText emptyGlobalAnnos doc
isEmpty :: Doc -> Bool
isEmpty d = case d of
Empty -> True
Cat _ [] -> True
_ -> False
-- * the visible interface
empty :: Doc -- ^ An empty document
empty = Empty
text :: String -> Doc
text = Text IdKind
semi :: Doc -- ^ A ';' character
semi = text ";"
comma :: Doc -- ^ A ',' character
comma = text ","
colon :: Doc -- ^ A ':' character
colon = symbol colonS
-- the only legal white space within Text
space :: Doc -- ^ A horizontal space (omitted at end of line)
space = text " "
equals :: Doc -- ^ A '=' character
equals = symbol equalS
-- use symbol for signs that need to be put in mathmode for latex
symbol :: String -> Doc
symbol = Text Symbol
-- for text within comments
commentText :: String -> Doc
commentText = Text Comment
-- put this string into math mode for latex and don't escape it
native :: String -> Doc
native = Text Native
lparen, rparen, lbrack, rbrack, lbrace, rbrace, quote, doubleQuote :: Doc
lparen = symbol "("
rparen = symbol ")"
lbrack = symbol "["
rbrack = symbol "]"
lbrace = symbol "{" -- to allow for latex translations
rbrace = symbol "}"
quote = symbol "\'"
doubleQuote = symbol "\""
parens :: Doc -> Doc -- ^ Wrap document in @(...)@
parens d = hcat [lparen, d, rparen]
brackets :: Doc -> Doc -- ^ Wrap document in @[...]@
brackets d = hcat [lbrack, d, rbrack]
braces :: Doc -> Doc -- ^ Wrap document in @{...}@
braces d = hcat [lbrace, d, rbrace]
specBraces :: Doc -> Doc -- ^ Wrap document in @{...}@
specBraces d = cat [addLBrace d, rbrace]
-- | move the opening brace inwards
addLBrace :: Doc -> Doc
addLBrace d = case d of
Cat k (e : r) -> Cat k $ addLBrace e : r
_ -> lbrace <> d
quotes :: Doc -> Doc -- ^ Wrap document in @\'...\'@
quotes d = hcat [quote, d, quote]
doubleQuotes :: Doc -> Doc -- ^ Wrap document in @\"...\"@
doubleQuotes d = hcat [doubleQuote, d, doubleQuote]
(<>) :: Doc -> Doc -> Doc -- ^Beside
a <> b = hcat [a, b]
rmEmpties :: [Doc] -> [Doc]
rmEmpties = filter (not . isEmpty)
hcat :: [Doc] -> Doc -- ^List version of '<>'
hcat = Cat Horiz . rmEmpties
(<+>) :: Doc -> Doc -> Doc -- ^Beside, separated by space
a <+> b = hsep [a, b]
punctuate :: Doc -> [Doc] -> [Doc]
punctuate d l = case l of
x : r@(_ : _) -> (x <> d) : punctuate d r
_ -> l
hsep :: [Doc] -> Doc -- ^List version of '<+>'
hsep = Cat Horiz . punctuate space . rmEmpties
($+$) :: Doc -> Doc -> Doc; -- ^Above, without dovetailing.
a $+$ b = vcat [a, b]
-- | vertical composition with a specified number of blank lines
aboveWithNLs :: Int -> Doc -> Doc -> Doc
aboveWithNLs n d1 d2 = if isEmpty d2 then d1 else
if isEmpty d1 then d2 else
d1 $+$ foldr ($+$) d2 (replicate n $ text "")
-- | vertical composition with one blank line
($++$) :: Doc -> Doc -> Doc
($++$) = aboveWithNLs 1
-- | list version of '($++$)'
vsep :: [Doc] -> Doc
vsep = foldr ($++$) empty
vcat :: [Doc] -> Doc -- ^List version of '$+$'
vcat = Cat Vert . rmEmpties
cat :: [Doc] -> Doc -- ^ Either hcat or vcat
cat = Cat HorizOrVert . rmEmpties
sep :: [Doc] -> Doc -- ^ Either hsep or vcat
sep = Cat HorizOrVert . punctuate space . rmEmpties
fcat :: [Doc] -> Doc -- ^ \"Paragraph fill\" version of cat
fcat = Cat Fill . rmEmpties
fsep :: [Doc] -> Doc -- ^ \"Paragraph fill\" version of sep
fsep = Cat Fill . punctuate space . rmEmpties
keyword, topSigKey, topKey, indexed, structId :: String -> Doc
keyword = Text Keyword
indexed = Text Indexed
structId = Text StructId
topKey = Text (TopKey 4)
topSigKey = Text (TopKey 5)
lambdaSymb :: String
lambdaSymb = "\\"
-- | docs possibly rendered differently for Text or LaTeX
quMarkD, dot, bullet, defn, less, greater, lambda, mapsto, funArrow, pfun,
cfun, pcfun, exequal, forallDoc, exists, unique, cross, bar, notDoc,
inDoc, andDoc, orDoc, implies, equiv :: Doc
quMarkD = text quMark
dot = text dotS
bullet = symbol dotS
defn = symbol defnS
less = symbol lessS
greater = symbol greaterS
lambda = symbol lambdaSymb
mapsto = symbol mapsTo
funArrow = symbol funS
pfun = symbol pFun
cfun = symbol contFun
pcfun = symbol pContFun
exequal = symbol exEqual
forallDoc = symbol forallS
exists = symbol existsS
unique = symbol existsUnique
cross = symbol prodS
bar = symbol barS
notDoc = symbol notS
inDoc = symbol inS
andDoc = symbol lAnd
orDoc = symbol lOr
implies = symbol implS
equiv = symbol equivS
-- | we know how to print annotations
annoDoc :: Annotation -> Doc
annoDoc = AnnoDoc
-- | for plain ids outside of terms
idDoc :: Id -> Doc
idDoc = IdDoc IdAppl
-- | for newly declared ids
idLabelDoc :: Id -> Doc
idLabelDoc = IdDoc IdDecl
-- | for mixfix applications and literal terms (may print \"\" for empty)
idApplDoc :: Id -> [Doc] -> Doc
idApplDoc = IdApplDoc False
-- | for mixfix applications of predicate identifiers
predIdApplDoc :: Id -> [Doc] -> Doc
predIdApplDoc = IdApplDoc True
-- | put document as far to the right as fits (for annotations)
flushRight :: Doc -> Doc
flushRight = Attr FlushRight
small :: Doc -> Doc
small = Attr Small
-- * folding stuff
data DocRecord a = DocRecord
{ foldEmpty :: Doc -> a
, foldAnnoDoc :: Doc -> Annotation -> a
, foldIdDoc :: Doc -> LabelKind -> Id -> a
, foldIdApplDoc :: Doc -> Bool -> Id -> [a] -> a
, foldText :: Doc -> TextKind -> String -> a
, foldCat :: Doc -> ComposeKind -> [a] -> a
, foldAttr :: Doc -> Format -> a -> a
, foldChangeGlobalAnnos :: Doc -> (GlobalAnnos -> GlobalAnnos) -> a -> a
}
foldDoc :: DocRecord a -> Doc -> a
foldDoc r d = case d of
Empty -> foldEmpty r d
AnnoDoc a -> foldAnnoDoc r d a
IdDoc l i -> foldIdDoc r d l i
IdApplDoc b i l -> foldIdApplDoc r d b i $ map (foldDoc r) l
Text k s -> foldText r d k s
Cat k l -> foldCat r d k $ map (foldDoc r) l
Attr a e -> foldAttr r d a $ foldDoc r e
ChangeGlobalAnnos f e -> foldChangeGlobalAnnos r d f $ foldDoc r e
idRecord :: DocRecord Doc
idRecord = DocRecord
{ foldEmpty = \ _ -> Empty
, foldAnnoDoc = \ _ -> AnnoDoc
, foldIdDoc = \ _ -> IdDoc
, foldIdApplDoc = \ _ -> IdApplDoc
, foldText = \ _ -> Text
, foldCat = \ _ -> Cat
, foldAttr = \ _ -> Attr
, foldChangeGlobalAnnos = \ _ -> ChangeGlobalAnnos
}
anyRecord :: DocRecord a
anyRecord = DocRecord
{ foldEmpty = error "anyRecord.Empty"
, foldAnnoDoc = error "anyRecord.AnnoDoc"
, foldIdDoc = error "anyRecord.IdDoc"
, foldIdApplDoc = error "anyRecord.IdApplDoc"
, foldText = error "anyRecord.Text"
, foldCat = error "anyRecord.Cat"
, foldAttr = error "anyRecord.Attr"
, foldChangeGlobalAnnos = error "anyRecord.ChangeGlobalAnnos"
}
-- * conversion to plain text
-- | simple conversion to a standard text document
toText :: GlobalAnnos -> Doc -> Pretty.Doc
toText ga = toTextAux . codeOut ga Nothing Map.empty
toTextAux :: Doc -> Pretty.Doc
toTextAux = foldDoc anyRecord
{ foldEmpty = \ _ -> Pretty.empty
, foldText = \ _ k s -> case k of
TopKey n -> Pretty.text $ s ++ replicate (n - length s) ' '
_ -> Pretty.text s
, foldCat = \ (Cat _ ds) c l -> case ds of
[] -> Pretty.empty
_ -> if all hasSpace $ init ds then
(case c of
Vert -> Pretty.vcat
Horiz -> Pretty.hsep
HorizOrVert -> Pretty.sep
Fill -> Pretty.fsep) $ map (toTextAux . rmSpace) ds
else (case c of
Vert -> Pretty.vcat
Horiz -> Pretty.hcat
HorizOrVert -> Pretty.cat
Fill -> Pretty.fcat) l
, foldAttr = \ _ k d -> case k of
FlushRight -> let l = length $ show d in
if l < 66 then Pretty.nest (66 - l) d else d
_ -> d
, foldChangeGlobalAnnos = \ _ _ d -> d
}
-- * conversion to latex
toLatex :: GlobalAnnos -> Doc -> Pretty.Doc
toLatex ga d = let dm = Map.map (Map.! DF_LATEX) .
Map.filter (Map.member DF_LATEX) $ display_annos ga
dis = getDeclIds d
in foldDoc (toLatexRecord dis False)
. makeSmallMath False False $ codeOut ga (Just DF_LATEX) dm d
-- avoid too many tabs
toLatexRecord :: Set.Set Id -> Bool -> DocRecord Pretty.Doc
toLatexRecord dis tab = anyRecord
{ foldEmpty = \ _ -> Pretty.empty
, foldText = \ _ k s -> textToLatex dis False k s
, foldCat = \ (Cat c os) _ _ ->
if any isNative os then Pretty.hcat $
latex_macro "{\\Ax{"
: map (foldDoc (toLatexRecord dis False)
{ foldText = \ _ k s ->
case k of
Native -> Pretty.sp_text (axiom_width s) s
IdLabel _ Native _ ->
Pretty.sp_text (axiom_width s) s
IdKind | s == " " ->
Pretty.sp_text (axiom_width s) "\\,"
_ -> textToLatex dis False k s
}) os
++ [latex_macro "}}"]
else case os of
[] -> Pretty.empty
[d] -> foldDoc (toLatexRecord dis tab) d
d : r -> (if tab && c /= Horiz then
(latex_macro setTab Pretty.<>)
. (latex_macro startTab Pretty.<>)
. (Pretty.<> latex_macro endTab)
else id)
$ (case c of
Vert -> Pretty.vcat
Horiz -> Pretty.hcat
HorizOrVert -> Pretty.cat
Fill -> Pretty.fcat)
$ case c of
Vert -> map (foldDoc $ toLatexRecord dis False) os
_ -> foldDoc (toLatexRecord dis False) d :
map (foldDoc $ toLatexRecord dis True) r
, foldAttr = \ o k d -> case k of
FlushRight -> flushright d
Small -> case o of
Attr Small (Text j s) -> textToLatex dis True j s
_ -> makeSmallLatex True d
, foldChangeGlobalAnnos = \ _ _ d -> d
}
-- | move a small attribute inwards but not into mathmode bits
makeSmallMath :: Bool -> Bool -> Doc -> Doc
makeSmallMath smll math = let rec = makeSmallMath smll math in
foldDoc idRecord
{ foldAttr = \ (Attr k d) _ _ -> case k of
Small -> makeSmallMath True math d
_ -> Attr k $ makeSmallMath smll math d
, foldCat = \ o@(Cat c l) _ _ ->
if any isNative l then
(if smll then Attr Small else id)
-- flatten math mode bits
$ Cat Horiz $ map
(makeSmallMath False True . rmSpace) l
else if math then Cat Horiz
$ map (makeSmallMath False True) l
else if smll && allHoriz o then
-- produce fewer small blocks with wrong size though
Attr Small $ Cat Horiz $
map (makeSmallMath False math) l
else Cat c $ map rec l
, foldText = \ d _ _ -> if smll then Attr Small d else d
}
-- | check for unbalanced braces
needsMathMode :: Int -> String -> Bool
needsMathMode i s = case s of
[] -> i > 0
c : r -> if c == '{' then needsMathMode (i + 1) r else
if c == '}' then if i == 0 then True else
needsMathMode (i - 1) r
else needsMathMode i r
isMathLatex :: Doc -> Bool
isMathLatex d = case d of
Text Native s -> needsMathMode 0 s
Text (IdLabel _ Native _) s -> needsMathMode 0 s
Attr Small f -> isMathLatex f
_ -> False
isNative :: Doc -> Bool
isNative d = case d of
Cat Horiz [t, _] -> isMathLatex t
_ -> isMathLatex d
-- | remove the spaces inserted by punctuate
rmSpace :: Doc -> Doc
rmSpace = snd . anaSpace
hasSpace :: Doc -> Bool
hasSpace = fst . anaSpace
anaSpace :: Doc -> (Bool, Doc)
anaSpace d = case d of
Cat Horiz [t, Text IdKind s] | s == " " -> (True, t)
_ -> (False, d)
allHoriz :: Doc -> Bool
allHoriz d = case d of
Text _ _ -> True
Cat Horiz l -> and $ map allHoriz l
Attr _ f -> allHoriz f
Empty -> True
_ -> False
makeSmallLatex :: Bool -> Pretty.Doc -> Pretty.Doc
makeSmallLatex b d = if b then
Pretty.hcat [latex_macro startAnno, d, latex_macro endAnno] else d
symbolToLatex :: String -> Pretty.Doc
symbolToLatex s =
Map.findWithDefault (hc_sty_axiom $ escapeLatex False s) s latexSymbols
getDeclIds :: Doc -> Set.Set Id
getDeclIds = foldDoc anyRecord
{ foldEmpty = \ _ -> Set.empty
, foldText = \ _ _ _ -> Set.empty
, foldCat = \ _ _ c -> Set.unions c
, foldAttr = \ _ _ d -> d
, foldChangeGlobalAnnos = \ _ _ d -> d
, foldIdDoc = \ _ lk i ->
if lk == IdDecl then Set.singleton i else Set.empty
, foldIdApplDoc = \ _ _ _ _ -> Set.empty
, foldAnnoDoc = \ _ _ -> Set.empty
}
textToLatex :: Set.Set Id -> Bool -> TextKind -> String -> Pretty.Doc
textToLatex dis b k s = case s of
[] -> Pretty.text ""
h : _ -> let e = escapeLatex True s in
if elem s $ map (: []) ",;[]() "
then makeSmallLatex b $ casl_normal_latex s
else case k of
IdKind -> makeSmallLatex b $ hc_sty_id e
IdSymb -> makeSmallLatex b $ if s == "__" then symbolToLatex s
else if isAlpha h || elem h "._'" then hc_sty_id e
else hc_sty_axiom $ escapeLatex False s
Symbol -> makeSmallLatex b $ symbolToLatex s
Comment -> makeSmallLatex b $ casl_comment_latex e
-- multiple spaces should be replaced by \hspace
Keyword -> (if b then makeSmallLatex b . hc_sty_small_keyword
else hc_sty_plain_keyword) s
TopKey _ -> hc_sty_casl_keyword s
Indexed -> hc_sty_structid_indexed s
StructId -> hc_sty_structid s
Native -> hc_sty_axiom s
HetsLabel -> Pretty.hcat [ latex_macro $ "\\HetsLabel{"
, textToLatex dis b Comment s
, latex_macro $ "}{" ++ escapeLabel s ++ "}" ]
IdLabel appl tk i -> let d = textToLatex dis b tk s
si = showId i ""
in if b || appl == IdAppl && not (Set.member i dis)
|| not (isLegalLabel si)
then d else Pretty.hcat
[ latex_macro $ "\\" ++ shows appl "Label{"
, d
, latex_macro $ "}{" ++ escapeLabel si ++ "}" ]
escapeLabel :: String -> String
escapeLabel = map ( \ c -> if c == '_' then ':' else c)
latexSymbols :: Map.Map String Pretty.Doc
latexSymbols = Map.union (Map.fromList
[ ("{", casl_normal_latex "\\{")
, ("}", casl_normal_latex "\\}")
, (barS, casl_normal_latex "\\AltBar{}")
, (percentS, hc_sty_small_keyword "\\%")
, (percents, hc_sty_small_keyword "\\%\\%")
, (exEqual, Pretty.sp_text (axiom_width "=") "\\Ax{\\stackrel{e}{=}}") ])
$ Map.map hc_sty_axiom $ Map.fromList
[ (dotS, "\\bullet")
, (diamondS, "\\Diamond")
, ("__", "\\_\\_")
, (lambdaSymb, "\\lambda")
, (mapsTo, "\\mapsto")
, (funS, "\\rightarrow")
, (pFun, "\\rightarrow?")
, (contFun, "\\stackrel{c}{\\rightarrow}")
, (pContFun, "\\stackrel{c}{\\rightarrow}?")
, (forallS, "\\forall")
, (existsS, "\\exists")
, (existsUnique, "\\exists!")
, (prodS, "\\times")
, (notS, "\\neg")
, (inS, "\\in")
, (lAnd, "\\wedge")
, (lOr, "\\vee")
, (implS, "\\Rightarrow")
, (equivS, "\\Leftrightarrow") ]
-- * coding out stuff
{- | transform document according to a specific display map and other
global annotations like precedences, associativities, and literal
annotations. -}
codeOut :: GlobalAnnos -> Maybe Display_format -> Map.Map Id [Token] -> Doc
-> Doc
codeOut ga d m = foldDoc idRecord
{ foldAnnoDoc = \ _ -> small . codeOutAnno d m
, foldIdDoc = \ _ lk -> codeOutId lk m
, foldIdApplDoc = \ o _ _ -> codeOutAppl ga d m o
, foldChangeGlobalAnnos = \ (ChangeGlobalAnnos fg e) _ _ ->
let ng = fg ga in codeOut ng d
(maybe m (\ f -> Map.map (Map.! f) .
Map.filter (Map.member f) $ display_annos ng) d) e
}
codeToken :: String -> Doc
codeToken = Text IdSymb
codeOrigId :: LabelKind -> Map.Map Id [Token] -> Id -> [Doc]
codeOrigId lk m i@(Id ts cs _) = let
(toks, places) = splitMixToken ts
conv = reverse . snd . foldl ( \ (b, l) t ->
let s = tokStr t
in if isPlace t then (b, symbol s : l)
else (True, (if b then codeToken s else makeLabel lk IdSymb s i)
: l)) (False, [])
in if null cs then conv ts
else conv toks ++ codeCompIds m cs : conv places
cCommaT :: Map.Map Id [Token] -> [Id] -> [Doc]
cCommaT m = punctuate comma . map (codeOutId IdAppl m)
codeCompIds :: Map.Map Id [Token] -> [Id] -> Doc
codeCompIds m cs = brackets $ fcat $ cCommaT m cs
codeOutId :: LabelKind -> Map.Map Id [Token] -> Id -> Doc
codeOutId lk m i = fcat $ case Map.lookup i m of
Nothing -> codeOrigId lk m i
Just ts -> reverse $ snd $ foldl ( \ (b, l) t ->
let s = tokStr t
in if isPlace t then (b, symbol s : l) else
(True, (if b then native s else
makeLabel lk Native s i) : l)) (False, []) ts
makeLabel :: LabelKind -> TextKind -> String -> Id -> Doc
makeLabel l k s i = Text (IdLabel l k i) s
annoLine :: String -> Doc
annoLine w = percent <> keyword w
annoLparen :: String -> Doc
annoLparen w = percent <> keyword w <> lparen
revDropSpaces :: String -> String
revDropSpaces = reverse . dropWhile isSpace
strip :: String -> String
strip = revDropSpaces . revDropSpaces
wrapLines :: TextKind -> Maybe Display_format -> Doc -> [String] -> Doc -> Doc
wrapLines k d a l b = case map (Text k .
maybe id (const strip) d) l of
[] -> a <> b
[x] -> hcat [a, x, b]
ds@(x : r) -> case d of
Nothing -> vcat $ fcat [a, x] : init r ++ [fcat [last r, b]]
Just _ -> a <+> vcat ds <> b
wrapAnnoLines :: Maybe Display_format -> Doc -> [String] -> Doc -> Doc
wrapAnnoLines = wrapLines Comment
percent :: Doc
percent = symbol percentS
annoRparen :: Doc
annoRparen = rparen <> percent
hCommaT :: Map.Map Id [Token] -> [Id] -> Doc
hCommaT m = hsep . cCommaT m
fCommaT :: Map.Map Id [Token] -> [Id] -> Doc
fCommaT m = fsep . cCommaT m
codeOutAnno :: Maybe Display_format -> Map.Map Id [Token] -> Annotation -> Doc
codeOutAnno d m a = case a of
Unparsed_anno aw at _ -> case at of
Line_anno s -> (case aw of
Annote_word w -> annoLine w
Comment_start -> symbol percents)
<> commentText (revDropSpaces $ reverse s)
Group_anno l -> case aw of
Annote_word w -> wrapAnnoLines d (annoLparen w) l annoRparen
Comment_start -> wrapAnnoLines d (percent <> lbrace) l
(rbrace <> percent)
Display_anno i ds _ -> annoLparen displayS <> fsep
( fcat (codeOrigId IdAppl m i) :
map ( \ (df, s) -> percent <> commentText (lookupDisplayFormat df)
<+> maybe (commentText s) (const $ codeOutId IdAppl m i)
(Map.lookup i m)) ds) <> annoRparen
List_anno i1 i2 i3 _ -> annoLine listS <+> hCommaT m [i1, i2, i3]
Number_anno i _ -> annoLine numberS <+> codeOutId IdAppl m i
Float_anno i1 i2 _ -> annoLine floatingS <+> hCommaT m [i1, i2]
String_anno i1 i2 _ -> annoLine stringS <+> hCommaT m [i1, i2]
Prec_anno p l1 l2 _ -> annoLparen precS <>
fsep [ braces $ fCommaT m l1
, case p of
Lower -> less
Higher -> greater
BothDirections -> less <> greater
NoDirection -> greater <> less
, braces $ fCommaT m l2
] <> annoRparen
Assoc_anno s l _ -> annoLparen (case s of
ALeft -> left_assocS
ARight -> right_assocS)
<> fCommaT m l <> annoRparen
Label l _ -> wrapLines (case l of
[x] -> let r = strip x in
if isLegalLabel r
then HetsLabel
else Comment
_ -> Comment) d (percent <> lparen) l annoRparen
Semantic_anno sa _ -> annoLine $ lookupSemanticAnno sa
isLegalLabel :: String -> Bool
isLegalLabel r = not (null r) && all ( \ c -> isAlphaNum c || elem c "_" ) r
splitDoc :: Doc -> Maybe (Id, [Doc])
splitDoc d = case d of
IdApplDoc _ i l -> Just (i, l)
_ -> Nothing
sepByCommas :: [Doc] -> Doc
sepByCommas = fsep . punctuate comma
data Weight = Weight Int Id Id Id -- top, left, right
-- print literal terms and mixfix applications
codeOutAppl :: GlobalAnnos -> Maybe Display_format -> Map.Map Id [Token]
-> Doc -> [Doc] -> Doc
codeOutAppl ga md m origDoc args = case origDoc of
IdApplDoc isPred i@(Id ts cs _) aas ->
let mk t = codeToken $ tokStr t
pa = prec_annos ga
assocs = assoc_annos ga
precs = mkPrecIntMap pa
p = Map.findWithDefault maxBound i $ precMap precs
doSplit = maybe (error "doSplit") id . splitDoc
mkList op largs cl = fsep $ codeOutId IdAppl m op : punctuate comma
(map (codeOut ga md m) largs)
++ [codeOutId IdAppl m cl]
in if isGenNumber splitDoc ga i aas then
mk $ toNumber doSplit i aas
else if isGenFrac splitDoc ga i aas then
mk $ toFrac doSplit aas
else if isGenFloat splitDoc ga i aas then
mk $ toFloat doSplit ga aas
else if isGenString splitDoc ga i aas then
mk $ toString doSplit ga i aas
else if isGenList splitDoc ga i aas then
toMixfixList mkList doSplit ga i aas
else if null args || length args /= placeCount i then
codeOutId IdAppl m i <> if null args then empty else
parens (sepByCommas args)
else let
parArgs = reverse $ foldl ( \ l (arg, dc) ->
case getWeight ga arg of
Nothing -> dc : l
Just (Weight q ta la ra) ->
let pArg = parens dc
d = if isBoth pa i ta then pArg else dc
oArg = if isDiffAssoc assocs pa i ta then pArg else d
in (if isLeftArg i l then
if checkArg ARight ga (i, p) (ta, q) ra
then oArg
else if isPred || isSafeLhs i ta then d else pArg
else if isRightArg i l then
if checkArg ALeft ga (i, p) (ta, q) la
then oArg
else if isInfix ta && not isPred then pArg else d
else d) : l) [] $ zip aas args
(fts, ncs, cFun, hFun) = case Map.lookup i m of
Nothing ->
(fst $ splitMixToken ts, cs, IdSymb, fsep)
Just nts -> (nts, [], Native, fsep)
((_, rArgs), fArgs) = mapAccumL ( \ (b, ac) t ->
if isPlace t then case ac of
hd : tl -> ((b, tl), hd)
_ -> error "addPlainArg"
else ((True, ac),
let s = tokStr t in
if b then Text cFun s else makeIdApplLabel cFun s i))
(False, parArgs) fts
in hFun $ fArgs ++ (if null ncs then [] else [codeCompIds m cs])
++ rArgs
_ -> error "Common.Doc.codeOutAppl"
makeIdApplLabel :: TextKind -> String -> Id -> Doc
makeIdApplLabel k s i = Text (IdLabel IdAppl k i) s
getWeight :: GlobalAnnos -> Doc -> Maybe Weight
getWeight ga d = let
pa = prec_annos ga
precs = mkPrecIntMap pa
m = precMap precs
in case d of
IdApplDoc _ i aas@(hd : _) ->
let p = Map.findWithDefault
(if begPlace i || endPlace i then 0 else maxBound) i m in
if isGenLiteral splitDoc ga i aas then Nothing else
let lw = case getWeight ga hd of
Just (Weight _ _ l _) -> nextWeight ALeft ga i l
Nothing -> i
rw = case getWeight ga $ last aas of
Just (Weight _ _ _ r) -> nextWeight ARight ga i r
Nothing -> i
in Just $ Weight p i lw rw
_ -> Nothing
isDiffAssoc :: AssocMap -> PrecedenceGraph -> Id -> Id -> Bool
isDiffAssoc assocs precs op arg =
isInfix op && isInfix arg &&
case precRel precs op arg of
Lower -> False
_ -> op /= arg || not (Map.member arg assocs)
isSafeLhs :: Id -> Id -> Bool
isSafeLhs op arg = isPostfix arg || endPlace op && not (isInfix arg)
isBoth :: PrecedenceGraph -> Id -> Id -> Bool
isBoth precs op arg = case precRel precs op arg of
BothDirections -> True
_ -> False
-- | change top-level to plain keywords
rmTopKey :: Doc -> Doc
rmTopKey = foldDoc idRecord
{ foldText = \ d k s -> case k of
TopKey _ -> Text Keyword s
_ -> d
}
-- | add global annotations for proper mixfix printing
changeGlobalAnnos :: (GlobalAnnos -> GlobalAnnos) -> Doc -> Doc
changeGlobalAnnos = ChangeGlobalAnnos