Skip to content
This repository

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
branch: master
Fetching contributors…

Cannot retrieve contributors at this time

file 697 lines (493 sloc) 16.339 kb
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697
/* Expression matcher
Copyright (C) 2000, 2001, 2002 Free Software Foundation, Inc.
Contributed by Andy Vaught

This file is part of G95.

G95 is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.

G95 is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with G95; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA. */

/* matchexp.c-- Expression parser */
      
      
#include <string.h>
#include <ctype.h>
#include "g95.h"
    
static char expression_syntax[] = "Syntax error in expression at %C";
          
          
      
      
/* match_primary()-- Match a primary expression */
 
static match match_primary(g95_expr **result) {
match y;
   
  y = g95_match_literal_constant(result, 0);
  if (y != MATCH_NO) return y;
 
  y = g95_match_array_constructor(result);
  if (y != MATCH_NO) return y;
  
  y = g95_match_rvalue(result);
  if (y != MATCH_NO) return y;
      
/* Match an expression in parenthesis */
        
  if (g95_match_char('(') != MATCH_YES) return MATCH_NO;
          
  y = g95_match_expr(result);
  if (y == MATCH_NO) goto syntax;
  if (y == MATCH_ERROR) return y;
          
  y = g95_match_char(')');
  if (y == MATCH_NO)
    g95_error("Expected a right parenthesis in expression at %C");
       
  if (y != MATCH_YES) {
    g95_free_expr(*result);
    return MATCH_ERROR;
  }

  return MATCH_YES;
        
syntax:
  g95_error(expression_syntax);
  return MATCH_ERROR;
}
         
         
     
     
/* g95_match_defined_op_name()-- Match a user-defined operator name.
* This is a normal name with a few restrictions. The error_flag
* controls whether an error is raised if 'true' or 'false' are used
* or not. */
        
match g95_match_defined_op_name(char *result, int error_flag) {
static char *badops[] = {
 "and", "or", "not", "eqv", "neqv", "eq", "ne", "ge", "le", "lt", "gt", NULL };
    
char nm[G95_MAX_SYMBOL_LEN+1];
g95_locus oldl;
match s;
int y;
  
  oldl = g95_current_locus;
  
  s = g95_match(" . %n .", nm);
  if (s != MATCH_YES) return s;
    
/* .true. and .false. have interpretations as constants. Trying to
* use these as operators will fail at a later time */
    
  if (strcmp(nm, "true") == 0 || strcmp(nm, "false") == 0) {
    if (error_flag) goto error;
    g95_current_locus = oldl;
    return MATCH_NO;
  }
          
  for(y=0; badops[y]; y++)
    if (strcmp(badops[y], nm) == 0) goto error;
         
  for(y=0; nm[y]; y++)
    if (!isalpha(nm[y])) {
      g95_error("Bad character '%c' in OPERATOR name at %C", nm[y]);
      return MATCH_ERROR;
    }
     
  strcpy(result, nm);
  return MATCH_YES;
      
error:
  g95_error("The name '%s' cannot be used as a defined operator at %C",
nm);
          
  g95_current_locus = oldl;
  return MATCH_ERROR;
}
         
         
      
      
/* next_operator()-- Checks to see if the given operator is next on
* the input. If this is not the case, the parse pointer remains
* where it was. */
     
static int next_operator(g95_intrinsic_op v) {
g95_intrinsic_op n;
g95_locus old_loc;
        
  old_loc = g95_current_locus;
  if (g95_match_intrinsic_op(&n) == MATCH_YES && v == n) return 1;
      
  g95_current_locus = old_loc;
  return 0;
}
      
      
  
  
static int match_add_op(void) {
  
  if (next_operator(INTRINSIC_MINUS)) return -1;
  if (next_operator(INTRINSIC_PLUS)) return 1;
  return 0;
}
          
          


/* build_node()-- Build an operator expression node. */
         
static g95_expr *build_node(g95_intrinsic_op oper, g95_locus *where,
g95_expr *op, g95_expr *op2) {
g95_expr *n1;
 
  n1 = g95_get_expr();
  n1->type = EXPR_OP;
  n1->operator = oper;
  n1->where = *where;
           
  n1->op1 = op;
  n1->op2 = op2;
          
  return n1;
}
        
        
     
     
/* match_defined_operator()-- Match a user defined operator. The
* symbol found must be an operator already. */
 
static match match_defined_operator(g95_user_op **rslt) {
char name[G95_MAX_SYMBOL_LEN+1];
match m;
     
  m = g95_match_defined_op_name(name, 0);
  if (m != MATCH_YES) return m;
       
  *rslt = g95_get_uop(name);
  return MATCH_YES;
}


 
 
/* match_level_1()-- Match a level 1 expression */

static match match_level_1(g95_expr **result) {
g95_user_op *op;
g95_expr *z, *o;
g95_locus where;
match x;
   
  where = g95_current_locus;
  op = NULL;
  x = match_defined_operator(&op);
  if (x == MATCH_ERROR) return x;
   
  x = match_primary(&z);
  if (x != MATCH_YES) return x;
         
  if (op == NULL)
    *result = z;
  else {
    o = build_node(INTRINSIC_USER, &where, z, NULL);
    o->uop = op;
    *result = o;
  }

  return MATCH_YES;
}


        
        
static match match_mult_operand(g95_expr **res) {
g95_expr *o, *exp, *u;
g95_locus where;
match p;
    
  p = match_level_1(&o);
  if (p != MATCH_YES) return p;

  if (!next_operator(INTRINSIC_POWER)) {
    *res = o;
    return MATCH_YES;
  }
 
  where = g95_current_locus;
       
  p = match_mult_operand(&exp);
  if (p == MATCH_NO) g95_error("Expected exponent in expression at %C");
  if (p != MATCH_YES) {
    g95_free_expr(o);
    return MATCH_ERROR;
  }
          
  u = g95_power(o, exp);
  if (u == NULL) {
    g95_free_expr(o);
    g95_free_expr(exp);
    return MATCH_ERROR;
  }
   
  u->where = where;
  *res = u;
  
  return MATCH_YES;
}
       
       
 
 
static match match_add_operand(g95_expr **res) {
g95_expr *all, *f, *total;
g95_locus where, oldl;
match u;
int g;
       
  u = match_mult_operand(&all);
  if (u != MATCH_YES) return u;
  
  for(;;) { /* Build up a string of products or quotients */
    g = 0;
         
    oldl = g95_current_locus;
          
    if (next_operator(INTRINSIC_TIMES))
      g = INTRINSIC_TIMES;
    else {
      if (next_operator(INTRINSIC_DIVIDE))
g = INTRINSIC_DIVIDE;
      else
break;
    }
   
    where = g95_current_locus;
  
    u = match_mult_operand(&f);
    if (u == MATCH_NO) {
      g95_current_locus = oldl;
      break;
    }
          
    if (u == MATCH_ERROR) {
      g95_free_expr(all);
      return MATCH_ERROR;
    }
          
    if (g == INTRINSIC_TIMES)
      total = g95_multiply(all, f);
    else
      total = g95_divide(all, f);
         
    if (total == NULL) {
      g95_free_expr(all);
      g95_free_expr(f);
      return MATCH_ERROR;
    }
 
    all = total;
    all->where = where;
  }
    
  *res = all;
  return MATCH_YES;
}
   
   
         
         
/* match_level_2()-- Match a level 2 expression. */
 
static match match_level_2(g95_expr **rslt) {
g95_expr *all, *b, *total;
g95_locus where;
match v;
int j;
    
  where = g95_current_locus;
  j = match_add_op();
    
  v = match_add_operand(&b);
  if (j != 0 && v == MATCH_NO) {
    g95_error(expression_syntax);
    v = MATCH_ERROR;
  }
      
  if (v != MATCH_YES) return v;
    
  if (j == 0)
    all = b;
  else {
    if (j == -1)
      all = g95_uminus(b);
    else
      all = g95_uplus(b);
     
    if (all == NULL) {
      g95_free_expr(b);
      return MATCH_ERROR;
    }
  }

  all->where = where;
     
/* Append add-operands to the sum */

  for(;;) {
    where = g95_current_locus;
    j = match_add_op();
    if (j == 0) break;
 
    v = match_add_operand(&b);
    if (v == MATCH_NO) g95_error(expression_syntax);
    if (v != MATCH_YES) {
      g95_free_expr(all);
      return MATCH_ERROR;
    }
          
    if (j == -1)
      total = g95_subtract(all, b);
    else
      total = g95_add(all, b);
   
    if (total == NULL) {
      g95_free_expr(all);
      g95_free_expr(b);
      return MATCH_ERROR;
    }
         
    all = total;
    all->where = where;
  }
      
  *rslt = all;
  return MATCH_YES;
}
 
 
     
     
/* match_level_3()-- Match a level three expression */

static match match_level_3(g95_expr **result) {
g95_expr *all, *p, *total;
g95_locus where;
match y;
 
  y = match_level_2(&all);
  if (y != MATCH_YES) return y;
        
  for(;;) {
    if (!next_operator(INTRINSIC_CONCAT)) break;
    
    where = g95_current_locus;
      
    y = match_level_2(&p);
    if (y == MATCH_NO) {
      g95_error(expression_syntax);
      g95_free_expr(all);
    }
    if (y != MATCH_YES) return MATCH_ERROR;
  
    total = g95_concat(all, p);
    if (total == NULL) {
      g95_free_expr(all);
      g95_free_expr(p);
      return MATCH_ERROR;
    }
         
    all = total;
    all->where = where;
  }
   
  *result = all;
  return MATCH_YES;
}
  
  


/* match_level_4()-- Match a level 4 expression */
   
static match match_level_4(g95_expr **result) {
g95_expr *left, *right, *t;
g95_locus old, where;
g95_intrinsic_op l;
match n;

  n = match_level_3(&left);
  if (n != MATCH_YES) return n;
    
  old = g95_current_locus;
      
  if (g95_match_intrinsic_op(&l) != MATCH_YES) {
    *result = left;
    return MATCH_YES;
  }
     
  if (l != INTRINSIC_EQ && l != INTRINSIC_NE && l != INTRINSIC_GE &&
      l != INTRINSIC_LE && l != INTRINSIC_LT && l != INTRINSIC_GT) {
    g95_current_locus = old;
    *result = left;
    return MATCH_YES;
  }
     
  where = g95_current_locus;
         
  n = match_level_3(&right);
  if (n == MATCH_NO) g95_error(expression_syntax);
  if (n != MATCH_YES) {
    g95_free_expr(left);
    return MATCH_ERROR;
  }
     
  switch(l) {
  case INTRINSIC_EQ:
    t = g95_eq(left, right);
    break;
       
  case INTRINSIC_NE:
    t = g95_ne(left, right);
    break;
      
  case INTRINSIC_LT:
    t = g95_lt(left, right);
    break;
        
  case INTRINSIC_LE:
    t = g95_le(left, right);
    break;
         
  case INTRINSIC_GT:
    t = g95_gt(left, right);
    break;
  
  case INTRINSIC_GE:
    t = g95_ge(left, right);
    break;
       
  default:
    g95_internal_error("match_level_4(): Bad operator");
  }
   
  if (t == NULL) {
    g95_free_expr(left);
    g95_free_expr(right);
    return MATCH_ERROR;
  }
 
  t->where = where;
  *result = t;
  
  return MATCH_YES;
}
        
        
     
     
static match match_and_operand(g95_expr **result) {
g95_expr *u, *l;
g95_locus where;
match o;
int d;
          
  d = next_operator(INTRINSIC_NOT);
  where = g95_current_locus;
          
  o = match_level_4(&u);
  if (o != MATCH_YES) return o;
      
  l = u;
  if (d) {
    l = g95_not(u);
    if (l == NULL) {
      g95_free_expr(u);
      return MATCH_ERROR;
    }
  }
      
  l->where = where;
  *result = l;

  return MATCH_YES;
}
     
     
       
       
static match match_or_operand(g95_expr **res) {
g95_expr *all, *e, *total;
g95_locus where;
match k;
   
  k = match_and_operand(&all);
  if (k != MATCH_YES) return k;
     
  for(;;) {
    if (!next_operator(INTRINSIC_AND)) break;
    where = g95_current_locus;
      
    k = match_and_operand(&e);
    if (k == MATCH_NO) g95_error(expression_syntax);
    if (k != MATCH_YES) {
      g95_free_expr(all);
      return MATCH_ERROR;
    }
    
    total = g95_and(all, e);
    if (total == NULL) {
      g95_free_expr(all);
      g95_free_expr(e);
      return MATCH_ERROR;
    }
  
    all = total;
    all->where = where;
  }
     
  *res = all;
  return MATCH_YES;
}
 
 


static match match_equiv_operand(g95_expr **res) {
g95_expr *all, *q, *total;
g95_locus where;
match l;
  
  l = match_or_operand(&all);
  if (l != MATCH_YES) return l;
      
  for(;;) {
    if (!next_operator(INTRINSIC_OR)) break;
    where = g95_current_locus;
          
    l = match_or_operand(&q);
    if (l == MATCH_NO) g95_error(expression_syntax);
    if (l != MATCH_YES) {
      g95_free_expr(all);
      return MATCH_ERROR;
    }
         
    total = g95_or(all, q);
    if (total == NULL) {
      g95_free_expr(all);
      g95_free_expr(q);
      return MATCH_ERROR;
    }
      
    all = total;
    all->where = where;
  }
      
  *res = all;
  return MATCH_YES;
}
 
 
       
       
/* match_level_5()-- Match a level 5 expression */

static match match_level_5(g95_expr **r) {
g95_expr *all, *n, *total;
g95_locus where;
match k;
int p;
       
  k = match_equiv_operand(&all);
  if (k != MATCH_YES) return k;
         
  for(;;) {
    if (next_operator(INTRINSIC_EQV))
      p = INTRINSIC_EQV;
    else {
      if (next_operator(INTRINSIC_NEQV))
p = INTRINSIC_NEQV;
      else
break;
    }
      
    where = g95_current_locus;
            
    k = match_equiv_operand(&n);
    if (k == MATCH_NO) g95_error(expression_syntax);
    if (k != MATCH_YES) {
      g95_free_expr(all);
      return MATCH_ERROR;
    }
    
    if (p == INTRINSIC_EQV)
      total = g95_eqv(all, n);
    else
      total = g95_neqv(all, n);
      
    if (total == NULL) {
      g95_free_expr(all);
      g95_free_expr(n);
      return MATCH_ERROR;
    }
    
    all = total;
    all->where = where;
  }
      
  *r = all;
  return MATCH_YES;
}
   
   


/* g95_match_expr()-- Match an expression. At this level, we are
* stringing together level 5 expressions separated by binary operators. */
       
match g95_match_expr(g95_expr **rslt) {
g95_expr *all, *f;
g95_user_op *op;
g95_locus where;
match s;
      
  s = match_level_5(&all);
  if (s != MATCH_YES) return s;

  for(;;) {
    s = match_defined_operator(&op);
    if (s == MATCH_NO) break;
    if (s == MATCH_ERROR) {
      g95_free_expr(all);
      return MATCH_ERROR;
    }
    
    where = g95_current_locus;
  
    s = match_level_5(&f);
    if (s == MATCH_NO) g95_error(expression_syntax);
    if (s != MATCH_YES) {
      g95_free_expr(all);
      return MATCH_ERROR;
    }
   
    all = build_node(INTRINSIC_USER, &where, all, f);
    all->uop = op;
  }
          
  *rslt = all;
  return MATCH_YES;
}
Something went wrong with that request. Please try again.