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
|
{-
BNF Converter: Alex 2.0 Generator
Copyright (C) 2004 Author: Peter Gammie
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
-}
-------------------------------------------------------------------
-- |
-- Module : CFtoAlex2
-- Copyright : (C)opyright 2003, {aarne,markus,peteg} at cs dot chalmers dot se
-- License : GPL (see COPYING for details)
--
-- Maintainer : {markus,aarne} at cs dot chalmers dot se
-- Stability : alpha
-- Portability : Haskell98
--
-- Hacked version of @CFtoAlex@ to cope with Alex2.
--
-------------------------------------------------------------------
module CFtoAlex2 (cf2alex2) where
import CF
import Data.List
-- For RegToAlex, see below.
import AbsBNF
import Data.Char
cf2alex2 :: String -> String -> String -> Bool -> Bool -> CF -> String
cf2alex2 name errMod shareMod shareStrings byteStrings cf =
unlines $ concat $ intersperse [""] [
prelude name errMod shareMod shareStrings byteStrings,
cMacros,
rMacros cf,
restOfAlex shareMod shareStrings byteStrings cf
]
prelude :: String -> String -> String -> Bool -> Bool -> [String]
prelude name errMod shareMod shareStrings byteStrings = [
"-- -*- haskell -*-",
"-- This Alex file was machine-generated by the BNF converter",
"{",
"{-# OPTIONS_GHC -fno-warn-incomplete-patterns #-}",
"module " ++ name ++ " where",
"",
-- "import " ++ errMod,
if shareStrings then "import " ++ shareMod else "",
if byteStrings then "import qualified Data.ByteString.Char8 as BS" else "",
"}",
""
]
cMacros :: [String]
cMacros = [
"$l = [a-zA-Z\\192 - \\255] # [\\215 \\247] -- isolatin1 letter FIXME",
"$c = [A-Z\\192-\\221] # [\\215] -- capital isolatin1 letter FIXME",
"$s = [a-z\\222-\\255] # [\\247] -- small isolatin1 letter FIXME",
"$d = [0-9] -- digit",
"$i = [$l $d _ '] -- identifier character",
"$u = [\\0-\\255] -- universal: any character"
]
rMacros :: CF -> [String]
rMacros cf =
let symbs = symbols cf
in
(if null symbs then [] else [
"@rsyms = -- symbols and non-identifier-like reserved words",
" " ++ unwords (intersperse "|" (map mkEsc symbs))
])
where
mkEsc = unwords . esc
esc s = if null a then rest else show a : rest
where (a,r) = span isAlphaNum s
rest = case r of
[] -> []
(c:xs) -> s : esc xs
where s = if isPrint c then ['\\',c]
else '\\':show (ord c)
restOfAlex :: String -> Bool -> Bool -> CF -> [String]
restOfAlex shareMod shareStrings byteStrings cf = [
":-",
lexComments (comments cf),
"$white+ ;",
pTSpec (symbols cf),
userDefTokenTypes,
ident,
ifC "String" ("\\\" ([$u # [\\\" \\\\ \\n]] | (\\\\ (\\\" | \\\\ | \\' | n | t)))* \\\"" ++
"{ tok (\\p s -> PT p (TL $ share $ unescapeInitTail s)) }"),
ifC "Char" "\\\' ($u # [\\\' \\\\] | \\\\ [\\\\ \\\' n t]) \\' { tok (\\p s -> PT p (TC $ share s)) }",
ifC "Integer" "$d+ { tok (\\p s -> PT p (TI $ share s)) }",
ifC "Double" "$d+ \\. $d+ (e (\\-)? $d+)? { tok (\\p s -> PT p (TD $ share s)) }",
"",
"{",
"",
"tok f p s = f p s",
"",
"share :: "++stringType++" -> "++stringType,
"share = " ++ if shareStrings then "shareString" else "id",
"",
"data Tok =",
" TS !"++stringType++" !Int -- reserved words and symbols",
" | TL !"++stringType++" -- string literals",
" | TI !"++stringType++" -- integer literals",
" | TV !"++stringType++" -- identifiers",
" | TD !"++stringType++" -- double precision float literals",
" | TC !"++stringType++" -- character literals",
userDefTokenConstrs,
" deriving (Eq,Show,Ord)",
"",
"data Token = ",
" PT Posn Tok",
" | Err Posn",
" deriving (Eq,Show,Ord)",
"",
"tokenPos (PT (Pn _ l _) _ :_) = \"line \" ++ show l",
"tokenPos (Err (Pn _ l _) :_) = \"line \" ++ show l",
"tokenPos _ = \"end of file\"",
"",
"posLineCol (Pn _ l c) = (l,c)",
"mkPosToken t@(PT p _) = (posLineCol p, prToken t)",
"",
"prToken t = case t of",
" PT _ (TS s _) -> s",
" PT _ (TL s) -> s",
" PT _ (TI s) -> s",
" PT _ (TV s) -> s",
" PT _ (TD s) -> s",
" PT _ (TC s) -> s",
userDefTokenPrint,
"",
"data BTree = N | B "++stringType++" Tok BTree BTree deriving (Show)",
"",
"eitherResIdent :: ("++stringType++" -> Tok) -> "++stringType++" -> Tok",
"eitherResIdent tv s = treeFind resWords",
" where",
" treeFind N = tv s",
" treeFind (B a t left right) | s < a = treeFind left",
" | s > a = treeFind right",
" | s == a = t",
"",
"resWords = " ++ (show $ sorted2tree $ zip (sort resws) [1..]),
" where b s n = let bs = "++stringPack++" s",
" in B bs (TS bs n)",
"",
"unescapeInitTail :: "++stringType++" -> "++stringType++"",
"unescapeInitTail = "++stringPack++" . unesc . tail . "++stringUnpack++" where",
" unesc s = case s of",
" '\\\\':c:cs | elem c ['\\\"', '\\\\', '\\\''] -> c : unesc cs",
" '\\\\':'n':cs -> '\\n' : unesc cs",
" '\\\\':'t':cs -> '\\t' : unesc cs",
" '\"':[] -> []",
" c:cs -> c : unesc cs",
" _ -> []",
"",
"-------------------------------------------------------------------",
"-- Alex wrapper code.",
"-- A modified \"posn\" wrapper.",
"-------------------------------------------------------------------",
"",
"data Posn = Pn !Int !Int !Int",
" deriving (Eq, Show,Ord)",
"",
"alexStartPos :: Posn",
"alexStartPos = Pn 0 1 1",
"",
"alexMove :: Posn -> Char -> Posn",
"alexMove (Pn a l c) '\\t' = Pn (a+1) l (((c+7) `div` 8)*8+1)",
"alexMove (Pn a l c) '\\n' = Pn (a+1) (l+1) 1",
"alexMove (Pn a l c) _ = Pn (a+1) l (c+1)",
"",
"type AlexInput = (Posn, -- current position,",
" Char, -- previous char",
" "++stringType++") -- current input string",
"",
"tokens :: "++stringType++" -> [Token]",
"tokens str = go (alexStartPos, '\\n', str)",
" where",
" go :: AlexInput -> [Token]",
" go inp@(pos, _, str) =",
" case alexScan inp 0 of",
" AlexEOF -> []",
" AlexError (pos, _, _) -> [Err pos]",
" AlexSkip inp' len -> go inp'",
" AlexToken inp' len act -> act pos ("++stringTake++" len str) : (go inp')",
"",
"alexGetChar :: AlexInput -> Maybe (Char,AlexInput)",
"alexGetChar (p, _, s) =",
" case "++stringUncons++" s of",
" "++stringNilP++" -> Nothing",
" "++stringConsP++" ->",
" let p' = alexMove p c",
" in p' `seq` Just (c, (p', c, s))",
"",
"alexInputPrevChar :: AlexInput -> Char",
"alexInputPrevChar (p, c, s) = c",
"}"
]
where
(stringType,stringTake,stringUncons,stringPack,stringUnpack,stringNilP,stringConsP)
| byteStrings = ("BS.ByteString", "BS.take", "BS.uncons", "BS.pack", "BS.unpack", "Nothing", "Just (c,s)")
| otherwise = ("String", "take", "", "id", "id", "[]", "(c:s)" )
ifC cat s = if isUsedCat cf cat then s else ""
lexComments ([],[]) = []
lexComments (xs,s1:ys) = '\"' : s1 ++ "\"" ++ " [.]* ; -- Toss single line comments\n" ++ lexComments (xs, ys)
lexComments (([l1,l2],[r1,r2]):xs,[]) = concat $
[
('\"':l1:l2:"\" ([$u # \\"), -- FIXME quotes or escape?
(l2:"] | \\"),
(r1:" [$u # \\"),
(r2:"])* (\""),
(r1:"\")+ \""),
(r2:"\" ; \n"),
lexComments (xs, [])
]
lexComments ((_:xs),[]) = lexComments (xs,[])
--- lexComments (xs,(_:ys)) = lexComments (xs,ys)
-- tokens consisting of special symbols
pTSpec [] = ""
pTSpec _ = "@rsyms { tok (\\p s -> PT p (eitherResIdent (TV . share) s)) }"
userDefTokenTypes = unlines $
[printRegAlex exp ++
" { tok (\\p s -> PT p (eitherResIdent (T_" ++ name ++ " . share) s)) }"
| (name,exp) <- tokenPragmas cf]
userDefTokenConstrs = unlines $
[" | T_" ++ name ++ " !"++stringType | (name,_) <- tokenPragmas cf]
userDefTokenPrint = unlines $
[" PT _ (T_" ++ name ++ " s) -> s" | (name,_) <- tokenPragmas cf]
ident =
"$l $i* { tok (\\p s -> PT p (eitherResIdent (TV . share) s)) }"
--ifC "Ident" "<ident> ::= ^l ^i* { ident p = PT p . eitherResIdent TV }"
resws = reservedWords cf ++ symbols cf
data BTree = N | B String Int BTree BTree
instance Show BTree where
showsPrec _ N = showString "N"
showsPrec n (B s k l r) = wrap (showString "b " . shows s . showChar ' '. shows k . showChar ' '
. showsPrec 1 l . showChar ' '
. showsPrec 1 r)
where wrap f = if n > 0 then showChar '(' . f . showChar ')' else f
sorted2tree :: [(String,Int)] -> BTree
sorted2tree [] = N
sorted2tree xs = B x n (sorted2tree t1) (sorted2tree t2) where
(t1,((x,n):t2)) = splitAt (length xs `div` 2) xs
-------------------------------------------------------------------
-- Inlined version of @RegToAlex@.
-- Syntax has changed...
-------------------------------------------------------------------
-- modified from pretty-printer generated by the BNF converter
-- the top-level printing method
printRegAlex :: Reg -> String
printRegAlex = render . prt 0
-- you may want to change render and parenth
render :: [String] -> String
render = rend 0
where rend :: Int -> [String] -> String
rend i ss = case ss of
"[" :ts -> cons "[" $ rend i ts
"(" :ts -> cons "(" $ rend i ts
t : "," :ts -> cons t $ space "," $ rend i ts
t : ")" :ts -> cons t $ cons ")" $ rend i ts
t : "]" :ts -> cons t $ cons "]" $ rend i ts
t :ts -> space t $ rend i ts
_ -> ""
cons s t = s ++ t
new i s = s
space t s = if null s then t else t ++ " " ++ s
parenth :: [String] -> [String]
parenth ss = ["("] ++ ss ++ [")"]
-- the printer class does the job
class Print a where
prt :: Int -> a -> [String]
prtList :: [a] -> [String]
prtList = concat . map (prt 0)
instance Print a => Print [a] where
prt _ = prtList
instance Print Char where
prt _ c = if isAlphaNum c then [[c]] else ['\\':[c]]
prtList s = map (concat . prt 0) s
prPrec :: Int -> Int -> [String] -> [String]
prPrec i j = if j<i then parenth else id
instance Print Ident where
prt _ (Ident i) = [i]
instance Print Reg where
prt i e = case e of
RSeq reg0 reg -> prPrec i 2 (concat [prt 2 reg0 , prt 3 reg])
RAlt reg0 reg -> prPrec i 1 (concat [prt 1 reg0 , ["|"] , prt 2 reg])
RMinus reg0 reg -> prPrec i 1 (concat [prt 2 reg0 , ["#"] , prt 2 reg])
RStar reg -> prPrec i 3 (concat [prt 3 reg , ["*"]])
RPlus reg -> prPrec i 3 (concat [prt 3 reg , ["+"]])
ROpt reg -> prPrec i 3 (concat [prt 3 reg , ["?"]])
REps -> prPrec i 3 (["()"])
RChar c -> prPrec i 3 (concat [prt 0 c])
RAlts str -> prPrec i 3 (concat [["["],prt 0 str,["]"]])
RSeqs str -> prPrec i 2 (concat (map (prt 0) str))
RDigit -> prPrec i 3 (concat [["$d"]])
RLetter -> prPrec i 3 (concat [["$l"]])
RUpper -> prPrec i 3 (concat [["$c"]])
RLower -> prPrec i 3 (concat [["$s"]])
RAny -> prPrec i 3 (concat [["$u"]])
|