/
Parser.hs
88 lines (72 loc) · 1.71 KB
/
Parser.hs
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
module Parser where
import Char
import Monad
newtype Parser a = P (String -> [(a, String)])
instance Monad Parser where
return v = P (\inp -> [(v,inp)])
p >>= f = P (\inp -> case parse p inp of
[] -> []
[(v,out)] -> parse (f v) out)
failure :: Parser a
failure = P (\inp -> [])
item :: Parser Char
item = P (\inp -> case inp of
[] -> []
(x : xs) -> [(x, xs)])
parse :: Parser a -> String -> [(a, String)]
parse (P p) inp = p inp
p0 :: Parser (Char, Char)
p0 =
item >>= \x ->
item >>= \_ ->
item >>= \y ->
return (x, y)
-- is equivalent to
p1 :: Parser (Char, Char)
p1 = do
x <- item
item
y <- item
return (x, y)
(+++) :: Parser a -> Parser a -> Parser a
p +++ q = P (\inp -> case parse p inp of
[] -> parse q inp
[(v,out)] -> [(v,out)])
sat :: (Char -> Bool) -> Parser Char
sat p = do
x <- item
if p x then return x else failure
digit, lower, upper, letter, alphanum :: Parser Char
digit = sat isDigit
lower = sat isLower
upper = sat isUpper
letter = sat isAlpha
alphanum = sat isAlphaNum
char :: Char -> Parser Char
char x = sat (==x)
string :: String -> Parser String
string [] = return []
string (x : xs) = do
char x
string xs
return (x : xs)
many :: Parser a -> Parser [a]
many p = many1 p +++ return []
many1 :: Parser a -> Parser [a]
many1 p = do
v <- p
vs <- many p
return (v : vs)
ident :: Parser String
ident = do
x <- lower
xs <- many alphanum
return (x : xs)
nat :: Parser Int
nat = do
xs <- many1 digit
return (read xs)
space :: Parser ()
space = do
many (sat isSpace)
return ()