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.

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