1 implementation module parse
3 import Control.Applicative
5 import Control.Monad.State
6 import Control.Monad.Trans
17 (<:>) infixl 0 :: a (m [a]) -> m [a] | Functor m
18 (<:>) l r = (\xs->[l:xs]) <$> r
20 :: Token = TTEq | TTSemiColon | TTLambda | TTDot | TTBrackOpen | TTBrackClose | TTBool Bool | TTInt Int | TTOp [Char] | TTIdent [Char]
22 instance toString Token where toString t = printToString t
24 lex :: [Char] -> Either [String] [Token]
26 lex [';':ts] = TTSemiColon <:> lex ts
27 lex [')':ts] = TTBrackClose <:> lex ts
28 lex ['(':ts] = TTBrackOpen <:> lex ts
29 lex ['True':ts] = TTBool True <:> lex ts
30 lex ['False':ts] = TTBool False <:> lex ts
32 | isDigit t = lex [t:ts] >>= \v->case v of
33 [TTInt i:rest] = Right [TTInt (~i):rest]
38 # (i, ts) = span isDigit [t:ts]
39 = TTInt (toInt (toString i)) <:> lex ts
41 # (i, ts) = span isAlpha [t:ts]
42 = TTIdent i <:> lex ts
44 # (i, ts) = span isOp [t:ts]
45 | i =: ['='] = TTEq <:> lex ts
46 | i =: ['.'] = TTDot <:> lex ts
47 | i =: ['\\'] = TTLambda <:> lex ts
49 = Left ["Unexpected: " +++ toString t +++ " ord: " +++ toString (toInt t)]
51 isOp c = isMember c ['!@#$%^&*=+/?-_|\\\'",<>.:']
53 :: Parser a :== StateT ParseState (Either [String]) a
56 , ifxs :: [((Parser Expression) -> Parser Expression, Int)]
60 pTop = getState >>= \s->case s.tokens of
61 [t:ts] = put {s & tokens=ts} >>| pure t
62 [] = liftT (Left ["Fully consumed input"])
65 pEof = getState >>= \s->case s.tokens of
67 [t:ts] = liftT (Left ["Expected EOF"])
69 (?) infixl 9 :: (Parser a) (a -> Bool) -> Parser a
70 (?) p f = p >>= \v->if (f v) (pure v) empty
72 pToken :: (Token -> Parser Token)
73 pToken = (?) pTop o (===)
75 pChainl :: (Parser (a a -> a)) (Parser a) -> Parser a
76 pChainl op p = foldl (flip ($)) <$> p <*> many (flip <$> op <*> p)
78 pChainr :: (Parser (a a -> a)) (Parser a) -> Parser a
79 pChainr op p = flip ($) <$> p <*> (flip <$> op <*> pChainr op p) <|> p
81 parse :: [Token] -> Either [String] [Function]
82 parse ts = fst <$> runStateT (pAST <* pEof) {tokens=ts, ifxs=[]}
84 pAST :: Parser [Function]
85 pAST = many pFunction >>= mapM \(id, args, body)->Function id args <$
86 modify (\t->{t & tokens=body}) <*> pExpression <* pEof
88 pId = (\(TTIdent i)->i) <$> pTop ? (\t->t=:(TTIdent _))
89 pOp = (\(TTOp i)->i) <$> pTop ? (\t->t=:(TTOp _))
91 pFunction :: Parser ([Char], [[Char]], [Token])
97 <*> many (pTop ? ((=!=)TTSemiColon))
100 pFunId :: Parser [Char]
102 >>= \i->pChainr <$ pId ? ((==) ['ifxr']) <|> pChainl <$ pId ? ((==)['ifxl'])
103 >>= \p->(\(TTInt i)->i) <$> pTop ? (\t->t=:(TTInt _))
104 >>= \s->modify (\t->{t & ifxs=[(p (App o App (Var i) <$ pOp ? ((==)i)), s):t.ifxs]})
107 pExpression :: Parser Expression
108 pExpression = getState >>= \{ifxs}->flip (foldr ($))
109 (map fst $ sortBy (on (<) snd) ifxs)
111 $ Lambda <$ pToken TTLambda <*> pId <* pToken TTDot <*> pExpression
112 <|> pToken TTBrackOpen *> pExpression <* pToken TTBrackClose
113 <|> Lit o Int <$> (\(TTInt i)->i) <$> pTop ? (\t->t=:(TTInt _))
114 <|> (\(TTBool i)->Lit (Bool i)) <$> pTop ? (\t->t=:(TTBool _))