less prototype, less bad code implementation of CCHM type theory
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

119 lines
3.5 KiB

  1. {
  2. module Presyntax.Lexer where
  3. import qualified Data.ByteString.Lazy as Lbs
  4. import qualified Data.Text.Encoding as T
  5. import Presyntax.Tokens
  6. }
  7. %wrapper "monadUserState-bytestring"
  8. $alpha = [a-zA-Z]
  9. $digit = [0-9]
  10. $white_nol = $white # \n
  11. tokens :-
  12. $white_nol+ ;
  13. "--" .* \n ;
  14. <0,prtext> $alpha [$alpha $digit \_ \']* { yield TokVar }
  15. -- zero state: normal lexing
  16. <0> \= { always TokEqual }
  17. <0> \: { always TokColon }
  18. <0> \, { always TokComma }
  19. <0> \* { always TokStar }
  20. <0> ".1" { always TokPi1 }
  21. <0> ".2" { always TokPi2 }
  22. <0> \\ { always TokLambda }
  23. <0> "->" { always TokArrow }
  24. <0> \( { always TokOParen }
  25. <0> \{ { always TokOBrace }
  26. <0> \[ { always TokOSquare }
  27. <0> \) { always TokCParen }
  28. <0> \} { always TokCBrace }
  29. <0> \] { always TokCSquare }
  30. <0> \; { always TokSemi }
  31. <0> \n { just $ pushStartCode newline }
  32. <0> "&&" { always TokAnd }
  33. <0> "||" { always TokOr }
  34. <0> "{-" { just $ pushStartCode comment }
  35. <comment> {
  36. "-}" { \i l -> popStartCode *> skip i l }
  37. . ;
  38. }
  39. <0> "{-#" { \i l -> pushStartCode prkw *> always TokOPragma i l }
  40. <prkw> "PRIMITIVE" { \i l -> popStartCode *> pushStartCode prtext *> always TokPrim i l }
  41. <prtext> "#-}" { \i l -> popStartCode *> always TokCPragma i l }
  42. <0> ":let" { always TokReplLet }
  43. <0> ":t"("y"|"yp"|"ype"|()) { yield TokReplT }
  44. -- newline: emit a semicolon when de-denting
  45. <newline> {
  46. \n ;
  47. () { offsideRule }
  48. }
  49. {
  50. alexEOF :: Alex Token
  51. alexEOF = do
  52. (AlexPn _ l c, _, _, _) <- alexGetInput
  53. pure $ Token TokEof l c
  54. yield k (AlexPn _ l c, _, s, _) i = pure (Token (k $! (T.decodeUtf8 (Lbs.toStrict (Lbs.take i s)))) l c)
  55. always :: TokenClass -> AlexInput -> Int64 -> Alex Token
  56. always k x i = yield (const k) x i
  57. data AlexUserState = AlexUserState { layoutColumns :: [Int], startCodes :: [Int] }
  58. alexInitUserState = AlexUserState [1] []
  59. just :: Alex a -> AlexAction Token
  60. just k _ _ = k *> alexMonadScan
  61. getUserState :: Alex AlexUserState
  62. getUserState = Alex $ \s -> Right (s, alex_ust s)
  63. mapUserState :: (AlexUserState -> AlexUserState) -> Alex ()
  64. mapUserState k = Alex $ \s -> Right (s { alex_ust = k $! alex_ust s }, ())
  65. pushStartCode :: Int -> Alex ()
  66. pushStartCode c = do
  67. sc <- alexGetStartCode
  68. mapUserState $ \s -> s { startCodes = sc:startCodes s }
  69. alexSetStartCode c
  70. popStartCode :: Alex ()
  71. popStartCode = do
  72. sc <- startCodes <$> getUserState
  73. case sc of
  74. [] -> alexSetStartCode 0
  75. (x:xs) -> do
  76. mapUserState $ \s -> s { startCodes = xs }
  77. alexSetStartCode x
  78. offsideRule :: AlexInput -> Int64 -> Alex Token
  79. offsideRule (AlexPn _ line col, _, s, _) _
  80. | Lbs.null s = pure (Token TokEof line col)
  81. | otherwise = do
  82. ~(col':_) <- layoutColumns <$> getUserState
  83. case col `compare` col' of
  84. EQ -> do
  85. popStartCode
  86. pure (Token TokSemi line col)
  87. GT -> do
  88. popStartCode
  89. alexMonadScan
  90. LT -> alexError "wrong ass indentation"
  91. }