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.

213 lines
5.9 KiB

  1. {
  2. {-# LANGUAGE FlexibleInstances, ViewPatterns #-}
  3. module Presyntax.Parser where
  4. import qualified Data.Text as T
  5. import Data.Text (Text)
  6. import Presyntax.Presyntax
  7. import Presyntax.Tokens
  8. import Presyntax.Lexer
  9. import Prelude hiding (span)
  10. }
  11. %name parseExp Exp
  12. %name parseStmt Statement
  13. %name parseProg Program
  14. %name parseRepl ReplStatement
  15. %tokentype { Token }
  16. %monad { Alex }
  17. %lexer { lexer } { Token TokEof _ _ }
  18. %errorhandlertype explist
  19. %error { parseError }
  20. %token
  21. var { Token (TokVar _) _ _ }
  22. 'eof' { Token TokEof _ _ }
  23. '(' { Token TokOParen _ _ }
  24. ')' { Token TokCParen _ _ }
  25. '{' { Token TokOBrace _ _ }
  26. '}' { Token TokCBrace _ _ }
  27. '[' { Token TokOSquare _ _ }
  28. ']' { Token TokCSquare _ _ }
  29. '{-#' { Token TokOPragma _ _ }
  30. '#-}' { Token TokCPragma _ _ }
  31. '\\' { Token TokLambda _ _ }
  32. '->' { Token TokArrow _ _ }
  33. ':' { Token TokColon _ _ }
  34. ';' { Token TokSemi _ _ }
  35. '=' { Token TokEqual _ _ }
  36. ',' { Token TokComma _ _ }
  37. '*' { Token TokStar _ _ }
  38. 'as' { Token TokAs _ _ }
  39. '&&' { Token TokAnd _ _ }
  40. '||' { Token TokOr _ _ }
  41. '.1' { Token TokPi1 _ _ }
  42. '.2' { Token TokPi2 _ _ }
  43. 'PRIMITIVE' { Token TokPrim _ _ }
  44. ':let' { Token TokReplLet _ _ }
  45. ':t' { Token (TokReplT _) _ _ }
  46. %%
  47. Exp :: { Expr }
  48. Exp
  49. : '\\' LambdaList '->' Exp { span $1 $4 $ makeLams $2 $4 }
  50. | '\\' MaybeLambdaList '[' System ']' { span $1 $5 $ makeLams $2 $ LamSystem $4 }
  51. | '(' var ':' Exp ')' ProdTail { span $1 $6 $ Pi Ex (getVar $2) $4 $6 }
  52. | '{' var ':' Exp '}' ProdTail { span $1 $6 $ Pi Im (getVar $2) $4 $6 }
  53. | ExpApp '->' Exp { span $1 $3 $ Pi Ex (T.singleton '_') $1 $3 }
  54. | '(' var ':' Exp ')' '*' Exp { span $1 $7 $ Sigma (getVar $2) $4 $7 }
  55. | ExpApp '*' Exp { span $1 $3 $ Sigma (T.singleton '_') $1 $3 }
  56. | ExpApp { $1 }
  57. ExpApp :: { Expr }
  58. : ExpApp ExpProj { span $1 $2 $ App Ex $1 $2 }
  59. | ExpApp '{' Exp '}' { span $1 $4 $ App Im $1 $3 }
  60. | ExpProj { $1 }
  61. ExpProj :: { Expr }
  62. : ExpProj '.1' { span $1 $2 $ Proj1 $1 }
  63. | ExpProj '.2' { span $1 $2 $ Proj2 $1 }
  64. | Atom { $1 }
  65. Tuple :: { Expr }
  66. : Exp { $1 }
  67. | Exp ',' Tuple { span $1 $3 $ Pair $1 $3 }
  68. Atom :: { Expr }
  69. : var { span $1 $1 $ Var (getVar $1) }
  70. | '(' Tuple ')' { span $1 $3 $ $2 }
  71. ProdTail :: { Expr }
  72. : '(' VarList ':' Exp ')' ProdTail { span $1 $6 $ makePis Ex (thd $2) $4 $6 }
  73. | '{' VarList ':' Exp '}' ProdTail { span $1 $6 $ makePis Im (thd $2) $4 $6 }
  74. | '->' Exp { span $2 $2 $ $2 }
  75. MaybeLambdaList :: { [(Plicity, Text)] }
  76. : {- empty -} { [] }
  77. | LambdaList { $1 }
  78. LambdaList :: { [(Plicity, Text)] }
  79. : var { [(Ex, getVar $1)] }
  80. | var LambdaList { (Ex, getVar $1):$2 }
  81. | '{'var'}' { [(Im, getVar $2)] }
  82. | '{'var'}' LambdaList { (Im, getVar $2):$4 }
  83. LhsList :: { [(Plicity, Text)] }
  84. : { [] }
  85. | LambdaList { $1 }
  86. VarList :: { (Posn, Posn, [Text]) }
  87. : var { (startPosn $1, endPosn $1, [getVar $1]) }
  88. | var ',' VarList { case $3 of (_, end, xs) -> (startPosn $1, end, getVar $1:xs) }
  89. Statement :: { Statement }
  90. : VarList ':' Exp { spanSt $1 $3 $ Decl (thd $1) $3 }
  91. | var LhsList '=' Exp { spanSt $1 $4 $ Defn (getVar $1) (makeLams $2 $4) }
  92. | '{-#' Pragma '#-}' { spanSt $1 $3 $ $2 }
  93. ReplStatement :: { Statement }
  94. : Exp { spanSt $1 $1 $ ReplNf $1 }
  95. | ':t' Exp { spanSt $1 $2 $ ReplTy $2 }
  96. | ':let' VarList ':' Exp { spanSt $1 $4 $ Decl (thd $2) $4 }
  97. | ':let' var LhsList '=' Exp { spanSt $1 $5 $ Defn (getVar $2) (makeLams $3 $5) }
  98. | '{-#' Pragma '#-}' { spanSt $1 $3 $ $2 }
  99. Program :: { [Statement] }
  100. : Statement { [$1] }
  101. | Semis Program { $2 }
  102. | Statement Semis Program { $1:$3 }
  103. Semis :: { () }
  104. : ';' { () }
  105. | ';' Semis { () }
  106. Pragma :: { Statement }
  107. : 'PRIMITIVE' var var { Builtin (getVar $2) (getVar $3) }
  108. | 'PRIMITIVE' var { Builtin (getVar $2) (getVar $2) }
  109. System :: { [(Condition, Expr)] }
  110. : {- empty system -} { [] }
  111. | NeSystem { $1 }
  112. NeSystem :: { [(Condition, Expr) ]}
  113. : SystemLhs '->' Exp { [($1, $3)] }
  114. | SystemLhs '->' Exp ',' NeSystem { ($1, $3):$5 }
  115. SystemLhs :: { Condition }
  116. : Formula 'as' var { Condition $1 (Just (getVar $3)) }
  117. | Formula { Condition $1 Nothing }
  118. Formula :: { Formula }
  119. : Disjn { $1 }
  120. | Disjn '&&' Disjn { $1 `FAnd` $3 }
  121. Disjn :: { Formula }
  122. : FAtom { $1 }
  123. | FAtom '||' FAtom { $1 `FOr` $3 }
  124. FAtom :: { Formula }
  125. : '(' var '=' var ')' {%
  126. case $4 of
  127. Token (TokVar x) _ _
  128. | x == T.pack "i0" -> pure (FIs0 (getVar $2))
  129. | x == T.pack "i1" -> pure (FIs1 (getVar $2))
  130. x -> parseError (x, ["i0", "i1"])
  131. }
  132. {
  133. lexer cont = alexMonadScan >>= cont
  134. parseError x = alexError (show x)
  135. makeLams xs b = foldr (uncurry Lam) b xs
  136. makePis p xs t b = foldr (flip (Pi p) t) b xs
  137. makeSigmas xs t b = foldr (flip Sigma t) b xs
  138. class HasPosn a where
  139. startPosn :: a -> Posn
  140. endPosn :: a -> Posn
  141. instance HasPosn Token where
  142. startPosn (Token _ l c) = Posn l c
  143. endPosn (Token t l c) = Posn l (c + tokSize t)
  144. instance HasPosn Expr where
  145. startPosn (Span _ s _) = s
  146. startPosn _ = error "no start posn in parsed expression?"
  147. endPosn (Span _ _ e) = e
  148. endPosn _ = error "no end posn in parsed expression?"
  149. instance HasPosn (Posn, Posn, a) where
  150. startPosn (s, _, _) = s
  151. endPosn (_, e, _) = e
  152. thd :: (a, b, c) -> c
  153. thd (x, y, z) = z
  154. span s e ex = Span ex (startPosn s) (endPosn e)
  155. spanSt s e ex = SpanSt ex (startPosn s) (endPosn e)
  156. getVar (Token (TokVar s) _ _) = s
  157. getVar _ = error "getVar non-var"
  158. }