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.

276 lines
8.0 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. import Debug.Trace
  11. }
  12. %name parseExp Exp
  13. %name parseStmt Statement
  14. %name parseProg Program
  15. %name parseRepl ReplStatement
  16. %tokentype { Token }
  17. %monad { Alex }
  18. %lexer { lexer } { Token TokEof _ _ }
  19. %errorhandlertype explist
  20. %error { parseError }
  21. %token
  22. var { Token (TokVar _) _ _ }
  23. 'eof' { Token TokEof _ _ }
  24. '(' { Token TokOParen _ _ }
  25. ')' { Token TokCParen _ _ }
  26. '{' { Token TokOBrace _ _ }
  27. '}' { Token TokCBrace _ _ }
  28. START { Token TokLStart _ _ }
  29. END { Token TokLEnd _ _ }
  30. '[' { Token TokOSquare _ _ }
  31. ']' { Token TokCSquare _ _ }
  32. '{-#' { Token TokOPragma _ _ }
  33. '#-}' { Token TokCPragma _ _ }
  34. '\\' { Token TokLambda _ _ }
  35. '->' { Token TokArrow _ _ }
  36. ':' { Token TokColon _ _ }
  37. ';' { Token TokSemi _ _ }
  38. '=' { Token TokEqual _ _ }
  39. ',' { Token TokComma _ _ }
  40. '*' { Token TokStar _ _ }
  41. 'as' { Token TokAs _ _ }
  42. 'let' { Token TokLet _ _ }
  43. 'in' { Token TokIn _ _ }
  44. 'data' { Token TokData _ _ }
  45. 'case' { Token TokCase _ _ }
  46. 'where' { Token TokWhere _ _ }
  47. '&&' { Token TokAnd _ _ }
  48. '||' { Token TokOr _ _ }
  49. '.1' { Token TokPi1 _ _ }
  50. '.2' { Token TokPi2 _ _ }
  51. 'PRIMITIVE' { Token TokPrim _ _ }
  52. 'postulate' { Token TokPostulate _ _ }
  53. ':let' { Token TokReplLet _ _ }
  54. ':t' { Token (TokReplT _) _ _ }
  55. %%
  56. Exp :: { Expr }
  57. Exp
  58. : '\\' LambdaList '->' Exp { span $1 $4 $ makeLams $2 $4 }
  59. | '\\' MaybeLambdaList '[' System ']' { span $1 $5 $ makeLams $2 $ LamSystem $4 }
  60. | '\\' 'case' START CaseList END { span $1 $5 $ LamCase $4 }
  61. | '(' var ':' Exp ')' ProdTail { span $1 $6 $ Pi Ex (getVar $2) $4 $6 }
  62. | '{' var ':' Exp '}' ProdTail { span $1 $6 $ Pi Im (getVar $2) $4 $6 }
  63. | ExpApp '->' Exp { span $1 $3 $ Pi Ex (T.singleton '_') $1 $3 }
  64. | '(' var ':' Exp ')' '*' Exp { span $1 $7 $ Sigma (getVar $2) $4 $7 }
  65. | ExpApp '*' Exp { span $1 $3 $ Sigma (T.singleton '_') $1 $3 }
  66. | 'let' START LetList END 'in' Exp { span $1 $6 $ Let $3 $6 }
  67. | 'let' START LetList END Exp { span $1 $5 $ Let $3 $5 }
  68. | ExpApp { $1 }
  69. ExpApp :: { Expr }
  70. : ExpApp ExpProj { span $1 $2 $ App Ex $1 $2 }
  71. | ExpApp '{' Exp '}' { span $1 $4 $ App Im $1 $3 }
  72. | ExpProj { $1 }
  73. ExpProj :: { Expr }
  74. : ExpProj '.1' { span $1 $2 $ Proj1 $1 }
  75. | ExpProj '.2' { span $1 $2 $ Proj2 $1 }
  76. | Atom { $1 }
  77. Tuple :: { Expr }
  78. : Exp { $1 }
  79. | Exp ',' Tuple { span $1 $3 $ Pair $1 $3 }
  80. Atom :: { Expr }
  81. : var { span $1 $1 $ Var (getVar $1) }
  82. | '(' Tuple ')' { span $1 $3 $ $2 }
  83. ProdTail :: { Expr }
  84. : '(' VarList ':' Exp ')' ProdTail { span $1 $6 $ makePis Ex (thd $2) $4 $6 }
  85. | '{' VarList ':' Exp '}' ProdTail { span $1 $6 $ makePis Im (thd $2) $4 $6 }
  86. | '->' Exp { span $2 $2 $ $2 }
  87. MaybeLambdaList :: { [(Plicity, Text)] }
  88. : {- empty -} { [] }
  89. | LambdaList { $1 }
  90. LambdaList :: { [(Plicity, Text)] }
  91. : var { [(Ex, getVar $1)] }
  92. | var LambdaList { (Ex, getVar $1):$2 }
  93. | '{'var'}' { [(Im, getVar $2)] }
  94. | '{'var'}' LambdaList { (Im, getVar $2):$4 }
  95. LhsList :: { [(Plicity, Text)] }
  96. : { [] }
  97. | LambdaList { $1 }
  98. VarList :: { (Posn, Posn, [Text]) }
  99. : var { (startPosn $1, endPosn $1, [getVar $1]) }
  100. | var ',' VarList { case $3 of (_, end, xs) -> (startPosn $1, end, getVar $1:xs) }
  101. LetItem :: { LetItem }
  102. : var ':' Exp { LetDecl (getVar $1) $3 }
  103. | var LhsList '=' Rhs { LetBind (getVar $1) (makeLams $2 $4) }
  104. LetList :: { [LetItem] }
  105. : { [] }
  106. | LetItem { [$1] }
  107. | LetItem ';' LetList { $1:$3 }
  108. CaseItem :: { (Pattern, Expr) }
  109. : Pattern '->' Exp { ($1, $3) }
  110. CaseList :: { [(Pattern, Expr)] }
  111. : CaseItem { [$1] }
  112. | CaseItem Semis CaseList { $1:$3 }
  113. Pattern :: { Pattern }
  114. : PatVarList { makePattern $1 }
  115. PatVarList :: { (Posn, Posn, [Text]) }
  116. : var { (startPosn $1, endPosn $1, [getVar $1]) }
  117. | var PatVarList { case $2 of (_, end, xs) -> (startPosn $1, end, getVar $1:xs) }
  118. Statement :: { Statement }
  119. : VarList ':' Exp { spanSt $1 $3 $ Decl (thd $1) $3 }
  120. | var LhsList '=' Rhs { spanSt $1 $4 $ Defn (getVar $1) (makeLams $2 $4) }
  121. | '{-#' Pragma '#-}' { spanSt $1 $3 $ $2 }
  122. | 'postulate' START Postulates END { spanSt $1 $4 $ Postulate $3 }
  123. | 'data' var Parameters ':' Exp 'where' START Postulates END
  124. { spanSt $1 $9 $ Data (getVar $2) $3 $5 $8 }
  125. Parameters :: { [(Text, Plicity, Expr)] }
  126. : {- empty -} { [] }
  127. | '(' var ':' Exp ')' Parameters { (getVar $2, Ex, $4):$6 }
  128. | '{' var ':' Exp '}' Parameters { (getVar $2, Im, $4):$6 }
  129. Rhs :: { Expr }
  130. : Exp { $1 }
  131. | Exp 'where' START LetList END { span $1 $5 $ Let $4 $1 }
  132. ReplStatement :: { Statement }
  133. : Exp { spanSt $1 $1 $ ReplNf $1 }
  134. | ':t' Exp { spanSt $1 $2 $ ReplTy $2 }
  135. | ':let' VarList ':' Exp { spanSt $1 $4 $ Decl (thd $2) $4 }
  136. | ':let' var LhsList '=' Exp { spanSt $1 $5 $ Defn (getVar $2) (makeLams $3 $5) }
  137. | '{-#' Pragma '#-}' { spanSt $1 $3 $ $2 }
  138. Postulates :: { [(Text, Expr)] }
  139. : var ':' Exp { [(getVar $1, $3)] }
  140. | var ':' Exp Semis Postulates { (getVar $1, $3):$5 }
  141. StatementSeq :: { [Statement] }
  142. : Statement { [$1] }
  143. | Statement Semis { [$1] }
  144. | Statement Semis Program { $1:$3 }
  145. Program :: { [Statement] }
  146. : { [] }
  147. | Semis { [] }
  148. | StatementSeq { $1 }
  149. | Semis StatementSeq { $2 }
  150. Semis :: { () }
  151. : ';' { () }
  152. | ';' Semis { () }
  153. Pragma :: { Statement }
  154. : 'PRIMITIVE' var var { Builtin (getVar $2) (getVar $3) }
  155. | 'PRIMITIVE' var { Builtin (getVar $2) (getVar $2) }
  156. System :: { [(Condition, Expr)] }
  157. : {- empty system -} { [] }
  158. | NeSystem { $1 }
  159. NeSystem :: { [(Condition, Expr) ]}
  160. : SystemLhs '->' Exp { [($1, $3)] }
  161. | SystemLhs '->' Exp ',' NeSystem { ($1, $3):$5 }
  162. SystemLhs :: { Condition }
  163. : Formula 'as' var { Condition $1 (Just (getVar $3)) }
  164. | Formula { Condition $1 Nothing }
  165. Formula :: { Formula }
  166. : Disjn { $1 }
  167. | Disjn '&&' Disjn { $1 `FAnd` $3 }
  168. Disjn :: { Formula }
  169. : FAtom { $1 }
  170. | FAtom '||' FAtom { $1 `FOr` $3 }
  171. FAtom :: { Formula }
  172. : '(' var '=' var ')' {%
  173. case $4 of
  174. Token (TokVar x) _ _
  175. | x == T.pack "i0" -> pure (FIs0 (getVar $2))
  176. | x == T.pack "i1" -> pure (FIs1 (getVar $2))
  177. x -> parseError (x, ["i0", "i1"])
  178. }
  179. {
  180. lexer cont = alexMonadScan >>= cont
  181. parseError x = alexError (show x)
  182. makeLams xs b = foldr (uncurry Lam) b xs
  183. makePis p xs t b = foldr (flip (Pi p) t) b xs
  184. makeSigmas xs t b = foldr (flip Sigma t) b xs
  185. class HasPosn a where
  186. startPosn :: a -> Posn
  187. endPosn :: a -> Posn
  188. instance HasPosn Token where
  189. startPosn (Token _ l c) = Posn l c
  190. endPosn (Token t l c) = Posn l (c + tokSize t)
  191. instance HasPosn Expr where
  192. startPosn (Span _ s _) = s
  193. startPosn _ = error "no start posn in parsed expression?"
  194. endPosn (Span _ _ e) = e
  195. endPosn _ = error "no end posn in parsed expression?"
  196. instance HasPosn (Posn, Posn, a) where
  197. startPosn (s, _, _) = s
  198. endPosn (_, e, _) = e
  199. thd :: (a, b, c) -> c
  200. thd (x, y, z) = z
  201. span s e ex = Span ex (startPosn s) (endPosn e)
  202. spanSt s e ex = SpanSt ex (startPosn s) (endPosn e)
  203. getVar (Token (TokVar s) _ _) = s
  204. getVar _ = error "getVar non-var"
  205. makePattern (_, _, [x]) = PCap x
  206. makePattern (_, _, (x:xs)) = PCon x xs
  207. }