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
|
module CPP.ICode.Parser.ML.Types where
import CPP.ICode.ParseTypes
import Data.Char
data L = X | H
data WarnID = TagNameFirstDigit
| TagNameNotAlphaNum
| TagEndsUnexpected
| UnquotedAttributeEmpty
| Unquoted Char
| AttributesUnseperated
| UnexpectedEndTag
| SingleEndTag
data Text = Raw String | ExpT String | ExpC String
deriving Eq
type TPos = (SimplePos,Int)
type Symbol = (Token,TPos)
type Attribute = (String,[Text])
type Stack a = [a]
type ParseStack = Stack (Symbol,[Tree])
data Token = Break
| Tabs Int
| Blanks Int
| Data [Text]
| StartTag String [Attribute] Int
| VoidTag String [Attribute]
| EndTag String
data Node = Content [Text]
| Element String [Attribute]
data Tree = Tree Node [Tree]
row :: TPos -> Int
row = fst . fst
col :: TPos -> Int
col = snd . fst
tbs :: TPos -> Int
tbs = snd
wcol :: TPos -> Int
wcol p = col p + 7 * tbs p
tok :: Symbol -> Token
tok = fst
pos :: Symbol -> TPos
pos = snd
tgn :: Symbol -> String
tgn (StartTag s _ _,_) = map toLower s
tgn (VoidTag s _,_) = map toLower s
tgn (EndTag s,_) = map toLower s
ind :: Symbol -> Int
ind (StartTag _ _ i,_) = i
isTag :: Symbol -> Bool
isTag sym = isStartTag sym || isVoidTag sym || isEndTag sym
isStartTag :: Symbol -> Bool
isStartTag sym = case tok sym of
StartTag _ _ _ -> True
_ -> False
isVoidTag :: Symbol -> Bool
isVoidTag sym = case tok sym of
VoidTag _ _ -> True
_ -> False
isEndTag :: Symbol -> Bool
isEndTag sym = case tok sym of
EndTag _ -> True
_ -> False
isAlign :: Symbol -> Bool
isAlign sym = case tok sym of
Break -> True
Tabs _ -> True
Blanks _ -> True
_ -> False
isPlain :: Symbol -> Bool
isPlain sym = case tok sym of
Data _ -> True
_ -> isAlign sym
push :: a -> Stack a -> Stack a
push = (:)
top :: Stack a -> a
top = head
pop :: Stack a -> Stack a
pop = tail
update :: (a -> a) -> Stack a -> Stack a
update f (x:xs) = (f x) : xs
sym2node :: Symbol -> Node
sym2node x = case tok x of
Break -> Content [Raw "\n"]
Tabs n -> Content [Raw (tabs n)]
Blanks n -> Content [Raw (blanks n)]
Data ds -> Content ds
VoidTag s a -> Element s a
StartTag s a _ -> Element s a
where blanks :: Int -> String
blanks = flip take $ repeat ' '
tabs :: Int -> String
tabs = flip take $ repeat (chr 9)
|