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.

245 lines
6.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. 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. '&&' { Token TokAnd _ _ }
  45. '||' { Token TokOr _ _ }
  46. '.1' { Token TokPi1 _ _ }
  47. '.2' { Token TokPi2 _ _ }
  48. 'PRIMITIVE' { Token TokPrim _ _ }
  49. 'postulate' { Token TokPostulate _ _ }
  50. ':let' { Token TokReplLet _ _ }
  51. ':t' { Token (TokReplT _) _ _ }
  52. %%
  53. Exp :: { Expr }
  54. Exp
  55. : '\\' LambdaList '->' Exp { span $1 $4 $ makeLams $2 $4 }
  56. | '\\' MaybeLambdaList '[' System ']' { span $1 $5 $ makeLams $2 $ LamSystem $4 }
  57. | '(' var ':' Exp ')' ProdTail { span $1 $6 $ Pi Ex (getVar $2) $4 $6 }
  58. | '{' var ':' Exp '}' ProdTail { span $1 $6 $ Pi Im (getVar $2) $4 $6 }
  59. | ExpApp '->' Exp { span $1 $3 $ Pi Ex (T.singleton '_') $1 $3 }
  60. | '(' var ':' Exp ')' '*' Exp { span $1 $7 $ Sigma (getVar $2) $4 $7 }
  61. | ExpApp '*' Exp { span $1 $3 $ Sigma (T.singleton '_') $1 $3 }
  62. | 'let' START LetList END 'in' Exp { span $1 $6 $ Let $3 $6 }
  63. | 'let' START LetList END Exp { span $1 $5 $ Let $3 $5 }
  64. | ExpApp { $1 }
  65. ExpApp :: { Expr }
  66. : ExpApp ExpProj { span $1 $2 $ App Ex $1 $2 }
  67. | ExpApp '{' Exp '}' { span $1 $4 $ App Im $1 $3 }
  68. | ExpProj { $1 }
  69. ExpProj :: { Expr }
  70. : ExpProj '.1' { span $1 $2 $ Proj1 $1 }
  71. | ExpProj '.2' { span $1 $2 $ Proj2 $1 }
  72. | Atom { $1 }
  73. Tuple :: { Expr }
  74. : Exp { $1 }
  75. | Exp ',' Tuple { span $1 $3 $ Pair $1 $3 }
  76. Atom :: { Expr }
  77. : var { span $1 $1 $ Var (getVar $1) }
  78. | '(' Tuple ')' { span $1 $3 $ $2 }
  79. ProdTail :: { Expr }
  80. : '(' VarList ':' Exp ')' ProdTail { span $1 $6 $ makePis Ex (thd $2) $4 $6 }
  81. | '{' VarList ':' Exp '}' ProdTail { span $1 $6 $ makePis Im (thd $2) $4 $6 }
  82. | '->' Exp { span $2 $2 $ $2 }
  83. MaybeLambdaList :: { [(Plicity, Text)] }
  84. : {- empty -} { [] }
  85. | LambdaList { $1 }
  86. LambdaList :: { [(Plicity, Text)] }
  87. : var { [(Ex, getVar $1)] }
  88. | var LambdaList { (Ex, getVar $1):$2 }
  89. | '{'var'}' { [(Im, getVar $2)] }
  90. | '{'var'}' LambdaList { (Im, getVar $2):$4 }
  91. LhsList :: { [(Plicity, Text)] }
  92. : { [] }
  93. | LambdaList { $1 }
  94. VarList :: { (Posn, Posn, [Text]) }
  95. : var { (startPosn $1, endPosn $1, [getVar $1]) }
  96. | var ',' VarList { case $3 of (_, end, xs) -> (startPosn $1, end, getVar $1:xs) }
  97. LetItem :: { LetItem }
  98. : var ':' Exp { LetDecl (getVar $1) $3 }
  99. | var LhsList '=' Exp { LetBind (getVar $1) (makeLams $2 $4) }
  100. LetList :: { [LetItem] }
  101. : { [] }
  102. | LetItem { [$1] }
  103. | LetItem ';' LetList { $1:$3 }
  104. Statement :: { Statement }
  105. : VarList ':' Exp { spanSt $1 $3 $ Decl (thd $1) $3 }
  106. | var LhsList '=' Exp { spanSt $1 $4 $ Defn (getVar $1) (makeLams $2 $4) }
  107. | '{-#' Pragma '#-}' { spanSt $1 $3 $ $2 }
  108. | 'postulate' START Postulates END { spanSt $1 $4 $ Postulate $3 }
  109. ReplStatement :: { Statement }
  110. : Exp { spanSt $1 $1 $ ReplNf $1 }
  111. | ':t' Exp { spanSt $1 $2 $ ReplTy $2 }
  112. | ':let' VarList ':' Exp { spanSt $1 $4 $ Decl (thd $2) $4 }
  113. | ':let' var LhsList '=' Exp { spanSt $1 $5 $ Defn (getVar $2) (makeLams $3 $5) }
  114. | '{-#' Pragma '#-}' { spanSt $1 $3 $ $2 }
  115. Postulates :: { [(Text, Expr)] }
  116. : var ':' Exp { [(getVar $1, $3)] }
  117. | var ':' Exp Semis Postulates { (getVar $1, $3):$5 }
  118. StatementSeq :: { [Statement] }
  119. : Statement { [$1] }
  120. | Statement Semis { [$1] }
  121. | Statement Semis Program { $1:$3 }
  122. Program :: { [Statement] }
  123. : { [] }
  124. | Semis { [] }
  125. | StatementSeq { $1 }
  126. | Semis StatementSeq { $2 }
  127. Semis :: { () }
  128. : ';' { () }
  129. | ';' Semis { () }
  130. Pragma :: { Statement }
  131. : 'PRIMITIVE' var var { Builtin (getVar $2) (getVar $3) }
  132. | 'PRIMITIVE' var { Builtin (getVar $2) (getVar $2) }
  133. System :: { [(Condition, Expr)] }
  134. : {- empty system -} { [] }
  135. | NeSystem { $1 }
  136. NeSystem :: { [(Condition, Expr) ]}
  137. : SystemLhs '->' Exp { [($1, $3)] }
  138. | SystemLhs '->' Exp ',' NeSystem { ($1, $3):$5 }
  139. SystemLhs :: { Condition }
  140. : Formula 'as' var { Condition $1 (Just (getVar $3)) }
  141. | Formula { Condition $1 Nothing }
  142. Formula :: { Formula }
  143. : Disjn { $1 }
  144. | Disjn '&&' Disjn { $1 `FAnd` $3 }
  145. Disjn :: { Formula }
  146. : FAtom { $1 }
  147. | FAtom '||' FAtom { $1 `FOr` $3 }
  148. FAtom :: { Formula }
  149. : '(' var '=' var ')' {%
  150. case $4 of
  151. Token (TokVar x) _ _
  152. | x == T.pack "i0" -> pure (FIs0 (getVar $2))
  153. | x == T.pack "i1" -> pure (FIs1 (getVar $2))
  154. x -> parseError (x, ["i0", "i1"])
  155. }
  156. {
  157. lexer cont = alexMonadScan >>= cont
  158. parseError x = alexError (show x)
  159. makeLams xs b = foldr (uncurry Lam) b xs
  160. makePis p xs t b = foldr (flip (Pi p) t) b xs
  161. makeSigmas xs t b = foldr (flip Sigma t) b xs
  162. class HasPosn a where
  163. startPosn :: a -> Posn
  164. endPosn :: a -> Posn
  165. instance HasPosn Token where
  166. startPosn (Token _ l c) = Posn l c
  167. endPosn (Token t l c) = Posn l (c + tokSize t)
  168. instance HasPosn Expr where
  169. startPosn (Span _ s _) = s
  170. startPosn _ = error "no start posn in parsed expression?"
  171. endPosn (Span _ _ e) = e
  172. endPosn _ = error "no end posn in parsed expression?"
  173. instance HasPosn (Posn, Posn, a) where
  174. startPosn (s, _, _) = s
  175. endPosn (_, e, _) = e
  176. thd :: (a, b, c) -> c
  177. thd (x, y, z) = z
  178. span s e ex = Span ex (startPosn s) (endPosn e)
  179. spanSt s e ex = SpanSt ex (startPosn s) (endPosn e)
  180. getVar (Token (TokVar s) _ _) = s
  181. getVar _ = error "getVar non-var"
  182. }