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