* Get the next token. */
| 459 | * Get the next token. |
| 460 | */ |
| 461 | int Parser::getToken() |
| 462 | { |
| 463 | prev = pos; |
| 464 | if (peek != TOKEN_ERROR) |
| 465 | { |
| 466 | int t = peek; |
| 467 | peek = TOKEN_ERROR; |
| 468 | return t; |
| 469 | } |
| 470 | char c = buf[pos]; |
| 471 | while (isspace(c)) |
| 472 | c = buf[++pos]; |
| 473 | |
| 474 | // Operators: |
| 475 | switch (c) |
| 476 | { |
| 477 | case '\0': |
| 478 | strcpy(s, "<end-of-input>"); |
| 479 | return TOKEN_EOF; |
| 480 | case '[': case ']': case '@': case ',': case '(': case ')': |
| 481 | case '&': case '.': case ':': case '+': case '{': case '}': |
| 482 | case '*': case '|': case '~': case '^': |
| 483 | s[0] = c; s[1] = '\0'; |
| 484 | pos++; |
| 485 | switch (c) |
| 486 | { |
| 487 | case '&': case '|': case '.': |
| 488 | if (buf[pos] == c) |
| 489 | { |
| 490 | s[1] = c; s[2] = '\0'; |
| 491 | pos++; |
| 492 | } |
| 493 | break; |
| 494 | default: |
| 495 | break; |
| 496 | } |
| 497 | return getTokenFromName(s); |
| 498 | case '!': case '<': case '>': case '=': |
| 499 | s[0] = c; s[1] = '\0'; |
| 500 | pos++; |
| 501 | if (buf[pos] == '=') |
| 502 | { |
| 503 | s[1] = '='; s[2] = '\0'; |
| 504 | pos++; |
| 505 | } |
| 506 | else if ((c == '<' || c == '>') && buf[pos] == c) |
| 507 | { |
| 508 | s[1] = c; s[2] = '\0'; |
| 509 | pos++; |
| 510 | } |
| 511 | return getTokenFromName(s); |
| 512 | case '-': |
| 513 | s[0] = c; s[1] = '\0'; |
| 514 | pos++; |
| 515 | if (buf[pos] == '-' || buf[pos] == 'w') |
| 516 | { |
| 517 | s[1] = buf[pos]; s[2] = '\0'; |
| 518 | pos++; |
no test coverage detected