codeb/parser.y

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