-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathParser.y
More file actions
209 lines (146 loc) · 7.88 KB
/
Parser.y
File metadata and controls
209 lines (146 loc) · 7.88 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
{
{-# LANGUAGE LambdaCase, GeneralizedNewtypeDeriving #-}
module Source.TypeNormalizer.Parser where
import Data.Char
import Prelude hiding (lookup)
import Data.Map(Map, insert,lookup,member,maxView)
import qualified Data.Map as M
import Control.Applicative hiding (Const)
import Data.List (mapAccumL)
import Control.Arrow
import Data.Maybe
import Source.Lexeme.StateMachine
import Source.TypeNormalizer.Model
}
%name calc
%tokentype { Token Int}
%error { parseError }
%monad { Either ParseError }
%token
'(' {Op }
')' {Cp }
'[' {OBrac }
']' {CBrac }
'~' {TypeEqual }
tuple_ {DesugaredTuple }
app_ {DesugaredApp }
either_ {Either }
comma {Comma }
required {Required }
required_ {Required_ }
unit_ {Unit }
construct_ {Mayus $$ }
vartype_ {Minus $$ }
app {App }
%%
WithClass : ContexLevel { ContexType (fst $1) (snd $1) }
| ContexLevel required_ ContexLevel { ContexType (Node (Basic Prod) [snd $1,fst $3]) (snd $3)
}
ContexLevel : TopLevel { ( Node (Basic Prod) [] , $1 ) }
| TopLevel required TopLevel { ( $1 , $3 ) }
TopLevel : ArgLevel { $1 }
| ArgLevel app TopLevel { Node (Basic Exp) [$3,$1] }
| ArgLevel '~' ArgLevel { Node (Closed "~") [$1,$3] }
ArgLevel : SimpleLevel { $1 }
| construct_ List { Node (Closed $1 ) $2 }
| vartype_ List { Node (Open $1 ) $2 }
| app_ List { Node (Basic Exp) $2 }
| tuple_ List { Node (Closed "(,)") $2 }
SimpleLevel : unit_ { Node (Basic Prod) [] }
| vartype_ { Node (Open $1) [] }
| construct_ { Node (Closed $1) [] }
| app_ { Node (Closed "(->)")[] }
| tuple_ { Node (Closed "(,)") [] }
| either_ SimpleLevel SimpleLevel { Node (Basic Sum) [$2,$3] }
| '[' TopLevel ']' { Node (Closed "[]") [$2] }
| '[' TopLevel CommaList ']' { Node (Closed "[]") [Node (Basic Prod) ($2 : $3)] }
| '(' TopLevel ')' { $2 }
| '(' TopLevel CommaList ')' { Node (Basic Prod) ($2 : $3) }
CommaList : comma TopLevel CommaList {$2 : $3 }
| comma TopLevel {[$2] }
List : SimpleLevel List { $1 : $2 }
| SimpleLevel {[$1] }
{
-- TODO, better error handling....
parseError :: [Token Int] -> Either ParseError a
parseError _ = Left SyntaxticError
data Token a = Op
| Cp
| OBrac
| CBrac
| App
| Either
| Comma
| Required
| Required_
| TypeEqual
| DesugaredTuple
| DesugaredApp
| Unit
| Mayus String
| Minus a
deriving Show
parse:: Maybe String -> String -> Either ParseError ContexType
parse (Just clazz) str = calc =<< ( do r <- lexer clazz
l <- lexer str
return$ transform (r++[Required_]++l)
)
parse Nothing str = calc =<< (transform <$> lexer str)
transform::[Token String] -> [Token Int]
transform = snd.mapAccumL go M.empty
where
go acc = \case
Minus x
| Just n <- lookup x acc -> (acc, Minus n)
| otherwise -> let n = maybe (-1) fst (maxView acc) + 1
in (insert x n acc, Minus n )
Op -> (acc , Op )
Cp -> (acc , Cp )
OBrac -> (acc , OBrac )
CBrac -> (acc , CBrac )
App -> (acc , App )
TypeEqual -> (acc , TypeEqual )
DesugaredTuple -> (acc , DesugaredTuple )
DesugaredApp -> (acc , DesugaredApp )
Either -> (acc , Either )
Comma -> (acc , Comma )
Required -> (acc , Required)
Required_ -> (acc , Required_)
Unit -> (acc , Unit )
Mayus x -> (acc , Mayus x )
data ParseError = LexicalError | SyntaxticError |EmptyContents deriving (Show,Eq)
-- TODO: add oneOf into the state machine....
oneOf :: Alternative f => [f a] -> f a
oneOf = foldr (<|>) empty
-- some strange behaviour using lexeme when individual lexeme definition order is changed
-- (Already in the TODO list for improving Source.Lexeme.StateMachine)
lexeme:: StateMachine Char (Token String)
lexeme = oneOf [ Comma <$ element ','
, DesugaredApp <$ string "(->)"
, Unit <$ element '(' <* element ')'
, Either <$ string "Either"
, App <$ string "->"
, Required <$ string "=>"
, TypeEqual <$ element '~'
, DesugaredTuple <$ string "(,)"
, Op <$ element '('
, Cp <$ element ')'
, OBrac <$ element '['
, CBrac <$ element ']'
, getMayus <$> such isUpper
<*> many (such validChar)
<*> optional (element '#')
, getMinus <$> (such isLower <|> element '_')
<*> many (such validChar)
]
where
--getMayus::Char -> String -> Maybe Char -> Token String
getMayus c str hash = Mayus $ c : str ++ maybe "" return hash
getMinus c str = Minus $ c : str
validChar c = isAlphaNum c || c == '_' || c == '\''
lexer str = let regex = many $ many (such isSpace) *> lexeme <* many (such isSpace)
in case tokenize regex str of
Nothing -> Left (LexicalError)
Just [] -> Left EmptyContents
Just xs -> Right xs
}