-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathParser.y
233 lines (184 loc) · 9.03 KB
/
Parser.y
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
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
{
module Parser(parseTokens) where
import Tokens
import Control.Monad.State
import ParserState
import qualified Data.Map as Map
import SymbolTable
import SyntaxTree
}
%name parse
%tokentype { Token }
%error { parseError }
%monad { State ParserState }
%token
int { TokenIntVal $$ }
str { TokenStrVal $$ }
id { TokenVar $$ }
'+' { TokenPlus }
'-' { TokenMinus }
'*' { TokenTimes }
'/' { TokenDiv }
'%' { TokenMod }
'(' { TokenLParen }
')' { TokenRParen }
'[' { TokenLBox }
']' { TokenRBox }
'{' { TokenLCurly }
'}' { TokenRCurly }
'&' { TokenAddr }
'=' { TokenAssign }
'<' { TokenLt }
'>' { TokenGt }
'<=' { TokenLtE }
'>=' { TokenGtE }
'!=' { TokenNE }
'==' { TokenEq }
'.' { TokenDot }
BEGIN { TokenBegin }
END { TokenEnd }
READ { TokenRead }
WRITE { TokenWrite }
ALLOC { TokenAlloc }
FREE { TokenFree }
INITIALIZE { TokenInitialize }
IF { TokenIf }
THEN { TokenThen }
ELSE { TokenElse }
ENDIF { TokenEndif }
WHILE { TokenWhile }
DO { TokenDo }
ENDWHILE { TokenEndwhile }
BREAK { TokenBreak }
CONTINUE { TokenCont }
INT { TokenInt }
STR { TokenStr }
DECL { TokenDecl }
ENDDECL { TokenEndDecl }
TYPE { TokenType }
ENDTYPE { TokenEndType }
MAIN { TokenMain }
RETURN { TokenReturn }
NULL { TokenNull }
',' { TokenComma }
';' { TokenStmtEnd }
%nonassoc '==' '!=' '>' '<' '>=' '<='
%left '+' '-'
%left '*' '/' '%'
%%
Program : TypeDefBlock GDeclBlock FDefBlock MainBlock { ($2, $3, $4) }
| TypeDefBlock GDeclBlock MainBlock { ($2, [], $3) }
{- TYPE DEFINITIONS GRAMMAR -}
TypeDefBlock : TYPE TypeDefList ENDTYPE {% saveTypeTable $2 }
| TYPE ENDTYPE {% saveTypeTable [] }
| {- empty -} {% saveTypeTable [] }
TypeDefList : TypeDefList TypeDef { $1 ++ [$2] }
| TypeDef { [$1] }
TypeDef : id '{' FieldDeclList '}' { ($1, $3) }
FieldDeclList : FieldDeclList FieldDecl { $1 ++ [$2] }
| FieldDecl { [$1] }
FieldDecl : Type BaseVar ';' { ($1, $2) }
Type : INT { "int" }
| STR { "str" }
| id { $1 }
{- GLOBAL DECLARATIONS GRAMMAR -}
GDeclBlock : DECL GDeclList ENDDECL {% saveGTable $2 }
| DECL ENDDECL { 4096 }
| {- empty -} { 4096 }
GDeclList : GDeclList GDecl { $1 ++ [$2] }
| GDecl { [$1] }
GDecl : Type GVarList ';' { ($1, $2) }
GVarList : GVarList ',' GDec { $1 ++ [$3] }
| GDec { [$1] }
GDec: BaseVar { $1 }
| id '(' ParamList ')' { F $1 $3 }
| '*' id '(' ParamList ')' { PF $2 $4 }
| id '[' int ']' { A $1 $3 }
| id '['int']' '['int']' { A2 $1 $3 $6 }
BaseVar : id { U $1 }
| '*' id { P $2 }
ParamList : ParamList ',' Param { $1 ++ [$3] }
| Param { [$1] }
| {- empty -} { [] }
Param : Type BaseVar { ($1, $2) }
{- FUNCTION DEFINITION GRAMMAR -}
FDefBlock : FDefBlock FDef { $1 ++ [$2] }
| FDef { [$1] }
FDef : FType FName '(' ParamList ')' '{' LDeclBlock Routine '}' {% fnTypeCheck ($1, $2, $4, $7, $8) }
FType: Type { $1 }
| Type'*' { $1 ++ "*" }
FName: id {% saveCurFn $1 }
LDeclBlock : DECL LDeclList ENDDECL {% saveLTable $2 }
| DECL ENDDECL {% saveLTable [] }
| {- empty -} {% saveLTable [] }
LDeclList : LDeclList LDecl { $1 ++ [$2] }
| LDecl { [$1] }
LDecl : Type LVarList ';' { ($1, $2) }
LVarList : LVarList ',' BaseVar { $1 ++ [$3] }
| BaseVar { [$1] }
Routine : BEGIN Slist Retstmt END { NodeConn $2 $3 }
| BEGIN Retstmt END { $2 }
Retstmt : RETURN RVal ';' {% let (t, v) = $2 in (retTypeCheck t >> return (NodeReturn v)) }
RVal : Variable {% varType $1 >>= \t -> return (t, $1) }
| FnCall {% fnType $1 >>= \t -> return (t, $1) }
| String { ("str", $1) }
| E2 { ("int", $1) }
| '&' Variable {% varType $2 >>= \t -> return (t++"*", NodeRef $2) }
| NULL { ("null", LeafNull) }
Slist : Slist Stmt { NodeConn $1 $2 }
| Stmt { $1 }
Stmt : Variable '=' RVal ';' {% let (t, v) = $3 in (assignTypeCheck $1 t >> return (NodeAssign $1 v)) }
| IF '(' B ')' THEN Slist ENDIF ';' { NodeIf $3 $6 }
| IF '(' B ')' THEN Slist ELSE Slist ENDIF ';' { NodeIfElse $3 $6 $8 }
| WHILE '(' B ')' DO Slist ENDWHILE ';' { NodeWhile $3 $6 }
| BREAK ';' { NodeBreak }
| CONTINUE ';' { NodeCont }
| FnCall ';' { $1 }
| Variable '=' ALLOC '(' ')' ';' {% varType $1 >>= \t -> (userTypeCheck t >> typeSize t) >>= \s -> return (NodeAlloc $1 s) }
E2 : E '+' E { NodeArmc '+' $1 $3 }
| E '-' E { NodeArmc '-' $1 $3 }
| E '*' E { NodeArmc '*' $1 $3 }
| E '/' E { NodeArmc '/' $1 $3 }
| E '%' E { NodeArmc '%' $1 $3 }
| '(' E2 ')' { $2 }
| int { LeafValInt $1 }
E : E2 { $1 }
| FnCall {% intCheck $1 }
| Variable {% intCheck $1 }
FnCall: id '(' ArgList ')' {% fnCallTypeCheck $1 $3 >>= \p -> return (LeafFn $1 p)}
| READ '(' Variable ')' { NodeRead $3 }
| WRITE '(' RVal ')' { let (t, v) = $3 in NodeWrite v }
| FREE '(' RVal ')' {% let (t, v) = $3 in (userTypeCheck t >> return (NodeFree v)) }
| INITIALIZE '(' ')' { NodeInitialize }
ArgList : ArgList ',' RVal { $1 ++ [$3] }
| RVal { [$1] }
| {- empty -} { [] }
B : RVal '<' RVal { NodeBool "<" (snd $1) (snd $3) }
| RVal '>' RVal { NodeBool ">" (snd $1) (snd $3) }
| RVal '<=' RVal { NodeBool "<=" (snd $1) (snd $3) }
| RVal '>=' RVal { NodeBool ">=" (snd $1) (snd $3) }
| RVal '==' RVal { NodeBool "==" (snd $1) (snd $3) }
| RVal '!=' RVal { NodeBool "!=" (snd $1) (snd $3) }
Variable : id {% symCheck (isUnit) $1 >> return (LeafVar $1 Simple) }
| id '[' E ']' {% symCheck (isArr) $1 >> return (LeafVar $1 (Index $3)) }
| id '['E']' '['E']' {% symCheck (isArr2) $1 >> return (LeafVar $1 (Index2D $3 $6)) }
| '*' id {% symCheck (isPtr) $2 >> return (LeafVar $2 Deref) }
| DotField {% (let n:ds = $1 in dotSymCheck n ds >>= \di -> return (LeafVar n (Dot di))) }
DotField : DotField '.' id { $1 ++ [$3] }
| id '.' id { [$1, $3] }
String : str { LeafValStr $1 }
{- MAIN FUNCTION GRAMMAR -}
MainBlock : INT Main '(' ')' '{' LDeclBlock Routine '}' { ($6, $7) }
Main: MAIN {% saveMainFn }
{
parseError t = error $ "Parse error: " ++ show t
parseTokens tokenStream = (gSymFull, sp, fDecl, main)
where
((sp, fDecl, main), (tTable, gSymTable, _, _)) = runState (parse tokenStream) startState
gSymFull = Map.insertWith (error "Main function declared twice") "main" (Func "int" [] "main") gSymTable
type Program =
( Int,
[FDef],
(LSymbolTable, SyntaxTree)
)
}