codeb: if mit lblcnt (=labelcounter)
[uebersetzerbau-ss10.git] / codeb / parser.y
1 %{
2         #include <stdio.h>
3         #include <stdlib.h>
4         #include <string.h>
5         #include "symtable.h"
6         #include "chelper.h"
7         #include "tree.h"
8
9         #define MAX(A,B) (A > B ? A : B)
10 %}
11
12 %start Input
13 %token STRUCT END METHOD VAR IF THEN ELSE WHILE DO RETURN NOT OR THIS IDENT NUM ASSIGN
14
15 @macro xxputsin(xx,)
16         @i xx = @Statement.sin@;
17 @end
18
19 @macro statinout()
20         @i @Statement.sout@ = @Statement.sin@;
21         /* das
22          *> xxputsin(@Statement.sout@,)
23          * geht nicht, weil verschachtelte macros deaktiviert sind */
24 @end
25
26 @macro lblcountinout()
27         @i @Statement.lblcnt_out@ = @Statement.lblcnt_in@;
28 @end
29
30 /* beschreibung der attribute
31  * s: symboltabelle
32  * f: symboltabelle fuer quirks mit structur und parameter
33  * gparamges: anzahl der parameter in einer methode
34  * parms: parametercounter
35  * node: baum fuer iburg
36  * sin: symboltabelle fuer statement ("eingabe")
37  * sout: symboltabelle die aus einem statement wieder rauskommt ("ausgabe")
38  */
39 @autoinh s gparamges
40 @autosyn node imm
41
42 @attributes { char *name; } IDENT
43 @attributes { long val; } NUM
44 @attributes { struct symbol *f; int paramges; int parms; } Parms
45 @attributes { struct symbol *f; } Program Structdef;
46 @attributes { struct symbol *f; int offsetcount; } FeldID
47 @attributes { struct symbol *s; } Methoddef
48 @attributes { struct symbol *s; int gparamges; } Exprs
49 @attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; } Statseq
50 @attributes { struct symbol *s; int gparamges; struct treenode *node; short imm; } Expr Minusterm Multerm Orterm Feld Term
51 @attributes { struct symbol *s; int gparamges; struct treenode *node; } Lexpr
52 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; int vars; int lblcnt_in; int lblcnt_out; } Statement
53
54 @traversal @postorder c
55 @traversal @preorder reg
56 @traversal @preorder gen
57
58 %%
59 Input:
60           Program
61           @{
62             @i @Program.f@ = tab_new();
63             @gen printf("\t.text\n");
64           @}
65         ;
66
67 Program:
68           Methoddef ';' Program
69           @{
70             @i @Methoddef.s@ = @Program.0.f@;
71             @i @Program.1.f@ = @Program.0.f@;
72           @}
73
74         | Structdef ';' Program
75           @{
76             @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
77           @}
78         |
79         ;
80
81 Methoddef:
82           METHOD IDENT '(' Parms ')' Statseq END
83           @{
84             @i @Parms.parms@ = 1;
85             @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
86                 @i @Statseq.gparamges@ = @Parms.paramges@;
87                 @i @Statseq.lblcnt_in@ = 0;
88             @gen func_header(@IDENT.name@);
89           @}
90         ;
91
92 Structdef:
93           STRUCT FeldID END
94           @{
95             @i @Structdef.f@ = @FeldID.f@;
96                 @i @FeldID.offsetcount@ = 0;
97           @}
98         ;
99
100 Parms:
101           /* lokale Vars werden in Statement in die tabelle eingefuegt */
102           IDENT Parms
103           @{
104             @i @Parms.1.parms@ = @Parms.0.parms@ + 1;
105                 @i @Parms.0.paramges@ = @Parms.1.paramges@;
106             @i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@, -1);
107           @}
108
109         |
110           @{
111             @i @Parms.f@ = tab_new();
112                 @i @Parms.paramges@ = @Parms.parms@;
113           @}
114         ;
115
116 FeldID:
117           IDENT FeldID
118           @{
119             @i @FeldID.1.offsetcount@ = @FeldID.0.offsetcount@ + 1;
120             @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1, @FeldID.0.offsetcount@);
121           @}
122
123         |
124           @{
125             @i @FeldID.f@ = tab_new();
126           @}
127         ;
128
129 Statseq:
130           Statement ';' Statseq
131           @{
132                 @i @Statement.sin@ = @Statseq.0.s@;
133                 @i @Statement.lblcnt_in@ = @Statseq.0.lblcnt_in@;
134
135                 @i @Statseq.1.s@ = @Statement.sout@;
136                 @i @Statseq.1.lblcnt_in@ = @Statement.lblcnt_out@;
137                 @i @Statseq.1.gparamges@ = @Statseq.0.gparamges@ + @Statement.vars@;
138
139                 @i @Statseq.0.lblcnt_out@ = @Statseq.1.lblcnt_out@;
140           @}
141
142         |
143           @{
144                 @i @Statseq.0.lblcnt_out@ = @Statseq.0.lblcnt_in@;
145           @}
146         ;
147
148 Statement:
149           Lexpr ASSIGN Expr
150           @{
151                 statinout()
152                 lblcountinout()
153                 xxputsin(@Lexpr.s@,)
154                 xxputsin(@Expr.s@,)
155             @i @Statement.node@ = new_node(O_ASSIGN, @Lexpr.node@, @Expr.node@);
156                 @i @Statement.vars@ = 0;
157                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
158
159                 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
160           @}
161
162         | VAR IDENT ASSIGN Expr
163           @{
164                 /* tab_clone ist hier noetig, vgl. folgendes statement
165                  * > var x := x - 1; */
166                 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, @Statement.gparamges@, -1);
167                 lblcountinout()
168                 xxputsin(@Expr.s@,)
169
170                 @i @Statement.node@ = new_node(O_ASSIGN, new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, @Statement.gparamges@), @Expr.node@);
171                 @i @Statement.vars@ = 1;
172                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
173
174                 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
175           @}
176
177         | Expr
178           @{
179                 statinout()
180                 lblcountinout()
181                 xxputsin(@Expr.s@,)
182             @i @Statement.node@ = TREENULL;
183                 @i @Statement.vars@ = 0;
184           @}
185
186         | IF Expr THEN Statseq END
187           @{
188                 statinout()
189                 @i @Statseq.lblcnt_in@ =  @Statement.lblcnt_in@ + 1;
190                 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
191                 xxputsin(@Expr.s@,)
192                 xxputsin(@Statseq.s@,)
193
194                 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
195                 @i @Statement.vars@ = 0;
196
197                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
198                 @gen {
199                         write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
200                         /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
201                         printf("\ttest %s1, %%rax\n\tjz %s_ifend_%d\n", "$", get_func_name(), @Statement.lblcnt_in@);
202                 }
203                 @gen @revorder(1) printf("%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
204           @}
205
206         | IF Expr THEN Statseq ELSE Statseq END
207           @{
208                 statinout()
209                 lblcountinout()
210                 /* TODO */
211                 @i @Statseq.0.lblcnt_in@ =  @Statement.lblcnt_in@ + 1;
212                 @i @Statseq.1.lblcnt_in@ =  @Statement.lblcnt_in@ + 1;
213                 xxputsin(@Expr.s@,)
214                 xxputsin(@Statseq.0.s@,)
215                 xxputsin(@Statseq.1.s@,)
216             @i @Statement.node@ = TREENULL;
217                 @i @Statement.vars@ = 0;
218           @}
219
220         | WHILE Expr DO Statseq END
221           @{
222                 statinout()
223                 lblcountinout()
224                 /* TODO */
225                 @i @Statseq.0.lblcnt_in@ =  @Statement.lblcnt_in@ + 1;
226                 xxputsin(@Expr.s@,)
227                 xxputsin(@Statseq.s@,)
228             @i @Statement.node@ = TREENULL;
229                 @i @Statement.vars@ = 0;
230           @}
231
232         | RETURN Expr
233           @{
234                 statinout()
235                 lblcountinout()
236                 xxputsin(@Expr.s@,)
237
238                 @i @Statement.vars@ = 0;
239                 @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
240                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
241
242                 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
243           @}
244         ;
245
246 Lexpr:
247           IDENT
248           @{
249             @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
250
251                 /* TODO: selbe Code wie bei Term/IDENT -- schoener machen! */
252             @i {
253                         @Lexpr.node@ = TREENULL;
254                         if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
255                                 /* es handelt sich um ein feldzugriff auf this */
256                                 @Lexpr.node@ = new_field(@IDENT.name@, new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0), TREENULL, tab_lookup(@Lexpr.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Lexpr.s@, @IDENT.name@, S_FIELD)->soffset);
257                         } else { /* param oder var */
258                                 int tmp = tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
259                                 @Lexpr.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
260                         }
261                 }
262
263                 @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
264                         /* TODO: kein schoener hack? */
265                         @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
266                 }
267           @}
268
269         | Feld
270         ;
271
272 Feld: Term '.' IDENT
273           @{
274             @c check(@Feld.s@, @IDENT.name@, S_FIELD);
275             @i @Feld.node@ = new_field(@IDENT.name@, @Term.node@, TREENULL, tab_lookup(@Feld.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Feld.s@, @IDENT.name@, S_FIELD)->soffset);
276
277                 @reg @Term.node@->reg = @Feld.node@->reg;
278           @}
279         ;
280
281 Expr:
282           Term
283           @{
284             @reg @Term.node@->reg = @Expr.node@->reg;
285           @}
286
287         | NOT Term
288           @{
289                 @i @Expr.node@ = new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL));
290
291                 @reg @Term.node@->reg = @Expr.node@->reg;
292           @}
293
294         | Term Minusterm
295           @{
296             @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
297                 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
298
299                 @reg {
300                         if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
301                                 @Term.node@->reg = @Expr.node@->reg;
302                                 if(@Minusterm.imm@) {
303                                         @Minusterm.node@->reg = @Expr.node@->reg;
304                                 } else {
305                                         @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
306                                 }
307                         }
308                 }
309           @}
310
311         | Term Multerm
312           @{
313             @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
314                 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
315
316                 @reg {
317                         @Term.node@->reg = @Expr.node@->reg;
318                         if(@Term.imm@) {
319                                 @Multerm.node@->reg = @Expr.node@->reg;
320                         } else {
321                                 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
322                         }
323                 }
324           @}
325
326         | Term Orterm
327           @{
328             @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
329                 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
330
331                 @reg {
332                         @Term.node@->reg = @Expr.node@->reg;
333                         @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
334                 }
335           @}
336
337         | Term '<' Term
338           @{
339             @i @Expr.node@ = new_node(O_LESS, @Term.0.node@, @Term.1.node@);
340                 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
341
342                 @reg {
343                         @Term.0.node@->reg = @Expr.node@->reg;
344                         @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
345                 }
346           @}
347
348         | Term '=' Term
349           @{
350             @i @Expr.node@ = new_node(O_EQ, @Term.0.node@, @Term.1.node@);
351                 @i @Expr.imm@ = @Term.0.imm@ && @Term.0.imm@;
352
353                 @reg {
354                         @Term.0.node@->reg = @Expr.node@->reg;
355                         @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
356                 }
357           @}
358         ;
359
360 Minusterm:
361           '-' Term Minusterm
362           @{
363             @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
364                 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
365
366             @reg {
367                         @Minusterm.1.node@->reg = @Minusterm.node@->reg;
368                         if(@Minusterm.1.imm@) {
369                                 @Term.node@->reg = @Minusterm.node@->reg;
370                         } else {
371                                 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
372                         }
373                 }
374           @}
375
376         | '-' Term
377           @{
378             @reg @Term.node@->reg = @Minusterm.node@->reg;
379           @}
380         ;
381
382 Multerm:
383           '*' Term Multerm
384           @{
385             @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
386                 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
387
388             @reg {
389                         @Multerm.1.node@->reg = @Multerm.node@->reg;
390                         if(@Multerm.1.imm@) {
391                                 @Term.node@->reg = @Multerm.node@->reg;
392                         } else {
393                                 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
394                         }
395                 }
396           @}
397
398         | '*' Term
399           @{
400             @reg @Term.node@->reg = @Multerm.node@->reg;
401           @}
402         ;
403
404 Orterm:
405           OR Term Orterm
406           @{
407             @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
408                 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
409
410             @reg {
411                         @Orterm.1.node@->reg = @Orterm.node@->reg;
412                         if(@Orterm.1.imm@) {
413                                 @Term.node@->reg = @Orterm.node@->reg;
414                         } else {
415                                 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
416                         }
417                 }
418           @}
419         | OR Term
420           @{
421             @reg @Term.node@->reg = @Orterm.node@->reg;
422           @}
423
424         ;
425
426 Term:
427           '(' Expr ')'
428           @{
429             @i @Term.node@ = @Expr.node@;
430           @}
431
432         | NUM
433           @{
434             @i @Term.node@ = new_number(@NUM.val@);
435                 @i @Term.imm@ = 1;
436           @}
437
438         | '-' NUM
439           @{
440             @i @Term.node@ = new_number(-1 * (@NUM.val@));
441                 @i @Term.imm@ = 1;
442           @}
443
444         | THIS
445           @{
446             @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
447                 @i @Term.imm@ = 0;
448           @}
449
450         | IDENT
451           @{
452             @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
453
454                 @i @Term.imm@ = 0;
455             @i {
456                         @Term.node@ = TREENULL;
457                         if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
458                                 /* es handelt sich um ein feldzugriff auf this */
459                                 @Term.node@ = new_field(@IDENT.name@, new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0), TREENULL, tab_lookup(@Term.s@, @IDENT.name@, S_FIELD) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_FIELD)->soffset);
460                         } else { /* param oder var */
461                                 int tmp = tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL ? -1 : tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM)->param_index;
462                                 @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
463                         }
464                 }
465
466                 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
467                         /* TODO: kein schoener hack? */
468                         @Term.node@->kids[0]->reg = @Term.node@->reg;
469                 }
470           @}
471
472         | Feld
473           @{
474             @i @Term.node@ = @Feld.node@;
475                 @i @Term.imm@ = 0;
476           @}
477
478         | IDENT '(' Exprs ')'
479           @{
480             @i @Term.node@ = TREENULL;
481                 @i @Term.imm@ = 0;
482           @}
483
484         | Term '.' IDENT '(' Exprs ')'
485           @{
486             @i @Term.node@ = TREENULL;
487                 @i @Term.imm@ = 0;
488           @}
489
490         ;
491
492 Exprs:
493           Expr ',' Exprs
494         | Expr
495         |
496         ;
497 %%
498
499 extern int yylex();
500 extern int yylineno;
501
502 int yyerror(char *error_text)
503 {
504         fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
505         exit(2);
506 }
507
508 int main(int argc, char **argv)
509 {
510         #if 0
511         yydebug=1;
512         #endif
513         yyparse();
514         return 0;
515 }
516