|
| 1 | +{-# LANGUAGE StrictData, OverloadedStrings #-} |
| 2 | +module Parse (parse) where |
| 3 | + |
| 4 | +import qualified Data.Char as Char |
| 5 | +import qualified Data.Bifunctor as Bifunctor |
| 6 | +import Data.Function ((&)) |
| 7 | +import qualified Data.List.NonEmpty as NonEmpty |
| 8 | +import Data.Set (Set) |
| 9 | +import qualified Data.Set as Set |
| 10 | +import Data.Text (Text) |
| 11 | +import qualified Data.Text as T |
| 12 | +import Data.Void (Void) |
| 13 | +import qualified Control.Applicative as Applicative |
| 14 | +import qualified Control.Monad.Combinators.Expr as CombinatorsExpr |
| 15 | +import Text.Megaparsec (Parsec, (<?>)) |
| 16 | +import qualified Text.Megaparsec as Parsec |
| 17 | +import qualified Text.Megaparsec.Char as ParsecChar |
| 18 | +import qualified Text.Megaparsec.Char.Lexer as Lexer |
| 19 | +import qualified Text.Megaparsec.Error as ParsecError |
| 20 | +import qualified Syntax |
| 21 | +import Identifier (Identifier) |
| 22 | +import qualified Identifier |
| 23 | + |
| 24 | +type Parser a = Parsec Void Text a |
| 25 | + |
| 26 | +--------------------------------------------------------------------------------------------------- |
| 27 | + |
| 28 | +space :: Parser () |
| 29 | +space = |
| 30 | + Lexer.space |
| 31 | + ParsecChar.space1 |
| 32 | + Applicative.empty |
| 33 | + (Lexer.skipBlockComment "(*" "*)") |
| 34 | + |
| 35 | +lexeme :: Parser a -> Parser a |
| 36 | +lexeme = |
| 37 | + Lexer.lexeme space |
| 38 | + |
| 39 | +symbol :: Text -> Parser () |
| 40 | +symbol s = |
| 41 | + () <$ Lexer.symbol space s |
| 42 | + |
| 43 | +decimal :: Parser Integer |
| 44 | +decimal = |
| 45 | + lexeme Lexer.decimal |
| 46 | + |
| 47 | +keywords :: Set Text |
| 48 | +keywords = Set.fromList ["if", "then", "else", "true", "false"] |
| 49 | + |
| 50 | +keyword :: Text -> Parser () |
| 51 | +keyword str = |
| 52 | + lexeme $ |
| 53 | + () <$ ParsecChar.string str |
| 54 | + <* Parsec.notFollowedBy ParsecChar.alphaNumChar |
| 55 | + |
| 56 | +identifierOrKeyword :: Parser Text |
| 57 | +identifierOrKeyword = |
| 58 | + let |
| 59 | + alphaChar = |
| 60 | + Parsec.satisfy |
| 61 | + (\c -> (Char.isAlpha c || c == '_') && Char.isAscii c) |
| 62 | + <?> "alphabet" |
| 63 | + |
| 64 | + alnumChars = |
| 65 | + Parsec.takeWhileP |
| 66 | + (Just "alphabets or numbers") |
| 67 | + (\c -> (Char.isAlpha c || Char.isNumber c || c == '_') && Char.isAscii c) |
| 68 | + in |
| 69 | + lexeme (T.cons <$> alphaChar <*> alnumChars) |
| 70 | + |
| 71 | +identifier :: Parser Identifier |
| 72 | +identifier = |
| 73 | + Parsec.try $ Parsec.label "identifier" $ do |
| 74 | + offset <- Parsec.getOffset |
| 75 | + word <- identifierOrKeyword |
| 76 | + if Set.member word keywords then |
| 77 | + let |
| 78 | + actual = ParsecError.Tokens (NonEmpty.fromList (T.unpack word)) |
| 79 | + expected = ParsecError.Label (NonEmpty.fromList "identifier") |
| 80 | + err = ParsecError.TrivialError offset (Just actual) (Set.singleton expected) |
| 81 | + in |
| 82 | + Parsec.parseError err |
| 83 | + else |
| 84 | + return $ Identifier.fromText word |
| 85 | + |
| 86 | +--------------------------------------------------------------------------------------------------- |
| 87 | + |
| 88 | +toplevel :: Parser Syntax.Expr |
| 89 | +toplevel = |
| 90 | + expr <* symbol ";;" |
| 91 | + |
| 92 | +expr :: Parser Syntax.Expr |
| 93 | +expr = |
| 94 | + Parsec.choice [ ifExpr, simpleExpr ] |
| 95 | + |
| 96 | +ifExpr :: Parser Syntax.Expr |
| 97 | +ifExpr = |
| 98 | + Syntax.If |
| 99 | + <$ keyword "if" |
| 100 | + <*> expr |
| 101 | + <* keyword "then" |
| 102 | + <*> expr |
| 103 | + <* keyword "else" |
| 104 | + <*> expr |
| 105 | + |
| 106 | +simpleExpr :: Parser Syntax.Expr |
| 107 | +simpleExpr = |
| 108 | + CombinatorsExpr.makeExprParser |
| 109 | + term |
| 110 | + [ [ binaryOperator CombinatorsExpr.InfixL "*" Syntax.Mul ] |
| 111 | + , [ binaryOperator CombinatorsExpr.InfixL "+" Syntax.Add ] |
| 112 | + , [ binaryOperator CombinatorsExpr.InfixN "<" Syntax.Lt ] |
| 113 | + ] |
| 114 | + <?> "expression" |
| 115 | + where |
| 116 | + binaryOperator infix_ name op = |
| 117 | + infix_ $ Parsec.label "binary operator" $ |
| 118 | + Syntax.BinOp op <$ symbol name |
| 119 | + |
| 120 | +term :: Parser Syntax.Expr |
| 121 | +term = |
| 122 | + Parsec.choice |
| 123 | + [ intLiteral |
| 124 | + , boolLiteral |
| 125 | + , variable |
| 126 | + , parens |
| 127 | + ] |
| 128 | + |
| 129 | +boolLiteral :: Parser Syntax.Expr |
| 130 | +boolLiteral = |
| 131 | + Syntax.Bool <$> Parsec.choice |
| 132 | + [ True <$ keyword "true" |
| 133 | + , False <$ keyword "false" |
| 134 | + ] |
| 135 | + |
| 136 | +intLiteral :: Parser Syntax.Expr |
| 137 | +intLiteral = |
| 138 | + Syntax.Int <$> decimal |
| 139 | + |
| 140 | +variable :: Parser Syntax.Expr |
| 141 | +variable = |
| 142 | + Syntax.Variable <$> identifier |
| 143 | + |
| 144 | +parens :: Parser Syntax.Expr |
| 145 | +parens = |
| 146 | + symbol "(" *> expr <* symbol ")" |
| 147 | + |
| 148 | +--------------------------------------------------------------------------------------------------- |
| 149 | + |
| 150 | +parse :: Text -> Either String Syntax.Expr |
| 151 | +parse source = |
| 152 | + Parsec.parse toplevel "" source |
| 153 | + & Bifunctor.first Parsec.errorBundlePretty |
0 commit comments