gesamt: leerstehende Expr's auswerten (weil da Methodenaufrufe drin sein koennten)
[uebersetzerbau-ss10.git] / gesamt / 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.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, 6 - @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, 6 - @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                         /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
227                         printf("\tjz .%s_ifend_%d\n", get_func_name(), @Statement.lblcnt_in@);
228                 }
229                 @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
230           @}
231
232         | IF Expr THEN Statseq Elsestat END
233           @{
234                 statinout()
235                 @i @Statseq.0.lblcnt_in@ = @Statement.lblcnt_in@ + 1;
236                 @i @Elsestat.lblcnt_in@ = @Statseq.lblcnt_out@;
237                 @i @Statement.lblcnt_out@ = @Elsestat.lblcnt_out@;
238
239                 /* im Elsestat muss noch ein label numeriert werden */
240                 @i @Elsestat.reallblcnt@ = @Statement.lblcnt_in@;
241
242                 @i @Statseq.vars_in@ = @Statement.vars_in@;
243                 @i @Elsestat.vars_in@ = @Statement.vars_in@;
244                 @i @Statement.vars_out@ = MAX(@Statseq.vars_out@, @Elsestat.vars_out@);
245
246                 @i @Statement.call@ = @Expr.call@ || @Statseq.call@ || @Elsestat.call@;
247
248                 xxputsin(@Expr.s@,)
249                 xxputsin(@Statseq.0.s@,)
250                 xxputsin(@Elsestat.s@,)
251
252                 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
253
254                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
255                 @gen {
256                         printf(".%s_ifstart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
257                         write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
258                         /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
259                         printf("\tjz .%s_ifelse_%d\n", get_func_name(), @Statement.lblcnt_in@);
260                 }
261                 @gen @revorder(1) printf(".%s_ifend_%d:\n", get_func_name(), @Statement.lblcnt_in@);
262           @}
263
264         | WHILE Expr DO Statseq END
265           @{
266                 statinout()
267                 @i @Statseq.lblcnt_in@ =  @Statement.lblcnt_in@ + 1;
268                 @i @Statement.lblcnt_out@ = @Statseq.lblcnt_out@;
269
270                 @i @Statseq.vars_in@ = @Statement.vars_in@;
271                 @i @Statement.vars_out@ = @Statseq.vars_out@;
272
273                 @i @Statement.call@ = @Expr.call@ || @Statseq.call@;
274
275                 xxputsin(@Expr.s@,)
276                 xxputsin(@Statseq.s@,)
277
278                 @i @Statement.node@ = new_node(O_IF, @Expr.node@, TREENULL);
279
280                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
281                 @gen {
282                         printf(".%s_whilestart_%d:\n", get_func_name(), @Statement.lblcnt_in@);
283                         write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1);
284                         /* TODO: kann ich mir das test wirklich wegan and davor sparen? */
285                         printf("\tjz .%s_whileend_%d\n", get_func_name(), @Statement.lblcnt_in@);
286                 }
287                 @gen @revorder(1) printf("\tjmp .%s_whilestart_%d\n.%s_whileend_%d:\n", get_func_name(), @Statement.lblcnt_in@, get_func_name(), @Statement.lblcnt_in@);
288           @}
289
290         | RETURN Expr
291           @{
292                 statinout()
293                 lblcountinout()
294                 varsinout()
295                 xxputsin(@Expr.s@,)
296
297                 @i @Statement.node@ = new_node(O_RET, @Expr.node@, TREENULL);
298                 @reg @Statement.node@->reg = @Expr.node@->reg = next_reg((char *)NULL, @Expr.gparamges@);
299
300                 @gen write_tree(@Statement.node@, 0); burm_label(@Statement.node@); burm_reduce(@Statement.node@, 1); func_footer();
301           @}
302         ;
303
304 Elsestat:
305           ELSE Statseq
306           @{
307                 @i @Statseq.lblcnt_in@ =  @Elsestat.lblcnt_in@;
308                 @i @Elsestat.lblcnt_out@ =  @Statseq.lblcnt_out@;
309
310                 @i @Statseq.vars_in@ = @Elsestat.vars_in@;
311                 @i @Elsestat.vars_out@ = @Statseq.vars_out@;
312
313                 @gen printf("\tjmp .%s_ifend_%d\n.%s_ifelse_%d:\n", get_func_name(), @Elsestat.reallblcnt@, get_func_name(), @Elsestat.reallblcnt@);
314           @}
315
316 Lexpr:
317           IDENT
318           @{
319             @c check(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM);
320
321                 /* TODO: selbe Code wie bei Term/IDENT -- schoener machen! */
322             @i {
323                         @Lexpr.node@ = TREENULL;
324                         if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
325                                 /* es handelt sich um ein feldzugriff auf this */
326                                 @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);
327                         } else { /* param oder var */
328                                 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;
329                                 @Lexpr.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
330                         }
331                 }
332
333                 @reg if(tab_lookup(@Lexpr.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
334                         /* TODO: kein schoener hack? */
335                         @Lexpr.node@->kids[0]->reg = @Lexpr.node@->reg;
336                 }
337           @}
338
339         | Feld
340         ;
341
342 Feld: Term '.' IDENT
343           @{
344             @c check(@Feld.s@, @IDENT.name@, S_FIELD);
345             @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);
346
347                 @reg @Term.node@->reg = next_reg(@Feld.node@->reg, @Term.gparamges@);
348           @}
349         ;
350
351 Expr:
352           Term
353           @{
354             @reg @Term.node@->reg = @Expr.node@->reg;
355           @}
356
357         | NOT Term
358           @{
359                 @i @Expr.node@ = new_node(O_BOOL, new_node(O_EQ, @Term.node@, new_node(O_NULL, TREENULL, TREENULL)), TREENULL);
360
361                 @reg @Term.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
362           @}
363
364         | Term Minusterm
365           @{
366             @i @Expr.node@ = new_node(O_SUB, @Term.node@, @Minusterm.node@);
367                 @i @Expr.imm@ = @Term.imm@ && @Minusterm.imm@;
368                 @i @Expr.call@ = @Term.call@ || @Minusterm.call@;
369
370                 @reg {
371                         if(!(@Expr.node@->kids[0] == TREENULL && @Expr.node@->kids[1] == TREENULL)) {
372                                 @Term.node@->reg = @Expr.node@->reg;
373                                 if(@Minusterm.imm@) {
374                                         @Minusterm.node@->reg = @Expr.node@->reg;
375                                 } else {
376                                         @Minusterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
377                                 }
378                         }
379                 }
380           @}
381
382         | Term Multerm
383           @{
384             @i @Expr.node@ = new_node(O_MUL, @Term.node@, @Multerm.node@);
385                 @i @Expr.imm@ = @Term.imm@ && @Multerm.imm@;
386                 @i @Expr.call@ = @Term.call@ || @Multerm.call@;
387
388                 @reg {
389                         @Term.node@->reg = @Expr.node@->reg;
390                         if(@Term.imm@) {
391                                 @Multerm.node@->reg = @Expr.node@->reg;
392                         } else {
393                                 @Multerm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
394                         }
395                 }
396           @}
397
398         | Term Orterm
399           @{
400             @i @Expr.node@ = new_node(O_OR, @Term.node@, @Orterm.node@);
401                 @i @Expr.imm@ = @Term.imm@ && @Orterm.imm@;
402                 @i @Expr.call@ = @Term.call@ || @Orterm.call@;
403
404                 @reg {
405                         @Term.node@->reg = @Expr.node@->reg;
406                         @Orterm.node@->reg = next_reg(@Term.node@->reg, @Expr.gparamges@);
407                 }
408           @}
409
410         | Term '<' Term
411           @{
412             @i @Expr.node@ = new_node(O_BOOL, new_node(O_LESS, @Term.0.node@, @Term.1.node@), TREENULL);
413                 @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
414                 @i @Expr.call@ = @Term.0.call@ || @Term.1.call@;
415
416                 @reg {
417                         @Term.0.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
418                         @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
419                 }
420           @}
421
422         | Term '=' Term
423           @{
424             @i @Expr.node@ = new_node(O_BOOL, new_node(O_EQ, @Term.0.node@, @Term.1.node@), TREENULL);
425                 @i @Expr.imm@ = @Term.0.imm@ && @Term.1.imm@;
426                 @i @Expr.call@ = @Term.0.call@ || @Term.1.call@;
427
428                 @reg {
429                         @Term.0.node@->reg = @Expr.node@->kids[0]->reg = @Expr.node@->reg;
430                         @Term.1.node@->reg = next_reg(@Term.0.node@->reg, @Expr.gparamges@);
431                 }
432           @}
433         ;
434
435 Minusterm:
436           '-' Term Minusterm
437           @{
438             @i @Minusterm.node@ = new_node(O_ADD, @Minusterm.1.node@, @Term.node@);
439                 @i @Minusterm.0.imm@ = @Term.imm@ && @Minusterm.1.imm@;
440                 @i @Minusterm.0.call@ = @Term.call@ || @Minusterm.1.call@;
441
442             @reg {
443                         @Minusterm.1.node@->reg = @Minusterm.node@->reg;
444                         if(@Minusterm.1.imm@) {
445                                 @Term.node@->reg = @Minusterm.node@->reg;
446                         } else {
447                                 @Term.node@->reg = next_reg(@Minusterm.1.node@->reg, @Minusterm.gparamges@);
448                         }
449                 }
450           @}
451
452         | '-' Term
453           @{
454             @reg @Term.node@->reg = @Minusterm.node@->reg;
455           @}
456         ;
457
458 Multerm:
459           '*' Term Multerm
460           @{
461             @i @Multerm.node@ = new_node(O_MUL, @Multerm.1.node@, @Term.node@);
462                 @i @Multerm.0.imm@ = @Term.imm@ && @Multerm.1.imm@;
463                 @i @Multerm.0.call@ = @Term.call@ || @Multerm.1.call@;
464
465             @reg {
466                         @Multerm.1.node@->reg = @Multerm.node@->reg;
467                         if(@Multerm.1.imm@) {
468                                 @Term.node@->reg = @Multerm.node@->reg;
469                         } else {
470                                 @Term.node@->reg = next_reg(@Multerm.1.node@->reg, @Multerm.gparamges@);
471                         }
472                 }
473           @}
474
475         | '*' Term
476           @{
477             @reg @Term.node@->reg = @Multerm.node@->reg;
478           @}
479         ;
480
481 Orterm:
482           OR Term Orterm
483           @{
484             @i @Orterm.node@ = new_node(O_OR, @Orterm.1.node@, @Term.node@);
485                 @i @Orterm.0.imm@ = @Term.imm@ && @Orterm.1.imm@;
486                 @i @Orterm.0.call@ = @Term.call@ || @Orterm.1.call@;
487
488             @reg {
489                         @Orterm.1.node@->reg = @Orterm.node@->reg;
490                         if(@Orterm.1.imm@) {
491                                 @Term.node@->reg = @Orterm.node@->reg;
492                         } else {
493                                 @Term.node@->reg = next_reg(@Orterm.1.node@->reg, @Orterm.gparamges@);
494                         }
495                 }
496           @}
497         | OR Term
498           @{
499             @reg @Term.node@->reg = @Orterm.node@->reg;
500           @}
501
502         ;
503
504 Term:
505           '(' Expr ')'
506           @{
507             @i @Term.node@ = @Expr.node@;
508           @}
509
510         | NUM
511           @{
512             @i @Term.node@ = new_number(@NUM.val@);
513                 @i @Term.imm@ = 1;
514                 @i @Term.call@ = 0;
515           @}
516
517         | '-' NUM
518           @{
519             @i @Term.node@ = new_number(-1 * (@NUM.val@));
520                 @i @Term.imm@ = 1;
521                 @i @Term.call@ = 0;
522           @}
523
524         | THIS
525           @{
526             @i @Term.node@ = new_param(O_ID, strdup("this"), TREENULL, TREENULL, 0);
527                 @i @Term.imm@ = 0;
528                 @i @Term.call@ = 0;
529           @}
530
531         | IDENT
532           @{
533             @c check(@Term.s@, @IDENT.name@, S_VAR|S_PARM);
534
535                 @i @Term.imm@ = 0;
536                 @i @Term.call@ = 0;
537             @i {
538                         @Term.node@ = TREENULL;
539                         if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
540                                 /* es handelt sich um ein feldzugriff auf this */
541                                 @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);
542                         } else { /* param oder var */
543                                 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;
544                                 @Term.node@ = new_param(O_ID, @IDENT.name@, TREENULL, TREENULL, tmp);
545                         }
546                 }
547
548                 @reg if(tab_lookup(@Term.s@, @IDENT.name@, S_VAR|S_PARM) == SYMNULL) {
549                         /* TODO: kein schoener hack? */
550                         @Term.node@->kids[0]->reg = @Term.node@->reg;
551                 }
552           @}
553
554         | Feld
555           @{
556             @i @Term.node@ = @Feld.node@;
557                 @i @Term.imm@ = 0;
558           @}
559
560         | IDENT '(' Exprs ')'
561           @{
562             @i {
563                         @Term.node@ = new_call(@IDENT.name@, new_arg(@Exprs.node@, new_nothing(), 0) /*this*/,
564                                         TREENULL, @Term.gparamges@, @Term.vars_in@);
565                         @Term.node@->soffset = @Exprs.paramcount@;
566                 }
567                 @i @Exprs.cnt@ = 1;
568                 @i @Term.imm@ = 0;
569                 @i @Term.call@ = 1;
570                 @reg @Exprs.node@->reg = @Term.node@->reg;
571           @}
572
573         | Term '.' IDENT '(' Exprs ')'
574           @{
575             @i {
576                         @Term.node@ = new_call(@IDENT.name@, new_arg(@Exprs.node@, @Term.1.node@, 0) /*this*/,
577                                         TREENULL, @Term.gparamges@, @Term.vars_in@);
578                         @Term.node@->soffset = @Exprs.paramcount@;
579                 }
580                 @i @Exprs.cnt@ = 1;
581                 @i @Term.imm@ = 0;
582                 @i @Term.call@ = 1;
583                 @reg @Exprs.node@->reg = @Term.1.node@->reg = @Term.node@->kids[0]->reg = @Term.node@->reg;
584           @}
585
586         ;
587
588 Exprs:
589           Expr ',' Exprs
590           @{
591                 @i @Exprs.0.node@ = new_arg(@Expr.0.node@, @Exprs.1.node@, @Exprs.0.cnt@);
592                 @i @Exprs.0.paramcount@ = @Exprs.1.paramcount@;
593                 @i @Exprs.1.cnt@ = @Exprs.0.cnt@ + 1;
594                 @reg @Expr.node@->reg = @Exprs.0.node@->reg; @Exprs.1.node@->reg = next_reg(@Exprs.0.node@->reg, @Exprs.gparamges@);
595           @}
596         | Expr
597           @{
598                 @i @Exprs.0.node@ = new_arg(@Expr.0.node@, new_nothing(), @Exprs.cnt@);
599                 @i @Exprs.paramcount@ = @Exprs.cnt@ + 1;
600                 @reg @Expr.node@->reg = @Exprs.0.node@->reg;
601           @}
602         |
603           @{
604                 @i @Exprs.0.node@ = new_nothing();
605                 @i @Exprs.paramcount@ = @Exprs.cnt@;
606           @}
607         ;
608 %%
609
610 extern int yylex();
611 extern int yylineno;
612
613 int yyerror(char *error_text)
614 {
615         fprintf(stderr,"Zeile %i: %s\n", yylineno, error_text);
616         exit(2);
617 }
618
619 int main(int argc, char **argv)
620 {
621         #if 0
622         yydebug=1;
623         #endif
624         yyparse();
625         return 0;
626 }
627