ppc: alle codeb testfaelle klappen nun auch
[uebersetzerbau-ss10.git] / gesamt_ppc / 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 @macro varsinout()
31         @i @Statement.vars_out@ = @Statement.vars_in@;
32 @end
33
34 /* beschreibung der attribute
35  * s: symboltabelle
36  * f: symboltabelle fuer quirks mit structur und parameter
37  * gparamges: anzahl der parameter in einer methode
38  * parms: parametercounter
39  * node: baum fuer iburg
40  * sin: symboltabelle fuer statement ("eingabe")
41  * sout: symboltabelle die aus einem statement wieder rauskommt ("ausgabe")
42  */
43 @autoinh s gparamges vars_in
44 @autosyn node imm call
45
46 @attributes { char *name; } IDENT
47 @attributes { long val; } NUM
48 @attributes { struct symbol *f; int paramges; int parms; } Parms
49 @attributes { struct symbol *f; } Program Structdef;
50 @attributes { struct symbol *f; int offsetcount; } FeldID
51 @attributes { struct symbol *s; } Methoddef
52 @attributes { struct symbol *s; int gparamges; int vars_in; int cnt; int paramcount; struct treenode *node; } Exprs
53 @attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; int vars_in; int vars_out; int call; } Statseq
54 @attributes { struct symbol *s; int gparamges; int lblcnt_in; int lblcnt_out; int reallblcnt; int vars_in; int vars_out; int call; } Elsestat
55 @attributes { struct symbol *s; int gparamges; int vars_in; struct treenode *node; short imm; int call; } Expr Minusterm Multerm Orterm Feld Term
56 @attributes { struct symbol *s; int gparamges; int vars_in; struct treenode *node; } Lexpr
57 @attributes { struct symbol *sin; int gparamges; struct symbol *sout; struct treenode *node; int vars_in; int vars_out; int lblcnt_in; int lblcnt_out; int call; } Statement
58
59 @traversal @postorder c
60 @traversal @preorder reg
61 @traversal @preorder gen
62
63 %%
64 Input:
65           Program
66           @{
67             @i @Program.f@ = tab_new();
68             @gen printf("\t.section\t\".text\"\n");
69           @}
70         ;
71
72 Program:
73           Methoddef ';' Program
74           @{
75             @i @Methoddef.s@ = @Program.0.f@;
76             @i @Program.1.f@ = @Program.0.f@;
77           @}
78
79         | Structdef ';' Program
80           @{
81             @i @Program.1.f@ = tab_merge(@Program.0.f@, @Structdef.f@, 1);
82           @}
83         |
84         ;
85
86 Methoddef:
87           METHOD IDENT '(' Parms ')' Statseq END
88           @{
89             @i @Parms.parms@ = 1;
90             @i @Statseq.s@ = tab_merge(@Methoddef.s@, @Parms.f@, 0);
91                 @i @Statseq.vars_in@ = 0;
92                 @i @Statseq.gparamges@ = @Parms.paramges@;
93                 @i @Statseq.lblcnt_in@ = 0;
94             @gen func_header(@IDENT.name@, @Statseq.vars_out@, @Parms.paramges@, @Statseq.call@);
95           @}
96         ;
97
98 Structdef:
99           STRUCT FeldID END
100           @{
101             @i @Structdef.f@ = @FeldID.f@;
102                 @i @FeldID.offsetcount@ = 0;
103           @}
104         ;
105
106 Parms:
107           /* lokale Vars werden in Statement in die tabelle eingefuegt */
108           IDENT Parms
109           @{
110             @i @Parms.1.parms@ = @Parms.0.parms@ + 1;
111                 @i @Parms.0.paramges@ = @Parms.1.paramges@;
112             @i @Parms.0.f@ = tab_add_symbol(@Parms.1.f@, @IDENT.name@, S_PARM, 1, @Parms.parms@, -1);
113           @}
114
115         |
116           @{
117             @i @Parms.f@ = tab_new();
118                 @i @Parms.paramges@ = @Parms.parms@;
119           @}
120         ;
121
122 FeldID:
123           IDENT FeldID
124           @{
125             @i @FeldID.1.offsetcount@ = @FeldID.0.offsetcount@ + 1;
126             @i @FeldID.0.f@ = tab_add_symbol(@FeldID.1.f@, @IDENT.name@, S_FIELD, 1, -1, @FeldID.0.offsetcount@);
127           @}
128
129         |
130           @{
131             @i @FeldID.f@ = tab_new();
132           @}
133         ;
134
135 Statseq:
136           Statement ';' Statseq
137           @{
138                 @i @Statement.sin@ = @Statseq.0.s@;
139                 @i @Statement.lblcnt_in@ = @Statseq.0.lblcnt_in@;
140
141                 @i @Statseq.1.s@ = @Statement.sout@;
142                 @i @Statseq.1.lblcnt_in@ = @Statement.lblcnt_out@;
143                 @i @Statseq.1.gparamges@ = @Statseq.0.gparamges@;
144
145                 @i @Statement.vars_in@ = @Statseq.0.vars_in@;
146                 @i @Statseq.1.vars_in@ = @Statement.vars_out@;
147
148                 @i @Statseq.0.lblcnt_out@ = @Statseq.1.lblcnt_out@;
149                 @i @Statseq.0.vars_out@ = @Statseq.1.vars_out@;
150
151                 @i @Statseq.0.call@ = @Statement.call@ || @Statseq.1.call@;
152           @}
153
154         |
155           @{
156                 @i @Statseq.0.lblcnt_out@ = @Statseq.0.lblcnt_in@;
157                 @i @Statseq.0.vars_out@ = @Statseq.0.vars_in@;
158                 @i @Statseq.0.call@ = 0;
159           @}
160         ;
161
162 Statement:
163           Lexpr ASSIGN Expr
164           @{
165                 statinout()
166                 lblcountinout()
167                 varsinout()
168                 xxputsin(@Lexpr.s@,)
169                 xxputsin(@Expr.s@,)
170             @i @Statement.node@ = new_node(O_ASSIGN, @Expr.node@, @Lexpr.node@);
171                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
172                 @reg @Lexpr.node@->reg = next_reg(@Expr.node@->reg, @Expr.gparamges@);
173
174                 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
175           @}
176
177         | VAR IDENT ASSIGN Expr
178           @{
179                 /* tab_clone ist hier noetig, vgl. folgendes statement
180                  * > var x := x - 1; */
181                 @i @Statement.sout@ = tab_add_symbol(tab_clone(@Statement.sin@), @IDENT.name@, S_VAR, 1, VARBEGIN - @Statement.vars_in@, -1);
182                 lblcountinout()
183
184                 @i @Statement.vars_out@ = @Statement.vars_in@ + 1;
185
186                 xxputsin(@Expr.s@,)
187
188                 @i @Statement.node@ = new_node(O_ASSIGN, @Expr.node@, new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, VARBEGIN - @Statement.vars_in@));
189                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
190
191                 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
192           @}
193
194         | Expr
195           @{
196                 statinout()
197                 varsinout()
198                 lblcountinout()
199                 xxputsin(@Expr.s@,)
200                 @i @Statement.node@ = new_node(O_EXPR, @Expr.node@, TREENULL);
201                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
202
203                 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
204           @}
205
206         | IF Expr THEN Statseq END
207           @{
208                 statinout()
209                 @i @Statseq.lblcnt_in@ =  @Statement.lblcnt_in@ + 1;
210                 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
211
212                 @i @Statseq.vars_in@ = @Statement.vars_in@;
213                 @i @Statement.vars_out@ = @Statseq.vars_out@;
214
215                 @i @Statement.call@ = @Expr.call@ || @Statseq.call@;
216
217                 xxputsin(@Expr.s@,)
218                 xxputsin(@Statseq.s@,)
219
220                 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
221
222                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
223                 @gen {
224                         printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
225                         write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
226                         printf("\tbeq 0,.%s_ifend_%d\n", get_func_name(), @Statement.lblcnt_in@);
227                 }
228                 @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
229           @}
230
231         | IF Expr THEN Statseq Elsestat END
232           @{
233                 statinout()
234                 @i @Statseq.0.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
235                 @i @Elsestat.lblcnt_in@ = @Statseq.lblcnt_out@;
236                 @i @Statement.lblcnt_out@ = @Elsestat.lblcnt_out@;
237
238                 /* im Elsestat muss noch ein label numeriert werden */
239                 @i @Elsestat.reallblcnt@ = @Statement.lblcnt_in@;
240
241                 @i @Statseq.vars_in@ = @Statement.vars_in@;
242                 @i @Elsestat.vars_in@ = @Statement.vars_in@;
243                 @i @Statement.vars_out@ = MAX(@Statseq.vars_out@, @Elsestat.vars_out@);
244
245                 @i @Statement.call@ = @Expr.call@ || @Statseq.call@ || @Elsestat.call@;
246
247                 xxputsin(@Expr.s@,)
248                 xxputsin(@Statseq.0.s@,)
249                 xxputsin(@Elsestat.s@,)
250
251                 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
252
253                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
254                 @gen {
255                         printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
256                         write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
257                         /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
258                         printf("\tbeq 0,.%s_ifelse_%d\n", get_func_name(), @Statement.lblcnt_in@);
259                 }
260                 @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
261           @}
262
263         | WHILE Expr DO Statseq END
264           @{
265                 statinout()
266                 @i @Statseq.lblcnt_in@ =  @Statement.lblcnt_in@ + 1;
267                 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
268
269                 @i @Statseq.vars_in@ = @Statement.vars_in@;
270                 @i @Statement.vars_out@ = @Statseq.vars_out@;
271
272                 @i @Statement.call@ = @Expr.call@ || @Statseq.call@;
273
274                 xxputsin(@Expr.s@,)
275                 xxputsin(@Statseq.s@,)
276
277                 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
278
279                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
280                 @gen {
281                         printf(".%s_whilestart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
282                         write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
283                         /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
284                         printf("\tbeq 0,.%s_whileend_%d\n", get_func_name(), @Statement.lblcnt_in@);
285                 }
286                 @gen @revorder(1) printf("\tb .%s_whilestart_%d\n.%s_whileend_%d:\n", get_func_name(), @Statement.lblcnt_in@, get_func_name(), @Statement.lblcnt_in@);
287           @}
288
289         | RETURN Expr
290           @{
291                 statinout()
292                 lblcountinout()
293                 varsinout()
294                 xxputsin(@Expr.s@,)
295
296                 @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
297                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
298
299                 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1); func_footer();
300           @}
301         ;
302
303 Elsestat:
304           ELSE Statseq
305           @{
306                 @i @Statseq.lblcnt_in@ =  @Elsestat.lblcnt_in@;
307                 @i @Elsestat.lblcnt_out@ =  @Statseq.lblcnt_out@;
308
309                 @i @Statseq.vars_in@ = @Elsestat.vars_in@;
310                 @i @Elsestat.vars_out@ = @Statseq.vars_out@;
311
312                 @gen printf("\tb .%s_ifend_%d\n.%s_ifelse_%d:\n", get_func_name(), @Elsestat.reallblcnt@, get_func_name(), @Elsestat.reallblcnt@);
313           @}
314
315 Lexpr:
316           IDENT
317           @{
318             @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
319
320                 /* TODO: selbe Code wie bei Term/IDENT -- schoener machen! */
321             @i {
322                         @Lexpr.node@ = TREENULL;
323                         if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
324                                 /* es handelt sich um ein feldzugriff auf this */
325                                 @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);
326                         } else { /* param oder var */
327                                 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;
328                                 @Lexpr.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
329                         }
330                 }
331
332                 @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
333                         /* TODO: kein schoener hack? */
334                         @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
335                 }
336           @}
337
338         | Feld
339         ;
340
341 Feld: Term '.' IDENT
342           @{
343             @c check(@Feld.s@, @IDENT.name@, S_FIELD);
344             @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);
345
346                 @reg @Term.node@->reg = next_reg(@Feld.node@->reg, @Term.gparamges@);
347           @}
348         ;
349
350 Expr:
351           Term
352           @{
353             @reg @Term.node@->reg = @Expr.node@->reg;
354           @}
355
356         | NOT Term
357           @{
358                 @i @Expr.node@ = new_node(O_BOOL, new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL)), TREENULL);
359
360                 @reg @Term.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
361           @}
362
363         | Term Minusterm
364           @{
365             @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
366                 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
367                 @i @Expr.call@ = @Term.call@ || @Minusterm.call@;
368
369                 @reg {
370                         if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
371                                 @Term.node@->reg = @Expr.node@->reg;
372                                 if(@Minusterm.imm@) {
373                                         @Minusterm.node@->reg = @Expr.node@->reg;
374                                 } else {
375                                         @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
376                                 }
377                         }
378                 }
379           @}
380
381         | Term Multerm
382           @{
383             @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
384                 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
385                 @i @Expr.call@ = @Term.call@ || @Multerm.call@;
386
387                 @reg {
388                         @Term.node@->reg = @Expr.node@->reg;
389                         if(@Term.imm@) {
390                                 @Multerm.node@->reg = @Expr.node@->reg;
391                         } else {
392                                 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
393                         }
394                 }
395           @}
396
397         | Term Orterm
398           @{
399             @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
400                 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
401                 @i @Expr.call@ = @Term.call@ || @Orterm.call@;
402
403                 @reg {
404                         @Term.node@->reg = @Expr.node@->reg;
405                         @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
406                 }
407           @}
408
409         | Term '<' Term
410           @{
411             @i @Expr.node@ = new_node(O_BOOL, new_node(O_LESS, @Term.0.node@, @Term.1.node@), TREENULL);
412                 @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
413                 @i @Expr.call@ = @Term.0.call@ || @Term.1.call@;
414
415                 @reg {
416                         @Term.0.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
417                         @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
418                 }
419           @}
420
421         | Term '=' Term
422           @{
423             @i @Expr.node@ = new_node(O_BOOL, new_node(O_EQ, @Term.0.node@, @Term.1.node@), TREENULL);
424                 @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
425                 @i @Expr.call@ = @Term.0.call@ || @Term.1.call@;
426
427                 @reg {
428                         @Term.0.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
429                         @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
430                 }
431           @}
432         ;
433
434 Minusterm:
435           '-' Term Minusterm
436           @{
437             @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
438                 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
439                 @i @Minusterm.0.call@ = @Term.call@ || @Minusterm.1.call@;
440
441             @reg {
442                         @Minusterm.1.node@->reg = @Minusterm.node@->reg;
443                         if(@Minusterm.1.imm@) {
444                                 @Term.node@->reg = @Minusterm.node@->reg;
445                         } else {
446                                 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
447                         }
448                 }
449           @}
450
451         | '-' Term
452           @{
453             @reg @Term.node@->reg = @Minusterm.node@->reg;
454           @}
455         ;
456
457 Multerm:
458           '*' Term Multerm
459           @{
460             @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
461                 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
462                 @i @Multerm.0.call@ = @Term.call@ || @Multerm.1.call@;
463
464             @reg {
465                         @Multerm.1.node@->reg = @Multerm.node@->reg;
466                         if(@Multerm.1.imm@) {
467                                 @Term.node@->reg = @Multerm.node@->reg;
468                         } else {
469                                 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
470                         }
471                 }
472           @}
473
474         | '*' Term
475           @{
476             @reg @Term.node@->reg = @Multerm.node@->reg;
477           @}
478         ;
479
480 Orterm:
481           OR Term Orterm
482           @{
483             @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
484                 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
485                 @i @Orterm.0.call@ = @Term.call@ || @Orterm.1.call@;
486
487             @reg {
488                         @Orterm.1.node@->reg = @Orterm.node@->reg;
489                         if(@Orterm.1.imm@) {
490                                 @Term.node@->reg = @Orterm.node@->reg;
491                         } else {
492                                 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
493                         }
494                 }
495           @}
496         | OR Term
497           @{
498             @reg @Term.node@->reg = @Orterm.node@->reg;
499           @}
500
501         ;
502
503 Term:
504           '(' Expr ')'
505           @{
506             @i @Term.node@ = @Expr.node@;
507           @}
508
509         | NUM
510           @{
511             @i @Term.node@ = new_number(@NUM.val@);
512                 @i @Term.imm@ = 1;
513                 @i @Term.call@ = 0;
514           @}
515
516         | '-' NUM
517           @{
518             @i @Term.node@ = new_number(-1 * (@NUM.val@));
519                 @i @Term.imm@ = 1;
520                 @i @Term.call@ = 0;
521           @}
522
523         | THIS
524           @{
525             @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
526                 @i @Term.imm@ = 0;
527                 @i @Term.call@ = 0;
528           @}
529
530         | IDENT
531           @{
532             @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
533
534                 @i @Term.imm@ = 0;
535                 @i @Term.call@ = 0;
536             @i {
537                         @Term.node@ = TREENULL;
538                         if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
539                                 /* es handelt sich um ein feldzugriff auf this */
540                                 @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);
541                         } else { /* param oder var */
542                                 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;
543                                 @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
544                         }
545                 }
546
547                 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
548                         /* TODO: kein schoener hack? */
549                         @Term.node@->kids[0]->reg = @Term.node@->reg;
550                 }
551           @}
552
553         | Feld
554           @{
555             @i @Term.node@ = @Feld.node@;
556                 @i @Term.imm@ = 0;
557           @}
558
559         | IDENT '(' Exprs ')'
560           @{
561             @i {
562                         @Term.node@ = new_call(@IDENT.name@, new_arg(@Exprs.node@, new_nothing(), 0) /*this*/,
563                                         TREENULL, @Term.gparamges@, @Term.vars_in@);
564                         @Term.node@->soffset = MAX(@Exprs.paramcount@, @Term.gparamges@);
565                 }
566                 @i @Exprs.cnt@ = 1;
567                 @i @Term.imm@ = 0;
568                 @i @Term.call@ = 1;
569                 @reg @Exprs.node@->reg = @Term.node@->reg;
570           @}
571
572         | Term '.' IDENT '(' Exprs ')'
573           @{
574             @i {
575                         @Term.node@ = new_call(@IDENT.name@, new_arg(@Exprs.node@, @Term.1.node@, 0) /*this*/,
576                                         TREENULL, @Term.gparamges@, @Term.vars_in@);
577                         @Term.node@->soffset = MAX(@Exprs.paramcount@, @Term.gparamges@);
578                 }
579                 @i @Exprs.cnt@ = 1;
580                 @i @Term.imm@ = 0;
581                 @i @Term.call@ = 1;
582                 @reg @Exprs.node@->reg = @Term.1.node@->reg = @Term.node@->kids[0]->reg = @Term.node@->reg;
583           @}
584
585         ;
586
587 Exprs:
588           Expr ',' Exprs
589           @{
590                 @i @Exprs.0.node@ = new_arg(@Expr.0.node@, @Exprs.1.node@, @Exprs.0.cnt@);
591                 @i @Exprs.0.paramcount@ = @Exprs.1.paramcount@;
592                 @i @Exprs.1.cnt@ = @Exprs.0.cnt@ + 1;
593                 @reg @Expr.node@->reg = @Exprs.0.node@->reg; @Exprs.1.node@->reg = next_reg(@Exprs.0.node@->reg, @Exprs.gparamges@);
594           @}
595         | Expr
596           @{
597                 @i @Exprs.0.node@ = new_arg(@Expr.0.node@, new_nothing(), @Exprs.cnt@);
598                 @i @Exprs.paramcount@ = @Exprs.cnt@ + 1;
599                 @reg @Expr.node@->reg = @Exprs.0.node@->reg;
600           @}
601         |
602           @{
603                 @i @Exprs.0.node@ = new_nothing();
604                 @i @Exprs.paramcount@ = @Exprs.cnt@;
605           @}
606         ;
607 %%
608
609 extern int yylex();
610 extern int yylineno;
611
612 int yyerror(char *error_text)
613 {
614         fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
615         exit(2);
616 }
617
618 int main(int argc, char **argv)
619 {
620         #if 0
621         yydebug=1;
622         #endif
623         yyparse();
624         return 0;
625 }
626