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