- readEntireFile :: *File -> *([Char], *File)
- readEntireFile f
- # (b, c, f) = freadc f
- | not b = ([], f)
- # (cs, f) = readEntireFile f
- = ([c:cs], f)
-
-
-
-charTokenMap = [('(', BraceOpenToken)
- ,(')', BraceCloseToken)
- ,('{', CBraceOpenToken)
- ,('}', CBraceCloseToken)
- ,('[', SquareOpenToken)
- ,(']', SquareCloseToken)
- ,(',', CommaToken)
- ,(':', ColonToken)
- ,(';', SColonToken)
- ,('.', DotToken)
- ,('+', PlusToken)
- ,('-', DashToken)
- ,('*', StarToken)
- ,('/', SlashToken)
- ,('%', PercentToken)
- ,('=', AssignmentToken)
- ,('<', LesserToken)
- ,('>', BiggerToken)
- ,('!', ExclamationToken)]
-findT c [] = fail "Unrecognized character"
-findT c [(k,v):xs] = if (c==k) (return v) (findT c xs)
-
-
-// Clean adaption of Yard, a parsec like parser combinator
-:: Parser a = Parser ([Char] -> (LexerOutput a, [Char]))
-
-runParser :: (Parser a) [Char] -> (LexerOutput a, [Char])
-runParser (Parser p) s = p s
-
-instance Functor Parser where
- fmap f s = liftM f s
-
-instance Applicative Parser where
- pure a = Parser $ \s -> (Right a, s)
- (<*>) sf s = ap sf s
-
-instance Monad Parser where
- bind p f = Parser $ \s -> let (out, rest) = runParser p s in case out of
- Left e = (Left e, rest)
- Right t = runParser (f t) rest
-
-//gives us some, many and optional
-instance Alternative Parser where
- empty = zero
- (<|>) p1 p2 = Parser $ \s -> let (out, rest) = runParser p1 s in case out of
- Left e = runParser p2 s
- Right t = (Right t, rest)
-
-//parser that fails with error
-fail :: String -> Parser a
-fail e = Parser $ \s -> (Left e, s)
-
-//parser that always fails
-zero :: Parser a
-zero = fail "Zero parser"
-
-//matches exactly one Char
-item :: Parser Char
-item = Parser $ \s -> case s of
- [] = (Left "Unexpected empty input", s)
- [x:xs] = (Right x, xs)
-
-//matches any char which satisfies f
-satisfy :: (Char -> Bool) -> Parser Char
-satisfy f = item >>= (\r -> if (f r) (return r) zero)
-
-//tries a parser, if it fails returns a default value
-optionalDef :: a (Parser a) -> Parser a
-optionalDef def p = p <|> return def
-
-//matched given char
-char :: Char -> Parser Char
-char c = satisfy (\i -> c==i) //I hate that we can't do: satisfy (==c)
-
-alpha :: Parser Char
-alpha = satisfy isAlpha
-
-digit :: Parser Char
-digit = satisfy isDigit
-
-alphaNum :: Parser Char
-alphaNum = alpha <|> digit
-
-//matches a given String
-string :: [Char] -> Parser [Char]
-string s = mapM_ char s >>| return s
\ No newline at end of file
+ lexWord :: String TokenValue -> Parser Char LexItem
+ lexWord s tv = list (fromString s) >>| pure (LexToken (textSize s) tv)
+
+ lexKw :: String TokenValue -> Parser Char LexItem
+ lexKw kw tv = lexWord kw tv <* check (not o isIdentChar)
+
+ lexUntilNL = top until (eof <|> (item '\n' >>| pure Void))
+
+ lexComment :: Parser Char LexItem
+ lexComment = list (fromString "//") >>| lexUntilNL
+ >>= \chars->pure LexNL
+
+ lexBlockComment :: Parser Char LexItem
+ lexBlockComment = list (fromString "/*")
+ >>| (top until (list (fromString "*/")))
+ >>= \chars->pure $ widthHeight chars 0 0
+ where
+ widthHeight :: [Char] Int Int -> LexItem
+ widthHeight [] l c = LexSpace l c
+ widthHeight ['\n':xs] l _ = widthHeight xs (l+1) 0
+ widthHeight [x:xs] l c = widthHeight xs l (c+1)
+
+ lexNumber :: Parser Char LexItem
+ lexNumber = toString <$> some (satisfy isDigit)
+ >>= \si->pure $ LexToken (textSize si) (NumberToken $ toInt si)
+
+ lexIdentifier :: Parser Char LexItem
+ lexIdentifier = toString <$> some (satisfy isIdentChar)
+ >>= \si->pure $ LexToken (textSize si) (IdentToken si)
+
+ isIdentChar c = isAlphanum c || c == '_'
+
+ lexCharacter :: Parser Char LexItem
+ lexCharacter = item '\'' *> satisfy ((<>) '\'') <* item '\''
+ >>= \char->pure $ LexToken 3 (CharToken char)
+
+ lexEscape :: Parser Char LexItem
+ lexEscape = item '\'' *> item '\\' *> top <* item '\''
+ >>= \char->pure case char of
+ 'a' = LexToken 4 (CharToken $ toChar 7)
+ 'b' = LexToken 4 (CharToken '\b')
+ 'b' = LexToken 4 (CharToken '\b')
+ 'f' = LexToken 4 (CharToken '\f')
+ 'n' = LexToken 4 (CharToken '\n')
+ 'r' = LexToken 4 (CharToken '\t')
+ 'v' = LexToken 4 (CharToken '\v')
+ '\'' =LexToken 4 (CharToken '\'')
+ c = (LexItemError $ "Unknown escape: " +++ toString c)