Mercurial > projects > qtd
annotate generator/parser/parser.cpp @ 414:b2a803c73b89 default tip
Declare tabArray const.
| author | David Nadlinger <code@klickverbot.at> |
|---|---|
| date | Fri, 06 May 2011 13:39:49 +0200 |
| parents | 09a0f1d048f2 |
| children |
| rev | line source |
|---|---|
| 1 | 1 /**************************************************************************** |
| 2 ** | |
|
52
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
3 ** Copyright (C) 1992-2009 Nokia. All rights reserved. |
| 1 | 4 ** Copyright (C) 2002-2005 Roberto Raggi <roberto@kdevelop.org> |
| 5 ** | |
| 6 ** This file is part of Qt Jambi. | |
| 7 ** | |
|
52
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
8 ** Commercial Usage |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
9 Licensees holding valid Qt Commercial licenses may use this file in |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
10 accordance with the Qt Commercial License Agreement provided with the |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
11 Software or, alternatively, in accordance with the terms contained in |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
12 a written agreement between you and Nokia. |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
13 |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
14 GNU Lesser General Public License Usage |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
15 Alternatively, this file may be used under the terms of the GNU Lesser |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
16 General Public License version 2.1 as published by the Free Software |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
17 Foundation and appearing in the file LICENSE.LGPL included in the |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
18 packaging of this file. Please review the following information to |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
19 ensure the GNU Lesser General Public License version 2.1 requirements |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
20 will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html. |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
21 |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
22 In addition, as a special exception, Nokia gives you certain |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
23 additional rights. These rights are described in the Nokia Qt LGPL |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
24 Exception version 1.0, included in the file LGPL_EXCEPTION.txt in this |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
25 package. |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
26 |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
27 GNU General Public License Usage |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
28 Alternatively, this file may be used under the terms of the GNU |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
29 General Public License version 3.0 as published by the Free Software |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
30 Foundation and appearing in the file LICENSE.GPL included in the |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
31 packaging of this file. Please review the following information to |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
32 ensure the GNU General Public License version 3.0 requirements will be |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
33 met: http://www.gnu.org/copyleft/gpl.html. |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
34 |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
35 If you are unsure which license is appropriate for your use, please |
|
09a0f1d048f2
update parser to that from jambi 4.5, attemt to fix building with gcc 4.4
eldar
parents:
1
diff
changeset
|
36 contact the sales department at qt-sales@nokia.com. |
| 1 | 37 |
| 38 ** | |
| 39 ** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE | |
| 40 ** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. | |
| 41 ** | |
| 42 ****************************************************************************/ | |
| 43 | |
| 44 /* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */ | |
| 45 | |
| 46 | |
| 47 // c++ support | |
| 48 #include "parser.h" | |
| 49 #include "tokens.h" | |
| 50 #include "lexer.h" | |
| 51 #include "control.h" | |
| 52 | |
| 53 #include <cstdlib> | |
| 54 #include <iostream> | |
| 55 | |
| 56 #define ADVANCE(tk, descr) \ | |
| 57 { \ | |
| 58 if (token_stream.lookAhead() != tk) { \ | |
| 59 tokenRequiredError(tk); \ | |
| 60 return false; \ | |
| 61 } \ | |
| 62 token_stream.nextToken(); \ | |
| 63 } | |
| 64 | |
| 65 #define ADVANCE_NR(tk, descr) \ | |
| 66 do { \ | |
| 67 if (token_stream.lookAhead() != tk) { \ | |
| 68 tokenRequiredError(tk); \ | |
| 69 } \ | |
| 70 else \ | |
| 71 token_stream.nextToken(); \ | |
| 72 } while (0) | |
| 73 | |
| 74 #define CHECK(tk) \ | |
| 75 do { \ | |
| 76 if (token_stream.lookAhead() != tk) { \ | |
| 77 return false; \ | |
| 78 } \ | |
| 79 token_stream.nextToken(); \ | |
| 80 } while (0) | |
| 81 | |
| 82 #define UPDATE_POS(_node, start, end) \ | |
| 83 do { \ | |
| 84 (_node)->start_token = start; \ | |
| 85 (_node)->end_token = end; \ | |
| 86 } while (0) | |
| 87 | |
| 88 Parser::Parser(Control *c) | |
| 89 : _M_location(token_stream, location_table, line_table), | |
| 90 control(c), | |
| 91 lexer(_M_location, control) | |
| 92 { | |
| 93 _M_block_errors = false; | |
| 94 } | |
| 95 | |
| 96 Parser::~Parser() | |
| 97 { | |
| 98 } | |
| 99 | |
| 100 void Parser::advance() | |
| 101 { | |
| 102 token_stream.nextToken(); | |
| 103 } | |
| 104 | |
| 105 TranslationUnitAST *Parser::parse(const char *contents, | |
| 106 std::size_t size, pool *p) | |
| 107 { | |
| 108 _M_block_errors = false; | |
| 109 _M_pool = p; | |
| 110 lexer.tokenize(contents, size); | |
| 111 token_stream.nextToken(); // skip the first token | |
| 112 | |
| 113 Lexer *oldLexer = control->changeLexer (&lexer); | |
| 114 Parser *oldParser = control->changeParser (this); | |
| 115 | |
| 116 TranslationUnitAST *ast = 0; | |
| 117 parseTranslationUnit(ast); | |
| 118 | |
| 119 control->changeLexer (oldLexer); | |
| 120 control->changeParser (oldParser); | |
| 121 | |
| 122 return ast; | |
| 123 } | |
| 124 | |
| 125 bool Parser::parseWinDeclSpec(WinDeclSpecAST *&node) | |
| 126 { | |
| 127 if (token_stream.lookAhead() != Token_identifier) | |
| 128 return false; | |
| 129 | |
| 130 std::size_t start = token_stream.cursor(); | |
| 131 | |
| 132 const NameSymbol *name_symbol = token_stream.symbol(token_stream.cursor()); | |
| 133 QString name = name_symbol->as_string(); | |
| 134 if (name != QLatin1String("__declspec")) | |
| 135 return false; | |
| 136 std::size_t specifier = token_stream.cursor(); | |
| 137 | |
| 138 token_stream.nextToken(); | |
| 139 if (token_stream.lookAhead() != '(') | |
| 140 return false; | |
| 141 | |
| 142 token_stream.nextToken(); | |
| 143 if (token_stream.lookAhead() != Token_identifier) | |
| 144 return false; | |
| 145 std::size_t modifier = token_stream.cursor(); | |
| 146 | |
| 147 token_stream.nextToken(); | |
| 148 if (token_stream.lookAhead() != ')') | |
| 149 return false; | |
| 150 | |
| 151 token_stream.nextToken(); | |
| 152 | |
| 153 node = CreateNode<WinDeclSpecAST>(_M_pool); | |
| 154 node->specifier = specifier; | |
| 155 node->modifier = modifier; | |
| 156 | |
| 157 UPDATE_POS(node, start, token_stream.cursor()); | |
| 158 | |
| 159 return true; | |
| 160 } | |
| 161 | |
| 162 void Parser::tokenRequiredError(int token) | |
| 163 { | |
| 164 QString err; | |
| 165 | |
| 166 err += "expected token "; | |
| 167 err += "``"; | |
| 168 err += token_name(token); | |
| 169 err += "'' found ``"; | |
| 170 err += token_name(token_stream.lookAhead()); | |
| 171 err += "''"; | |
| 172 | |
| 173 reportError(err); | |
| 174 } | |
| 175 | |
| 176 void Parser::syntaxError() | |
| 177 { | |
| 178 QString err; | |
| 179 | |
| 180 err += "unexpected token "; | |
| 181 err += "``"; | |
| 182 err += token_name(token_stream.lookAhead()); | |
| 183 err += "''"; | |
| 184 | |
| 185 reportError(err); | |
| 186 } | |
| 187 | |
| 188 void Parser::reportError(const QString& msg) | |
| 189 { | |
| 190 if (!_M_block_errors) | |
| 191 { | |
| 192 int line, column; | |
| 193 QString fileName; | |
| 194 | |
| 195 std::size_t tok = token_stream.cursor(); | |
| 196 location().positionAt(token_stream.position(tok), | |
| 197 &line, &column, &fileName); | |
| 198 | |
| 199 Control::ErrorMessage errmsg; | |
| 200 errmsg.setLine(line + 1); | |
| 201 errmsg.setColumn(column); | |
| 202 errmsg.setFileName(fileName); | |
| 203 errmsg.setMessage(QLatin1String("** PARSER ERROR ") + msg); | |
| 204 control->reportError(errmsg); | |
| 205 } | |
| 206 } | |
| 207 | |
| 208 bool Parser::skipUntil(int token) | |
| 209 { | |
| 210 while (token_stream.lookAhead()) | |
| 211 { | |
| 212 if (token_stream.lookAhead() == token) | |
| 213 return true; | |
| 214 | |
| 215 token_stream.nextToken(); | |
| 216 } | |
| 217 | |
| 218 return false; | |
| 219 } | |
| 220 | |
| 221 bool Parser::skipUntilDeclaration() | |
| 222 { | |
| 223 while (token_stream.lookAhead()) | |
| 224 { | |
| 225 | |
| 226 switch(token_stream.lookAhead()) | |
| 227 { | |
| 228 case ';': | |
| 229 case '~': | |
| 230 case Token_scope: | |
| 231 case Token_identifier: | |
| 232 case Token_operator: | |
| 233 case Token_char: | |
| 234 case Token_wchar_t: | |
| 235 case Token_bool: | |
| 236 case Token_short: | |
| 237 case Token_int: | |
| 238 case Token_long: | |
| 239 case Token_signed: | |
| 240 case Token_unsigned: | |
| 241 case Token_float: | |
| 242 case Token_double: | |
| 243 case Token_void: | |
| 244 case Token_extern: | |
| 245 case Token_namespace: | |
| 246 case Token_using: | |
| 247 case Token_typedef: | |
| 248 case Token_asm: | |
| 249 case Token_template: | |
| 250 case Token_export: | |
| 251 | |
| 252 case Token_const: // cv | |
| 253 case Token_volatile: // cv | |
| 254 | |
| 255 case Token_public: | |
| 256 case Token_protected: | |
| 257 case Token_private: | |
| 258 case Token_signals: // Qt | |
| 259 case Token_slots: // Qt | |
| 260 return true; | |
| 261 | |
| 262 default: | |
| 263 token_stream.nextToken(); | |
| 264 } | |
| 265 } | |
| 266 | |
| 267 return false; | |
| 268 } | |
| 269 | |
| 270 bool Parser::skipUntilStatement() | |
| 271 { | |
| 272 while (token_stream.lookAhead()) | |
| 273 { | |
| 274 switch(token_stream.lookAhead()) | |
| 275 { | |
| 276 case ';': | |
| 277 case '{': | |
| 278 case '}': | |
| 279 case Token_const: | |
| 280 case Token_volatile: | |
| 281 case Token_identifier: | |
| 282 case Token_case: | |
| 283 case Token_default: | |
| 284 case Token_if: | |
| 285 case Token_switch: | |
| 286 case Token_while: | |
| 287 case Token_do: | |
| 288 case Token_for: | |
| 289 case Token_break: | |
| 290 case Token_continue: | |
| 291 case Token_return: | |
| 292 case Token_goto: | |
| 293 case Token_try: | |
| 294 case Token_catch: | |
| 295 case Token_throw: | |
| 296 case Token_char: | |
| 297 case Token_wchar_t: | |
| 298 case Token_bool: | |
| 299 case Token_short: | |
| 300 case Token_int: | |
| 301 case Token_long: | |
| 302 case Token_signed: | |
| 303 case Token_unsigned: | |
| 304 case Token_float: | |
| 305 case Token_double: | |
| 306 case Token_void: | |
| 307 case Token_class: | |
| 308 case Token_struct: | |
| 309 case Token_union: | |
| 310 case Token_enum: | |
| 311 case Token_scope: | |
| 312 case Token_template: | |
| 313 case Token_using: | |
| 314 return true; | |
| 315 | |
| 316 default: | |
| 317 token_stream.nextToken(); | |
| 318 } | |
| 319 } | |
| 320 | |
| 321 return false; | |
| 322 } | |
| 323 | |
| 324 bool Parser::skip(int l, int r) | |
| 325 { | |
| 326 int count = 0; | |
| 327 while (token_stream.lookAhead()) | |
| 328 { | |
| 329 int tk = token_stream.lookAhead(); | |
| 330 | |
| 331 if (tk == l) | |
| 332 ++count; | |
| 333 else if (tk == r) | |
| 334 --count; | |
| 335 else if (l != '{' && (tk == '{' || tk == '}' || tk == ';')) | |
| 336 return false; | |
| 337 | |
| 338 if (count == 0) | |
| 339 return true; | |
| 340 | |
| 341 token_stream.nextToken(); | |
| 342 } | |
| 343 | |
| 344 return false; | |
| 345 } | |
| 346 | |
| 347 bool Parser::parseName(NameAST *&node, bool acceptTemplateId) | |
| 348 { | |
| 349 std::size_t start = token_stream.cursor(); | |
| 350 | |
| 351 WinDeclSpecAST *winDeclSpec = 0; | |
| 352 parseWinDeclSpec(winDeclSpec); | |
| 353 | |
| 354 NameAST *ast = CreateNode<NameAST>(_M_pool); | |
| 355 | |
| 356 if (token_stream.lookAhead() == Token_scope) | |
| 357 { | |
| 358 ast->global = true; | |
| 359 token_stream.nextToken(); | |
| 360 } | |
| 361 | |
| 362 std::size_t idx = token_stream.cursor(); | |
| 363 | |
| 364 while (true) | |
| 365 { | |
| 366 UnqualifiedNameAST *n = 0; | |
| 367 if (!parseUnqualifiedName(n)) | |
| 368 return false; | |
| 369 | |
| 370 if (token_stream.lookAhead() == Token_scope) | |
| 371 { | |
| 372 token_stream.nextToken(); | |
| 373 | |
| 374 ast->qualified_names | |
| 375 = snoc(ast->qualified_names, n, _M_pool); | |
| 376 | |
| 377 if (token_stream.lookAhead() == Token_template) | |
| 378 { | |
| 379 /// skip optional template #### @todo CHECK | |
| 380 token_stream.nextToken(); | |
| 381 } | |
| 382 } | |
| 383 else | |
| 384 { | |
| 385 Q_ASSERT(n != 0); | |
| 386 if (!acceptTemplateId) | |
| 387 { | |
| 388 token_stream.rewind((int) n->start_token); | |
| 389 parseUnqualifiedName(n, false); | |
| 390 } | |
| 391 | |
| 392 ast->unqualified_name = n; | |
| 393 break; | |
| 394 } | |
| 395 } | |
| 396 | |
| 397 if (idx == token_stream.cursor()) | |
| 398 return false; | |
| 399 | |
| 400 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 401 node = ast; | |
| 402 | |
| 403 return true; | |
| 404 } | |
| 405 | |
| 406 bool Parser::parseTranslationUnit(TranslationUnitAST *&node) | |
| 407 { | |
| 408 std::size_t start = token_stream.cursor(); | |
| 409 TranslationUnitAST *ast = CreateNode<TranslationUnitAST>(_M_pool); | |
| 410 | |
| 411 while (token_stream.lookAhead()) | |
| 412 { | |
| 413 std::size_t startDecl = token_stream.cursor(); | |
| 414 | |
| 415 DeclarationAST *declaration = 0; | |
| 416 if (parseDeclaration(declaration)) | |
| 417 { | |
| 418 ast->declarations = | |
| 419 snoc(ast->declarations, declaration, _M_pool); | |
| 420 } | |
| 421 else | |
| 422 { | |
| 423 // error recovery | |
| 424 if (startDecl == token_stream.cursor()) | |
| 425 { | |
| 426 // skip at least one token | |
| 427 token_stream.nextToken(); | |
| 428 } | |
| 429 | |
| 430 skipUntilDeclaration(); | |
| 431 } | |
| 432 } | |
| 433 | |
| 434 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 435 node = ast; | |
| 436 | |
| 437 return true; | |
| 438 } | |
| 439 | |
| 440 bool Parser::parseDeclaration(DeclarationAST *&node) | |
| 441 { | |
| 442 std::size_t start = token_stream.cursor(); | |
| 443 | |
| 444 switch(token_stream.lookAhead()) | |
| 445 { | |
| 446 case ';': | |
| 447 token_stream.nextToken(); | |
| 448 return true; | |
| 449 | |
| 450 case Token_extern: | |
| 451 return parseLinkageSpecification(node); | |
| 452 | |
| 453 case Token_namespace: | |
| 454 return parseNamespace(node); | |
| 455 | |
| 456 case Token_using: | |
| 457 return parseUsing(node); | |
| 458 | |
| 459 case Token_typedef: | |
| 460 return parseTypedef(node); | |
| 461 | |
| 462 case Token_asm: | |
| 463 return parseAsmDefinition(node); | |
| 464 | |
| 465 case Token_Q_ENUMS: | |
| 466 return parseQ_ENUMS(node); | |
| 467 | |
| 468 case Token_template: | |
| 469 case Token_export: | |
| 470 return parseTemplateDeclaration(node); | |
| 471 | |
| 472 default: | |
| 473 { | |
| 474 const ListNode<std::size_t> *cv = 0; | |
| 475 parseCvQualify(cv); | |
| 476 | |
| 477 const ListNode<std::size_t> *storageSpec = 0; | |
| 478 parseStorageClassSpecifier(storageSpec); | |
| 479 | |
| 480 parseCvQualify(cv); | |
| 481 | |
| 482 TypeSpecifierAST *spec = 0; | |
| 483 if (parseEnumSpecifier(spec) | |
| 484 || parseClassSpecifier(spec) | |
| 485 || parseForwardDeclarationSpecifier(spec)) | |
| 486 { | |
| 487 parseCvQualify(cv); | |
| 488 | |
| 489 spec->cv = cv; | |
| 490 | |
| 491 const ListNode<InitDeclaratorAST*> *declarators = 0; | |
| 492 parseInitDeclaratorList(declarators); | |
| 493 ADVANCE(';', ";"); | |
| 494 | |
| 495 SimpleDeclarationAST *ast = | |
| 496 CreateNode<SimpleDeclarationAST>(_M_pool); | |
| 497 | |
| 498 ast->storage_specifiers = storageSpec; | |
| 499 ast->type_specifier = spec; | |
| 500 ast->init_declarators = declarators; | |
| 501 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 502 node = ast; | |
| 503 | |
| 504 return true; | |
| 505 } | |
| 506 } | |
| 507 } // end switch | |
| 508 | |
| 509 token_stream.rewind((int) start); | |
| 510 return parseDeclarationInternal(node); | |
| 511 } | |
| 512 | |
| 513 bool Parser::parseLinkageSpecification(DeclarationAST *&node) | |
| 514 { | |
| 515 std::size_t start = token_stream.cursor(); | |
| 516 | |
| 517 CHECK(Token_extern); | |
| 518 | |
| 519 LinkageSpecificationAST *ast = CreateNode<LinkageSpecificationAST>(_M_pool); | |
| 520 | |
| 521 if (token_stream.lookAhead() == Token_string_literal) | |
| 522 { | |
| 523 ast->extern_type = token_stream.cursor(); | |
| 524 token_stream.nextToken(); | |
| 525 } | |
| 526 | |
| 527 if (token_stream.lookAhead() == '{') | |
| 528 { | |
| 529 parseLinkageBody(ast->linkage_body); | |
| 530 } | |
| 531 else if (!parseDeclaration(ast->declaration)) | |
| 532 { | |
| 533 reportError(("Declaration syntax error")); | |
| 534 } | |
| 535 | |
| 536 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 537 node = ast; | |
| 538 | |
| 539 return true; | |
| 540 } | |
| 541 | |
| 542 bool Parser::parseLinkageBody(LinkageBodyAST *&node) | |
| 543 { | |
| 544 std::size_t start = token_stream.cursor(); | |
| 545 | |
| 546 CHECK('{'); | |
| 547 | |
| 548 LinkageBodyAST *ast = CreateNode<LinkageBodyAST>(_M_pool); | |
| 549 | |
| 550 while (token_stream.lookAhead()) | |
| 551 { | |
| 552 int tk = token_stream.lookAhead(); | |
| 553 | |
| 554 if (tk == '}') | |
| 555 break; | |
| 556 | |
| 557 std::size_t startDecl = token_stream.cursor(); | |
| 558 | |
| 559 DeclarationAST *declaration = 0; | |
| 560 if (parseDeclaration(declaration)) | |
| 561 { | |
| 562 ast->declarations = snoc(ast->declarations, declaration, _M_pool); | |
| 563 } | |
| 564 else | |
| 565 { | |
| 566 // error recovery | |
| 567 if (startDecl == token_stream.cursor()) | |
| 568 { | |
| 569 // skip at least one token | |
| 570 token_stream.nextToken(); | |
| 571 } | |
| 572 | |
| 573 skipUntilDeclaration(); | |
| 574 } | |
| 575 } | |
| 576 | |
| 577 if (token_stream.lookAhead() != '}') | |
| 578 reportError(("} expected")); | |
| 579 else | |
| 580 token_stream.nextToken(); | |
| 581 | |
| 582 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 583 node = ast; | |
| 584 | |
| 585 return true; | |
| 586 } | |
| 587 | |
| 588 bool Parser::parseNamespace(DeclarationAST *&node) | |
| 589 { | |
| 590 std::size_t start = token_stream.cursor(); | |
| 591 | |
| 592 CHECK(Token_namespace); | |
| 593 | |
| 594 std::size_t namespace_name = 0; | |
| 595 if (token_stream.lookAhead() == Token_identifier) | |
| 596 { | |
| 597 namespace_name = token_stream.cursor(); | |
| 598 token_stream.nextToken(); | |
| 599 } | |
| 600 | |
| 601 if (token_stream.lookAhead() == '=') | |
| 602 { | |
| 603 // namespace alias | |
| 604 token_stream.nextToken(); | |
| 605 | |
| 606 NameAST *name = 0; | |
| 607 if (parseName(name)) | |
| 608 { | |
| 609 ADVANCE(';', ";"); | |
| 610 | |
| 611 NamespaceAliasDefinitionAST *ast | |
| 612 = CreateNode<NamespaceAliasDefinitionAST>(_M_pool); | |
| 613 ast->namespace_name = namespace_name; | |
| 614 ast->alias_name = name; | |
| 615 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 616 node = ast; | |
| 617 return true; | |
| 618 } | |
| 619 else | |
| 620 { | |
| 621 reportError(("namespace expected")); | |
| 622 return false; | |
| 623 } | |
| 624 } | |
| 625 else if (token_stream.lookAhead() != '{') | |
| 626 { | |
| 627 reportError(("{ expected")); | |
| 628 return false; | |
| 629 } | |
| 630 | |
| 631 NamespaceAST *ast = CreateNode<NamespaceAST>(_M_pool); | |
| 632 ast->namespace_name = namespace_name; | |
| 633 parseLinkageBody(ast->linkage_body); | |
| 634 | |
| 635 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 636 node = ast; | |
| 637 | |
| 638 return true; | |
| 639 } | |
| 640 | |
| 641 bool Parser::parseUsing(DeclarationAST *&node) | |
| 642 { | |
| 643 std::size_t start = token_stream.cursor(); | |
| 644 | |
| 645 CHECK(Token_using); | |
| 646 | |
| 647 if (token_stream.lookAhead() == Token_namespace) | |
| 648 return parseUsingDirective(node); | |
| 649 | |
| 650 UsingAST *ast = CreateNode<UsingAST>(_M_pool); | |
| 651 | |
| 652 if (token_stream.lookAhead() == Token_typename) | |
| 653 { | |
| 654 ast->type_name = token_stream.cursor(); | |
| 655 token_stream.nextToken(); | |
| 656 } | |
| 657 | |
| 658 if (!parseName(ast->name)) | |
| 659 return false; | |
| 660 | |
| 661 ADVANCE(';', ";"); | |
| 662 | |
| 663 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 664 node = ast; | |
| 665 | |
| 666 return true; | |
| 667 } | |
| 668 | |
| 669 bool Parser::parseUsingDirective(DeclarationAST *&node) | |
| 670 { | |
| 671 std::size_t start = token_stream.cursor(); | |
| 672 | |
| 673 CHECK(Token_namespace); | |
| 674 | |
| 675 NameAST *name = 0; | |
| 676 if (!parseName(name)) | |
| 677 { | |
| 678 reportError(("Namespace name expected")); | |
| 679 return false; | |
| 680 } | |
| 681 | |
| 682 ADVANCE(';', ";"); | |
| 683 | |
| 684 UsingDirectiveAST *ast = CreateNode<UsingDirectiveAST>(_M_pool); | |
| 685 ast->name = name; | |
| 686 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 687 node = ast; | |
| 688 | |
| 689 return true; | |
| 690 } | |
| 691 | |
| 692 | |
| 693 bool Parser::parseOperatorFunctionId(OperatorFunctionIdAST *&node) | |
| 694 { | |
| 695 std::size_t start = token_stream.cursor(); | |
| 696 | |
| 697 CHECK(Token_operator); | |
| 698 | |
| 699 OperatorFunctionIdAST *ast = CreateNode<OperatorFunctionIdAST>(_M_pool); | |
| 700 | |
| 701 if (!parseOperator(ast->op)) | |
| 702 { | |
| 703 ast->op = 0; | |
| 704 | |
| 705 // parse cast operator | |
| 706 const ListNode<std::size_t> *cv = 0; | |
| 707 parseCvQualify(cv); | |
| 708 | |
| 709 if (!parseSimpleTypeSpecifier(ast->type_specifier)) | |
| 710 { | |
| 711 syntaxError(); | |
| 712 return false; | |
| 713 } | |
| 714 | |
| 715 parseCvQualify(cv); | |
| 716 ast->type_specifier->cv = cv; | |
| 717 | |
| 718 PtrOperatorAST *ptr_op = 0; | |
| 719 while (parsePtrOperator(ptr_op)) | |
| 720 ast->ptr_ops = snoc(ast->ptr_ops, ptr_op, _M_pool); | |
| 721 } | |
| 722 | |
| 723 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 724 node = ast; | |
| 725 return true; | |
| 726 } | |
| 727 | |
| 728 bool Parser::parseTemplateArgumentList(const ListNode<TemplateArgumentAST*> *&node, | |
| 729 bool reportError) | |
| 730 { | |
| 731 TemplateArgumentAST *templArg = 0; | |
| 732 if (!parseTemplateArgument(templArg)) | |
| 733 return false; | |
| 734 | |
| 735 node = snoc(node, templArg, _M_pool); | |
| 736 | |
| 737 while (token_stream.lookAhead() == ',') | |
| 738 { | |
| 739 token_stream.nextToken(); | |
| 740 | |
| 741 if (!parseTemplateArgument(templArg)) | |
| 742 { | |
| 743 if (reportError) | |
| 744 { | |
| 745 syntaxError(); | |
| 746 break; | |
| 747 } | |
| 748 | |
| 749 node = 0; | |
| 750 return false; | |
| 751 } | |
| 752 | |
| 753 node = snoc(node, templArg, _M_pool); | |
| 754 } | |
| 755 | |
| 756 return true; | |
| 757 } | |
| 758 | |
| 759 bool Parser::parseTypedef(DeclarationAST *&node) | |
| 760 { | |
| 761 std::size_t start = token_stream.cursor(); | |
| 762 | |
| 763 CHECK(Token_typedef); | |
| 764 | |
| 765 TypeSpecifierAST *spec = 0; | |
| 766 if (!parseTypeSpecifierOrClassSpec(spec)) | |
| 767 { | |
| 768 reportError(("Need a type specifier to declare")); | |
| 769 return false; | |
| 770 } | |
| 771 | |
| 772 const ListNode<InitDeclaratorAST*> *declarators = 0; | |
| 773 if (!parseInitDeclaratorList(declarators)) | |
| 774 { | |
| 775 //reportError(("Need an identifier to declare")); | |
| 776 //return false; | |
| 777 } | |
| 778 | |
| 779 ADVANCE(';', ";"); | |
| 780 | |
| 781 TypedefAST *ast = CreateNode<TypedefAST>(_M_pool); | |
| 782 ast->type_specifier = spec; | |
| 783 ast->init_declarators = declarators; | |
| 784 | |
| 785 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 786 node = ast; | |
| 787 | |
| 788 return true; | |
| 789 } | |
| 790 | |
| 791 bool Parser::parseAsmDefinition(DeclarationAST *&node) | |
| 792 { | |
| 793 std::size_t start = token_stream.cursor(); | |
| 794 | |
| 795 ADVANCE(Token_asm, "asm"); | |
| 796 | |
| 797 const ListNode<std::size_t> *cv = 0; | |
| 798 parseCvQualify(cv); | |
| 799 | |
| 800 #if defined(__GNUC__) | |
| 801 #warning "implement me" | |
| 802 #endif | |
| 803 skip('(', ')'); | |
| 804 token_stream.nextToken(); | |
| 805 ADVANCE(';', ";"); | |
| 806 | |
| 807 AsmDefinitionAST *ast = CreateNode<AsmDefinitionAST>(_M_pool); | |
| 808 ast->cv = cv; | |
| 809 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 810 node = ast; | |
| 811 | |
| 812 return true; | |
| 813 } | |
| 814 | |
| 815 bool Parser::parseTemplateDeclaration(DeclarationAST *&node) | |
| 816 { | |
| 817 std::size_t start = token_stream.cursor(); | |
| 818 | |
| 819 std::size_t exported = 0; | |
| 820 if (token_stream.lookAhead() == Token_export) | |
| 821 { | |
| 822 exported = token_stream.cursor(); | |
| 823 token_stream.nextToken(); | |
| 824 } | |
| 825 | |
| 826 CHECK(Token_template); | |
| 827 | |
| 828 const ListNode<TemplateParameterAST*> *params = 0; | |
| 829 if (token_stream.lookAhead() == '<') | |
| 830 { | |
| 831 token_stream.nextToken(); | |
| 832 parseTemplateParameterList(params); | |
| 833 | |
| 834 ADVANCE('>', ">"); | |
| 835 } | |
| 836 | |
| 837 DeclarationAST *declaration = 0; | |
| 838 if (!parseDeclaration(declaration)) | |
| 839 { | |
| 840 reportError(("expected a declaration")); | |
| 841 } | |
| 842 | |
| 843 TemplateDeclarationAST *ast = CreateNode<TemplateDeclarationAST>(_M_pool); | |
| 844 ast->exported = exported; | |
| 845 ast->template_parameters = params; | |
| 846 ast->declaration = declaration; | |
| 847 | |
| 848 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 849 node = ast; | |
| 850 | |
| 851 return true; | |
| 852 } | |
| 853 | |
| 854 bool Parser::parseOperator(OperatorAST *&node) | |
| 855 { | |
| 856 std::size_t start = token_stream.cursor(); | |
| 857 | |
| 858 OperatorAST *ast = CreateNode<OperatorAST>(_M_pool); | |
| 859 | |
| 860 switch(token_stream.lookAhead()) | |
| 861 { | |
| 862 case Token_new: | |
| 863 case Token_delete: | |
| 864 { | |
| 865 ast->op = token_stream.cursor(); | |
| 866 token_stream.nextToken(); | |
| 867 | |
| 868 if (token_stream.lookAhead() == '[' | |
| 869 && token_stream.lookAhead(1) == ']') | |
| 870 { | |
| 871 ast->open = token_stream.cursor(); | |
| 872 token_stream.nextToken(); | |
| 873 | |
| 874 ast->close = token_stream.cursor(); | |
| 875 token_stream.nextToken(); | |
| 876 } | |
| 877 } | |
| 878 break; | |
| 879 | |
| 880 case '+': | |
| 881 case '-': | |
| 882 case '*': | |
| 883 case '/': | |
| 884 case '%': | |
| 885 case '^': | |
| 886 case '&': | |
| 887 case '|': | |
| 888 case '~': | |
| 889 case '!': | |
| 890 case '=': | |
| 891 case '<': | |
| 892 case '>': | |
| 893 case ',': | |
| 894 case Token_assign: | |
| 895 case Token_shift: | |
| 896 case Token_eq: | |
| 897 case Token_not_eq: | |
| 898 case Token_leq: | |
| 899 case Token_geq: | |
| 900 case Token_and: | |
| 901 case Token_or: | |
| 902 case Token_incr: | |
| 903 case Token_decr: | |
| 904 case Token_ptrmem: | |
| 905 case Token_arrow: | |
| 906 ast->op = token_stream.cursor(); | |
| 907 token_stream.nextToken(); | |
| 908 break; | |
| 909 | |
| 910 default: | |
| 911 if (token_stream.lookAhead() == '(' | |
| 912 && token_stream.lookAhead(1) == ')') | |
| 913 { | |
| 914 ast->op = ast->open = token_stream.cursor(); | |
| 915 token_stream.nextToken(); | |
| 916 ast->close = token_stream.cursor(); | |
| 917 token_stream.nextToken(); | |
| 918 } | |
| 919 else if (token_stream.lookAhead() == '[' | |
| 920 && token_stream.lookAhead(1) == ']') | |
| 921 { | |
| 922 ast->op = ast->open = token_stream.cursor(); | |
| 923 token_stream.nextToken(); | |
| 924 ast->close = token_stream.cursor(); | |
| 925 token_stream.nextToken(); | |
| 926 } | |
| 927 else | |
| 928 { | |
| 929 return false; | |
| 930 } | |
| 931 } | |
| 932 | |
| 933 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 934 node = ast; | |
| 935 | |
| 936 return true; | |
| 937 } | |
| 938 | |
| 939 bool Parser::parseCvQualify(const ListNode<std::size_t> *&node) | |
| 940 { | |
| 941 std::size_t start = token_stream.cursor(); | |
| 942 | |
| 943 int tk; | |
| 944 while (0 != (tk = token_stream.lookAhead()) | |
| 945 && (tk == Token_const || tk == Token_volatile)) | |
| 946 { | |
| 947 node = snoc(node, token_stream.cursor(), _M_pool); | |
| 948 token_stream.nextToken(); | |
| 949 } | |
| 950 | |
| 951 return start != token_stream.cursor(); | |
| 952 } | |
| 953 | |
| 954 bool Parser::parseSimpleTypeSpecifier(TypeSpecifierAST *&node, | |
| 955 bool onlyIntegral) | |
| 956 { | |
| 957 std::size_t start = token_stream.cursor(); | |
| 958 bool isIntegral = false; | |
| 959 bool done = false; | |
| 960 | |
| 961 const ListNode<std::size_t> *integrals = 0; | |
| 962 | |
| 963 while (!done) | |
| 964 { | |
| 965 switch(token_stream.lookAhead()) | |
| 966 { | |
| 967 case Token_char: | |
| 968 case Token_wchar_t: | |
| 969 case Token_bool: | |
| 970 case Token_short: | |
| 971 case Token_int: | |
| 972 case Token_long: | |
| 973 case Token_signed: | |
| 974 case Token_unsigned: | |
| 975 case Token_float: | |
| 976 case Token_double: | |
| 977 case Token_void: | |
| 978 integrals = snoc(integrals, token_stream.cursor(), _M_pool); | |
| 979 isIntegral = true; | |
| 980 token_stream.nextToken(); | |
| 981 break; | |
| 982 | |
| 983 default: | |
| 984 done = true; | |
| 985 } | |
| 986 } | |
| 987 | |
| 988 SimpleTypeSpecifierAST *ast = CreateNode<SimpleTypeSpecifierAST>(_M_pool); | |
| 989 if (isIntegral) | |
| 990 { | |
| 991 ast->integrals = integrals; | |
| 992 } | |
| 993 else if (token_stream.lookAhead() == Token___typeof) | |
| 994 { | |
| 995 ast->type_of = token_stream.cursor(); | |
| 996 token_stream.nextToken(); | |
| 997 | |
| 998 if (token_stream.lookAhead() == '(') | |
| 999 { | |
| 1000 token_stream.nextToken(); | |
| 1001 | |
| 1002 std::size_t saved = token_stream.cursor(); | |
| 1003 parseTypeId(ast->type_id); | |
| 1004 if (token_stream.lookAhead() != ')') | |
| 1005 { | |
| 1006 ast->type_id = 0; | |
| 1007 token_stream.rewind((int) saved); | |
| 1008 parseUnaryExpression(ast->expression); | |
| 1009 } | |
| 1010 ADVANCE(')', ")"); | |
| 1011 } | |
| 1012 else | |
| 1013 { | |
| 1014 parseUnaryExpression(ast->expression); | |
| 1015 } | |
| 1016 } | |
| 1017 else if (onlyIntegral) | |
| 1018 { | |
| 1019 token_stream.rewind((int) start); | |
| 1020 return false; | |
| 1021 } | |
| 1022 else | |
| 1023 { | |
| 1024 if (!parseName(ast->name, true)) | |
| 1025 { | |
| 1026 ast->name = 0; | |
| 1027 token_stream.rewind((int) start); | |
| 1028 return false; | |
| 1029 } | |
| 1030 } | |
| 1031 | |
| 1032 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1033 node = ast; | |
| 1034 | |
| 1035 return true; | |
| 1036 } | |
| 1037 | |
| 1038 bool Parser::parsePtrOperator(PtrOperatorAST *&node) | |
| 1039 { | |
| 1040 int tk = token_stream.lookAhead(); | |
| 1041 | |
| 1042 if (tk != '&' && tk != '*' | |
| 1043 && tk != Token_scope && tk != Token_identifier) | |
| 1044 { | |
| 1045 return false; | |
| 1046 } | |
| 1047 | |
| 1048 std::size_t start = token_stream.cursor(); | |
| 1049 | |
| 1050 PtrOperatorAST *ast = CreateNode<PtrOperatorAST>(_M_pool); | |
| 1051 | |
| 1052 switch (token_stream.lookAhead()) | |
| 1053 { | |
| 1054 case '&': | |
| 1055 case '*': | |
| 1056 ast->op = token_stream.cursor(); | |
| 1057 token_stream.nextToken(); | |
| 1058 break; | |
| 1059 | |
| 1060 case Token_scope: | |
| 1061 case Token_identifier: | |
| 1062 { | |
| 1063 if (!parsePtrToMember(ast->mem_ptr)) | |
| 1064 { | |
| 1065 token_stream.rewind((int) start); | |
| 1066 return false; | |
| 1067 } | |
| 1068 } | |
| 1069 break; | |
| 1070 | |
| 1071 default: | |
| 1072 Q_ASSERT(0); | |
| 1073 break; | |
| 1074 } | |
| 1075 | |
| 1076 parseCvQualify(ast->cv); | |
| 1077 | |
| 1078 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1079 node = ast; | |
| 1080 | |
| 1081 return true; | |
| 1082 } | |
| 1083 | |
| 1084 bool Parser::parseTemplateArgument(TemplateArgumentAST *&node) | |
| 1085 { | |
| 1086 std::size_t start = token_stream.cursor(); | |
| 1087 | |
| 1088 TypeIdAST *typeId = 0; | |
| 1089 ExpressionAST *expr = 0; | |
| 1090 | |
| 1091 if (!parseTypeId(typeId) || (token_stream.lookAhead() != ',' | |
| 1092 && token_stream.lookAhead() != '>')) | |
| 1093 { | |
| 1094 token_stream.rewind((int) start); | |
| 1095 | |
| 1096 if (!parseLogicalOrExpression(expr, true)) | |
| 1097 return false; | |
| 1098 } | |
| 1099 | |
| 1100 TemplateArgumentAST *ast = CreateNode<TemplateArgumentAST>(_M_pool); | |
| 1101 ast->type_id = typeId; | |
| 1102 ast->expression = expr; | |
| 1103 | |
| 1104 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1105 node = ast; | |
| 1106 | |
| 1107 return true; | |
| 1108 } | |
| 1109 | |
| 1110 bool Parser::parseTypeSpecifier(TypeSpecifierAST *&node) | |
| 1111 { | |
| 1112 std::size_t start = token_stream.cursor(); | |
| 1113 | |
| 1114 const ListNode<std::size_t> *cv = 0; | |
| 1115 parseCvQualify(cv); | |
| 1116 | |
| 1117 TypeSpecifierAST *ast = 0; | |
| 1118 if (!parseElaboratedTypeSpecifier(ast) && !parseSimpleTypeSpecifier(ast)) | |
| 1119 { | |
| 1120 token_stream.rewind((int) start); | |
| 1121 return false; | |
| 1122 } | |
| 1123 | |
| 1124 parseCvQualify(cv); | |
| 1125 ast->cv = cv; | |
| 1126 | |
| 1127 node = ast; | |
| 1128 | |
| 1129 return true; | |
| 1130 } | |
| 1131 | |
| 1132 bool Parser::parseDeclarator(DeclaratorAST *&node) | |
| 1133 { | |
| 1134 std::size_t start = token_stream.cursor(); | |
| 1135 | |
| 1136 DeclaratorAST *ast = CreateNode<DeclaratorAST>(_M_pool); | |
| 1137 | |
| 1138 DeclaratorAST *decl = 0; | |
| 1139 NameAST *declId = 0; | |
| 1140 | |
| 1141 PtrOperatorAST *ptrOp = 0; | |
| 1142 while (parsePtrOperator(ptrOp)) | |
| 1143 { | |
| 1144 ast->ptr_ops = snoc(ast->ptr_ops, ptrOp, _M_pool); | |
| 1145 } | |
| 1146 | |
| 1147 if (token_stream.lookAhead() == '(') | |
| 1148 { | |
| 1149 token_stream.nextToken(); | |
| 1150 | |
| 1151 if (!parseDeclarator(decl)) | |
| 1152 return false; | |
| 1153 | |
| 1154 ast->sub_declarator = decl; | |
| 1155 | |
| 1156 CHECK(')'); | |
| 1157 } | |
| 1158 else | |
| 1159 { | |
| 1160 if (token_stream.lookAhead() == ':') | |
| 1161 { | |
| 1162 // unnamed bitfield | |
| 1163 } | |
| 1164 else if (parseName(declId, true)) | |
| 1165 { | |
| 1166 ast->id = declId; | |
| 1167 } | |
| 1168 else | |
| 1169 { | |
| 1170 token_stream.rewind((int) start); | |
| 1171 return false; | |
| 1172 } | |
| 1173 | |
| 1174 if (token_stream.lookAhead() == ':') | |
| 1175 { | |
| 1176 token_stream.nextToken(); | |
| 1177 | |
| 1178 if (!parseConstantExpression(ast->bit_expression)) | |
| 1179 { | |
| 1180 reportError(("Constant expression expected")); | |
| 1181 } | |
| 1182 goto update_pos; | |
| 1183 } | |
| 1184 } | |
| 1185 | |
| 1186 { | |
| 1187 bool isVector = true; | |
| 1188 | |
| 1189 while (token_stream.lookAhead() == '[') | |
| 1190 { | |
| 1191 token_stream.nextToken(); | |
| 1192 | |
| 1193 ExpressionAST *expr = 0; | |
| 1194 parseCommaExpression(expr); | |
| 1195 | |
| 1196 ADVANCE(']', "]"); | |
| 1197 | |
| 1198 ast->array_dimensions = snoc(ast->array_dimensions, expr, _M_pool); | |
| 1199 isVector = true; | |
| 1200 } | |
| 1201 | |
| 1202 bool skipParen = false; | |
| 1203 if (token_stream.lookAhead() == Token_identifier | |
| 1204 && token_stream.lookAhead(1) == '(' | |
| 1205 && token_stream.lookAhead(2) == '(') | |
| 1206 { | |
| 1207 token_stream.nextToken(); | |
| 1208 token_stream.nextToken(); | |
| 1209 skipParen = true; | |
| 1210 } | |
| 1211 | |
| 1212 int tok = token_stream.lookAhead(); | |
| 1213 if (ast->sub_declarator | |
| 1214 && !(isVector || tok == '(' || tok == ',' | |
| 1215 || tok == ';' || tok == '=')) | |
| 1216 { | |
| 1217 token_stream.rewind((int) start); | |
| 1218 return false; | |
| 1219 } | |
| 1220 | |
| 1221 std::size_t index = token_stream.cursor(); | |
| 1222 if (token_stream.lookAhead() == '(') | |
| 1223 { | |
| 1224 token_stream.nextToken(); | |
| 1225 | |
| 1226 ParameterDeclarationClauseAST *params = 0; | |
| 1227 if (!parseParameterDeclarationClause(params)) | |
| 1228 { | |
| 1229 token_stream.rewind((int) index); | |
| 1230 goto update_pos; | |
| 1231 } | |
| 1232 | |
| 1233 ast->parameter_declaration_clause = params; | |
| 1234 | |
| 1235 if (token_stream.lookAhead() != ')') | |
| 1236 { | |
| 1237 token_stream.rewind((int) index); | |
| 1238 goto update_pos; | |
| 1239 } | |
| 1240 | |
| 1241 token_stream.nextToken(); // skip ')' | |
| 1242 | |
| 1243 parseCvQualify(ast->fun_cv); | |
| 1244 parseExceptionSpecification(ast->exception_spec); | |
| 1245 | |
| 1246 if (token_stream.lookAhead() == Token___attribute__) | |
| 1247 { | |
| 1248 parse_Attribute__(); | |
| 1249 } | |
| 1250 } | |
| 1251 | |
| 1252 if (skipParen) | |
| 1253 { | |
| 1254 if (token_stream.lookAhead() != ')') | |
| 1255 { | |
| 1256 reportError(("')' expected")); | |
| 1257 } | |
| 1258 else | |
| 1259 token_stream.nextToken(); | |
| 1260 } | |
| 1261 } | |
| 1262 | |
| 1263 update_pos: | |
| 1264 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1265 node = ast; | |
| 1266 | |
| 1267 return true; | |
| 1268 } | |
| 1269 | |
| 1270 bool Parser::parseAbstractDeclarator(DeclaratorAST *&node) | |
| 1271 { | |
| 1272 std::size_t start = token_stream.cursor(); | |
| 1273 | |
| 1274 DeclaratorAST *ast = CreateNode<DeclaratorAST>(_M_pool); | |
| 1275 DeclaratorAST *decl = 0; | |
| 1276 | |
| 1277 PtrOperatorAST *ptrOp = 0; | |
| 1278 while (parsePtrOperator(ptrOp)) | |
| 1279 { | |
| 1280 ast->ptr_ops = snoc(ast->ptr_ops, ptrOp, _M_pool); | |
| 1281 } | |
| 1282 | |
| 1283 int index = (int) token_stream.cursor(); | |
| 1284 if (token_stream.lookAhead() == '(') | |
| 1285 { | |
| 1286 token_stream.nextToken(); | |
| 1287 | |
| 1288 if (!parseAbstractDeclarator(decl)) | |
| 1289 { | |
| 1290 token_stream.rewind((int) index); | |
| 1291 goto label1; | |
| 1292 } | |
| 1293 | |
| 1294 ast->sub_declarator = decl; | |
| 1295 | |
| 1296 if (token_stream.lookAhead() != ')') | |
| 1297 { | |
| 1298 token_stream.rewind((int) start); | |
| 1299 return false; | |
| 1300 } | |
| 1301 token_stream.nextToken(); | |
| 1302 } | |
| 1303 else if (token_stream.lookAhead() == ':') | |
| 1304 { | |
| 1305 token_stream.nextToken(); | |
| 1306 if (!parseConstantExpression(ast->bit_expression)) | |
| 1307 { | |
| 1308 ast->bit_expression = 0; | |
| 1309 reportError(("Constant expression expected")); | |
| 1310 } | |
| 1311 goto update_pos; | |
| 1312 } | |
| 1313 | |
| 1314 label1: | |
| 1315 { | |
| 1316 bool isVector = true; | |
| 1317 | |
| 1318 while (token_stream.lookAhead() == '[') | |
| 1319 { | |
| 1320 token_stream.nextToken(); | |
| 1321 | |
| 1322 ExpressionAST *expr = 0; | |
| 1323 parseCommaExpression(expr); | |
| 1324 | |
| 1325 ADVANCE(']', "]"); | |
| 1326 | |
| 1327 ast->array_dimensions = snoc(ast->array_dimensions, expr, _M_pool); | |
| 1328 isVector = true; | |
| 1329 } | |
| 1330 | |
| 1331 int tok = token_stream.lookAhead(); | |
| 1332 if (ast->sub_declarator | |
| 1333 && !(isVector || tok == '(' || tok == ',' | |
| 1334 || tok == ';' || tok == '=')) | |
| 1335 { | |
| 1336 token_stream.rewind((int) start); | |
| 1337 return false; | |
| 1338 } | |
| 1339 | |
| 1340 int index = (int) token_stream.cursor(); | |
| 1341 if (token_stream.lookAhead() == '(') | |
| 1342 { | |
| 1343 token_stream.nextToken(); | |
| 1344 | |
| 1345 ParameterDeclarationClauseAST *params = 0; | |
| 1346 if (!parseParameterDeclarationClause(params)) | |
| 1347 { | |
| 1348 token_stream.rewind((int) index); | |
| 1349 goto update_pos; | |
| 1350 } | |
| 1351 | |
| 1352 ast->parameter_declaration_clause = params; | |
| 1353 | |
| 1354 if (token_stream.lookAhead() != ')') | |
| 1355 { | |
| 1356 token_stream.rewind((int) index); | |
| 1357 goto update_pos; | |
| 1358 } | |
| 1359 | |
| 1360 token_stream.nextToken(); // skip ')' | |
| 1361 | |
| 1362 parseCvQualify(ast->fun_cv); | |
| 1363 parseExceptionSpecification(ast->exception_spec); | |
| 1364 } | |
| 1365 } | |
| 1366 | |
| 1367 update_pos: | |
| 1368 if (token_stream.cursor() == start) | |
| 1369 return false; | |
| 1370 | |
| 1371 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1372 node = ast; | |
| 1373 | |
| 1374 return true; | |
| 1375 } | |
| 1376 | |
| 1377 bool Parser::parseEnumSpecifier(TypeSpecifierAST *&node) | |
| 1378 { | |
| 1379 std::size_t start = token_stream.cursor(); | |
| 1380 | |
| 1381 CHECK(Token_enum); | |
| 1382 | |
| 1383 NameAST *name = 0; | |
| 1384 parseName(name); | |
| 1385 | |
| 1386 if (token_stream.lookAhead() != '{') | |
| 1387 { | |
| 1388 token_stream.rewind((int) start); | |
| 1389 return false; | |
| 1390 } | |
| 1391 token_stream.nextToken(); | |
| 1392 | |
| 1393 EnumSpecifierAST *ast = CreateNode<EnumSpecifierAST>(_M_pool); | |
| 1394 ast->name = name; | |
| 1395 | |
| 1396 EnumeratorAST *enumerator = 0; | |
| 1397 if (parseEnumerator(enumerator)) | |
| 1398 { | |
| 1399 ast->enumerators = snoc(ast->enumerators, enumerator, _M_pool); | |
| 1400 | |
| 1401 while (token_stream.lookAhead() == ',') | |
| 1402 { | |
| 1403 token_stream.nextToken(); | |
| 1404 | |
| 1405 if (!parseEnumerator(enumerator)) | |
| 1406 { | |
| 1407 //reportError(("Enumerator expected")); | |
| 1408 break; | |
| 1409 } | |
| 1410 | |
| 1411 ast->enumerators = snoc(ast->enumerators, enumerator, _M_pool); | |
| 1412 } | |
| 1413 } | |
| 1414 | |
| 1415 ADVANCE_NR('}', "}"); | |
| 1416 | |
| 1417 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1418 node = ast; | |
| 1419 | |
| 1420 return true; | |
| 1421 } | |
| 1422 | |
| 1423 bool Parser::parseTemplateParameterList(const ListNode<TemplateParameterAST*> *&node) | |
| 1424 { | |
| 1425 TemplateParameterAST *param = 0; | |
| 1426 if (!parseTemplateParameter(param)) | |
| 1427 return false; | |
| 1428 | |
| 1429 node = snoc(node, param, _M_pool); | |
| 1430 | |
| 1431 while (token_stream.lookAhead() == ',') | |
| 1432 { | |
| 1433 token_stream.nextToken(); | |
| 1434 | |
| 1435 if (!parseTemplateParameter(param)) | |
| 1436 { | |
| 1437 syntaxError(); | |
| 1438 break; | |
| 1439 } | |
| 1440 else | |
| 1441 { | |
| 1442 node = snoc(node, param, _M_pool); | |
| 1443 } | |
| 1444 } | |
| 1445 | |
| 1446 return true; | |
| 1447 } | |
| 1448 | |
| 1449 bool Parser::parseTemplateParameter(TemplateParameterAST *&node) | |
| 1450 { | |
| 1451 std::size_t start = token_stream.cursor(); | |
| 1452 TemplateParameterAST *ast = CreateNode<TemplateParameterAST>(_M_pool); | |
| 1453 | |
| 1454 int tk = token_stream.lookAhead(); | |
| 1455 | |
| 1456 if ((tk == Token_class || tk == Token_typename || tk == Token_template) | |
| 1457 && parseTypeParameter(ast->type_parameter)) | |
| 1458 { | |
| 1459 // nothing to do | |
| 1460 } | |
| 1461 else if (!parseParameterDeclaration(ast->parameter_declaration)) | |
| 1462 return false; | |
| 1463 | |
| 1464 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1465 node = ast; | |
| 1466 | |
| 1467 return true; | |
| 1468 } | |
| 1469 | |
| 1470 bool Parser::parseTypeParameter(TypeParameterAST *&node) | |
| 1471 { | |
| 1472 std::size_t start = token_stream.cursor(); | |
| 1473 | |
| 1474 TypeParameterAST *ast = CreateNode<TypeParameterAST>(_M_pool); | |
| 1475 ast->type = start; | |
| 1476 | |
| 1477 switch(token_stream.lookAhead()) | |
| 1478 { | |
| 1479 case Token_class: | |
| 1480 case Token_typename: | |
| 1481 { | |
| 1482 token_stream.nextToken(); // skip class | |
| 1483 | |
| 1484 // parse optional name | |
| 1485 if(parseName(ast->name, true)) | |
| 1486 { | |
| 1487 if (token_stream.lookAhead() == '=') | |
| 1488 { | |
| 1489 token_stream.nextToken(); | |
| 1490 | |
| 1491 if(!parseTypeId(ast->type_id)) | |
| 1492 { | |
| 1493 //syntaxError(); | |
| 1494 token_stream.rewind((int) start); | |
| 1495 return false; | |
| 1496 } | |
| 1497 } | |
| 1498 else if (token_stream.lookAhead() != ',' | |
| 1499 && token_stream.lookAhead() != '>') | |
| 1500 { | |
| 1501 token_stream.rewind((int) start); | |
| 1502 return false; | |
| 1503 } | |
| 1504 } | |
| 1505 } | |
| 1506 break; | |
| 1507 | |
| 1508 case Token_template: | |
| 1509 { | |
| 1510 token_stream.nextToken(); // skip template | |
| 1511 ADVANCE('<', "<"); | |
| 1512 | |
| 1513 if (!parseTemplateParameterList(ast->template_parameters)) | |
| 1514 return false; | |
| 1515 | |
| 1516 ADVANCE('>', ">"); | |
| 1517 | |
| 1518 if (token_stream.lookAhead() == Token_class) | |
| 1519 token_stream.nextToken(); | |
| 1520 | |
| 1521 // parse optional name | |
| 1522 if (parseName(ast->name, true)) | |
| 1523 { | |
| 1524 if (token_stream.lookAhead() == '=') | |
| 1525 { | |
| 1526 token_stream.nextToken(); | |
| 1527 | |
| 1528 if (!parseTypeId(ast->type_id)) | |
| 1529 { | |
| 1530 syntaxError(); | |
| 1531 return false; | |
| 1532 } | |
| 1533 } | |
| 1534 } | |
| 1535 | |
| 1536 if (token_stream.lookAhead() == '=') | |
| 1537 { | |
| 1538 token_stream.nextToken(); | |
| 1539 | |
| 1540 parseName(ast->template_name, true); | |
| 1541 } | |
| 1542 } | |
| 1543 break; | |
| 1544 | |
| 1545 default: | |
| 1546 return false; | |
| 1547 | |
| 1548 } // end switch | |
| 1549 | |
| 1550 | |
| 1551 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1552 node = ast; | |
| 1553 return true; | |
| 1554 } | |
| 1555 | |
| 1556 bool Parser::parseStorageClassSpecifier(const ListNode<std::size_t> *&node) | |
| 1557 { | |
| 1558 std::size_t start = token_stream.cursor(); | |
| 1559 | |
| 1560 int tk; | |
| 1561 while (0 != (tk = token_stream.lookAhead()) | |
| 1562 && (tk == Token_friend || tk == Token_auto | |
| 1563 || tk == Token_register || tk == Token_static | |
| 1564 || tk == Token_extern || tk == Token_mutable)) | |
| 1565 { | |
| 1566 node = snoc(node, token_stream.cursor(), _M_pool); | |
| 1567 token_stream.nextToken(); | |
| 1568 } | |
| 1569 | |
| 1570 return start != token_stream.cursor(); | |
| 1571 } | |
| 1572 | |
| 1573 bool Parser::parseFunctionSpecifier(const ListNode<std::size_t> *&node) | |
| 1574 { | |
| 1575 std::size_t start = token_stream.cursor(); | |
| 1576 | |
| 1577 int tk; | |
| 1578 while (0 != (tk = token_stream.lookAhead()) | |
| 1579 && (tk == Token_inline || tk == Token_virtual | |
| 1580 || tk == Token_explicit || tk == Token_Q_INVOKABLE)) | |
| 1581 { | |
| 1582 node = snoc(node, token_stream.cursor(), _M_pool); | |
| 1583 token_stream.nextToken(); | |
| 1584 } | |
| 1585 | |
| 1586 return start != token_stream.cursor(); | |
| 1587 } | |
| 1588 | |
| 1589 bool Parser::parseTypeId(TypeIdAST *&node) | |
| 1590 { | |
| 1591 /// @todo implement the AST for typeId | |
| 1592 std::size_t start = token_stream.cursor(); | |
| 1593 | |
| 1594 TypeSpecifierAST *spec = 0; | |
| 1595 if (!parseTypeSpecifier(spec)) | |
| 1596 { | |
| 1597 token_stream.rewind((int) start); | |
| 1598 return false; | |
| 1599 } | |
| 1600 | |
| 1601 DeclaratorAST *decl = 0; | |
| 1602 parseAbstractDeclarator(decl); | |
| 1603 | |
| 1604 TypeIdAST *ast = CreateNode<TypeIdAST>(_M_pool); | |
| 1605 ast->type_specifier = spec; | |
| 1606 ast->declarator = decl; | |
| 1607 | |
| 1608 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1609 node = ast; | |
| 1610 | |
| 1611 return true; | |
| 1612 } | |
| 1613 | |
| 1614 bool Parser::parseInitDeclaratorList(const ListNode<InitDeclaratorAST*> *&node) | |
| 1615 { | |
| 1616 InitDeclaratorAST *decl = 0; | |
| 1617 if (!parseInitDeclarator(decl)) | |
| 1618 return false; | |
| 1619 | |
| 1620 node = snoc(node, decl, _M_pool); | |
| 1621 | |
| 1622 while (token_stream.lookAhead() == ',') | |
| 1623 { | |
| 1624 token_stream.nextToken(); | |
| 1625 | |
| 1626 if (!parseInitDeclarator(decl)) | |
| 1627 { | |
| 1628 syntaxError(); | |
| 1629 break; | |
| 1630 } | |
| 1631 node = snoc(node, decl, _M_pool); | |
| 1632 } | |
| 1633 | |
| 1634 return true; | |
| 1635 } | |
| 1636 | |
| 1637 bool Parser::parseParameterDeclarationClause(ParameterDeclarationClauseAST *&node) | |
| 1638 { | |
| 1639 std::size_t start = token_stream.cursor(); | |
| 1640 | |
| 1641 ParameterDeclarationClauseAST *ast | |
| 1642 = CreateNode<ParameterDeclarationClauseAST>(_M_pool); | |
| 1643 | |
| 1644 if (!parseParameterDeclarationList(ast->parameter_declarations)) | |
| 1645 { | |
| 1646 if (token_stream.lookAhead() == ')') | |
| 1647 goto good; | |
| 1648 | |
| 1649 if (token_stream.lookAhead() == Token_ellipsis | |
| 1650 && token_stream.lookAhead(1) == ')') | |
| 1651 { | |
| 1652 ast->ellipsis = token_stream.cursor(); | |
| 1653 goto good; | |
| 1654 } | |
| 1655 | |
| 1656 return false; | |
| 1657 } | |
| 1658 | |
| 1659 good: | |
| 1660 | |
| 1661 if (token_stream.lookAhead() == Token_ellipsis) | |
| 1662 { | |
| 1663 ast->ellipsis = token_stream.cursor(); | |
| 1664 token_stream.nextToken(); | |
| 1665 } | |
| 1666 | |
| 1667 /// @todo add ellipsis | |
| 1668 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1669 node = ast; | |
| 1670 | |
| 1671 return true; | |
| 1672 } | |
| 1673 | |
| 1674 bool Parser::parseParameterDeclarationList(const ListNode<ParameterDeclarationAST*> *&node) | |
| 1675 { | |
| 1676 std::size_t start = token_stream.cursor(); | |
| 1677 | |
| 1678 ParameterDeclarationAST *param = 0; | |
| 1679 if (!parseParameterDeclaration(param)) | |
| 1680 { | |
| 1681 token_stream.rewind((int) start); | |
| 1682 return false; | |
| 1683 } | |
| 1684 | |
| 1685 node = snoc(node, param, _M_pool); | |
| 1686 | |
| 1687 while (token_stream.lookAhead() == ',') | |
| 1688 { | |
| 1689 token_stream.nextToken(); | |
| 1690 | |
| 1691 if (token_stream.lookAhead() == Token_ellipsis) | |
| 1692 break; | |
| 1693 | |
| 1694 if (!parseParameterDeclaration(param)) | |
| 1695 { | |
| 1696 token_stream.rewind((int) start); | |
| 1697 return false; | |
| 1698 } | |
| 1699 node = snoc(node, param, _M_pool); | |
| 1700 } | |
| 1701 | |
| 1702 return true; | |
| 1703 } | |
| 1704 | |
| 1705 bool Parser::parseParameterDeclaration(ParameterDeclarationAST *&node) | |
| 1706 { | |
| 1707 std::size_t start = token_stream.cursor(); | |
| 1708 | |
| 1709 const ListNode<std::size_t> *storage = 0; | |
| 1710 parseStorageClassSpecifier(storage); | |
| 1711 | |
| 1712 // parse decl spec | |
| 1713 TypeSpecifierAST *spec = 0; | |
| 1714 if (!parseTypeSpecifier(spec)) | |
| 1715 { | |
| 1716 token_stream.rewind((int) start); | |
| 1717 return false; | |
| 1718 } | |
| 1719 | |
| 1720 int index = (int) token_stream.cursor(); | |
| 1721 | |
| 1722 DeclaratorAST *decl = 0; | |
| 1723 if (!parseDeclarator(decl)) | |
| 1724 { | |
| 1725 token_stream.rewind((int) index); | |
| 1726 | |
| 1727 // try with abstract declarator | |
| 1728 parseAbstractDeclarator(decl); | |
| 1729 } | |
| 1730 | |
| 1731 ExpressionAST *expr = 0; | |
| 1732 if (token_stream.lookAhead() == '=') | |
| 1733 { | |
| 1734 token_stream.nextToken(); | |
| 1735 if (!parseLogicalOrExpression(expr,true)) | |
| 1736 { | |
| 1737 //reportError(("Expression expected")); | |
| 1738 } | |
| 1739 } | |
| 1740 | |
| 1741 ParameterDeclarationAST *ast = CreateNode<ParameterDeclarationAST>(_M_pool); | |
| 1742 ast->type_specifier = spec; | |
| 1743 ast->declarator = decl; | |
| 1744 ast->expression = expr; | |
| 1745 | |
| 1746 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1747 node = ast; | |
| 1748 | |
| 1749 return true; | |
| 1750 } | |
| 1751 | |
| 1752 bool Parser::parse_Attribute__() { | |
| 1753 token_stream.nextToken(); | |
| 1754 | |
| 1755 ADVANCE('(', "("); | |
| 1756 | |
| 1757 ExpressionAST *expr = 0; | |
| 1758 parseExpression(expr); | |
| 1759 | |
| 1760 if (token_stream.lookAhead() != ')') | |
| 1761 { | |
| 1762 reportError(("')' expected")); | |
| 1763 return false; | |
| 1764 } | |
| 1765 else | |
| 1766 { | |
| 1767 token_stream.nextToken(); | |
| 1768 } | |
| 1769 return true; | |
| 1770 } | |
| 1771 | |
| 1772 QString Parser::tokenText(AST *ast) const | |
| 1773 { | |
| 1774 if (ast == 0) return QString(); | |
| 1775 | |
| 1776 int start_token = ast->start_token; | |
| 1777 int end_token = ast->end_token; | |
| 1778 | |
| 1779 Token const &tk = token_stream.token (start_token); | |
| 1780 Token const &end_tk = token_stream.token(end_token); | |
| 1781 | |
| 1782 return QString::fromLatin1 (&tk.text[tk.position],(int) (end_tk.position - tk.position)).trimmed(); | |
| 1783 } | |
| 1784 | |
| 1785 bool Parser::parseForwardDeclarationSpecifier(TypeSpecifierAST *&node) | |
| 1786 { | |
| 1787 std::size_t start = token_stream.cursor(); | |
| 1788 | |
| 1789 int kind = token_stream.lookAhead(); | |
| 1790 if (kind != Token_class && kind != Token_struct && kind != Token_union) | |
| 1791 return false; | |
| 1792 | |
| 1793 std::size_t class_key = token_stream.cursor(); | |
| 1794 token_stream.nextToken(); | |
| 1795 | |
| 1796 NameAST *name = 0; | |
| 1797 if (!parseName(name, false)) { | |
| 1798 token_stream.rewind((int) start); | |
| 1799 return false; | |
| 1800 } | |
| 1801 | |
| 1802 BaseClauseAST *bases = 0; | |
| 1803 if (token_stream.lookAhead() == ':') | |
| 1804 { | |
| 1805 if (!parseBaseClause(bases)) | |
| 1806 { | |
| 1807 token_stream.rewind((int) start); | |
| 1808 return false; | |
| 1809 } | |
| 1810 } | |
| 1811 | |
| 1812 if (token_stream.lookAhead() != ';') | |
| 1813 { | |
| 1814 token_stream.rewind((int) start); | |
| 1815 return false; | |
| 1816 } | |
| 1817 | |
| 1818 ForwardDeclarationSpecifierAST *ast = CreateNode<ForwardDeclarationSpecifierAST>(_M_pool); | |
| 1819 ast->class_key = class_key; | |
| 1820 ast->name = name; | |
| 1821 ast->base_clause = bases; | |
| 1822 | |
| 1823 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1824 node = ast; | |
| 1825 | |
| 1826 return true; | |
| 1827 } | |
| 1828 | |
| 1829 bool Parser::parseClassSpecifier(TypeSpecifierAST *&node) | |
| 1830 { | |
| 1831 std::size_t start = token_stream.cursor(); | |
| 1832 | |
| 1833 int kind = token_stream.lookAhead(); | |
| 1834 if (kind != Token_class && kind != Token_struct && kind != Token_union) | |
| 1835 return false; | |
| 1836 | |
| 1837 std::size_t class_key = token_stream.cursor(); | |
| 1838 token_stream.nextToken(); | |
| 1839 | |
| 1840 WinDeclSpecAST *winDeclSpec = 0; | |
| 1841 parseWinDeclSpec(winDeclSpec); | |
| 1842 | |
| 1843 if (token_stream.lookAhead() == Token___attribute__) { | |
| 1844 parse_Attribute__(); | |
| 1845 } | |
| 1846 | |
| 1847 while (token_stream.lookAhead() == Token_identifier | |
| 1848 && token_stream.lookAhead(1) == Token_identifier) | |
| 1849 { | |
| 1850 token_stream.nextToken(); | |
| 1851 } | |
| 1852 | |
| 1853 NameAST *name = 0; | |
| 1854 parseName(name, true); | |
| 1855 | |
| 1856 BaseClauseAST *bases = 0; | |
| 1857 | |
| 1858 if (token_stream.lookAhead() == ':') | |
| 1859 { | |
| 1860 if (!parseBaseClause(bases)) | |
| 1861 { | |
| 1862 skipUntil('{'); | |
| 1863 } | |
| 1864 } | |
| 1865 | |
| 1866 if (token_stream.lookAhead() != '{') | |
| 1867 { | |
| 1868 | |
| 1869 token_stream.rewind((int) start); | |
| 1870 return false; | |
| 1871 } | |
| 1872 | |
| 1873 ADVANCE('{', "{"); | |
| 1874 | |
| 1875 ClassSpecifierAST *ast = CreateNode<ClassSpecifierAST>(_M_pool); | |
| 1876 ast->win_decl_specifiers = winDeclSpec; | |
| 1877 ast->class_key = class_key; | |
| 1878 ast->name = name; | |
| 1879 ast->base_clause = bases; | |
| 1880 | |
| 1881 while (token_stream.lookAhead()) | |
| 1882 { | |
| 1883 if (token_stream.lookAhead() == '}') | |
| 1884 break; | |
| 1885 | |
| 1886 std::size_t startDecl = token_stream.cursor(); | |
| 1887 | |
| 1888 DeclarationAST *memSpec = 0; | |
| 1889 if (!parseMemberSpecification(memSpec)) | |
| 1890 { | |
| 1891 if (startDecl == token_stream.cursor()) | |
| 1892 token_stream.nextToken(); // skip at least one token | |
| 1893 skipUntilDeclaration(); | |
| 1894 } | |
| 1895 else | |
| 1896 ast->member_specs = snoc(ast->member_specs, memSpec, _M_pool); | |
| 1897 } | |
| 1898 | |
| 1899 ADVANCE_NR('}', "}"); | |
| 1900 | |
| 1901 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1902 node = ast; | |
| 1903 | |
| 1904 return true; | |
| 1905 } | |
| 1906 | |
| 1907 bool Parser::parseAccessSpecifier(DeclarationAST *&node) | |
| 1908 { | |
| 1909 std::size_t start = token_stream.cursor(); | |
| 1910 | |
| 1911 const ListNode<std::size_t> *specs = 0; | |
| 1912 | |
| 1913 bool done = false; | |
| 1914 while (!done) | |
| 1915 { | |
| 1916 switch(token_stream.lookAhead()) | |
| 1917 { | |
| 1918 case Token_signals: | |
| 1919 case Token_slots: | |
| 1920 case Token_k_dcop: | |
| 1921 case Token_k_dcop_signals: | |
| 1922 case Token_public: | |
| 1923 case Token_protected: | |
| 1924 case Token_private: | |
| 1925 specs = snoc(specs, token_stream.cursor(), _M_pool); | |
| 1926 token_stream.nextToken(); | |
| 1927 break; | |
| 1928 | |
| 1929 default: | |
| 1930 done = true; | |
| 1931 break; | |
| 1932 } | |
| 1933 } | |
| 1934 | |
| 1935 if (!specs) | |
| 1936 return false; | |
| 1937 | |
| 1938 ADVANCE(':', ":"); | |
| 1939 | |
| 1940 AccessSpecifierAST *ast = CreateNode<AccessSpecifierAST>(_M_pool); | |
| 1941 ast->specs = specs; | |
| 1942 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 1943 node = ast; | |
| 1944 | |
| 1945 return true; | |
| 1946 } | |
| 1947 | |
| 1948 bool Parser::parseMemberSpecification(DeclarationAST *&node) | |
| 1949 { | |
| 1950 std::size_t start = token_stream.cursor(); | |
| 1951 | |
| 1952 if (token_stream.lookAhead() == ';') | |
| 1953 { | |
| 1954 token_stream.nextToken(); | |
| 1955 return true; | |
| 1956 } | |
| 1957 else if (token_stream.lookAhead() == Token_Q_OBJECT || token_stream.lookAhead() == Token_K_DCOP) | |
| 1958 { | |
| 1959 token_stream.nextToken(); | |
| 1960 return true; | |
| 1961 } | |
| 1962 else if (parseTypedef(node)) | |
| 1963 { | |
| 1964 return true; | |
| 1965 } | |
| 1966 else if (parseUsing(node)) | |
| 1967 { | |
| 1968 return true; | |
| 1969 } | |
| 1970 else if (parseTemplateDeclaration(node)) | |
| 1971 { | |
| 1972 return true; | |
| 1973 } | |
| 1974 else if (parseAccessSpecifier(node)) | |
| 1975 { | |
| 1976 return true; | |
| 1977 } | |
| 1978 else if (parseQ_PROPERTY(node)) | |
| 1979 { | |
| 1980 return true; | |
| 1981 } | |
| 1982 else if (parseQ_ENUMS(node)) | |
| 1983 { | |
| 1984 return true; | |
| 1985 } | |
| 1986 | |
| 1987 token_stream.rewind((int) start); | |
| 1988 | |
| 1989 const ListNode<std::size_t> *cv = 0; | |
| 1990 parseCvQualify(cv); | |
| 1991 | |
| 1992 const ListNode<std::size_t> *storageSpec = 0; | |
| 1993 parseStorageClassSpecifier(storageSpec); | |
| 1994 | |
| 1995 parseCvQualify(cv); | |
| 1996 | |
| 1997 TypeSpecifierAST *spec = 0; | |
| 1998 if (parseEnumSpecifier(spec) || parseClassSpecifier(spec)) | |
| 1999 { | |
| 2000 parseCvQualify(cv); | |
| 2001 spec->cv = cv; | |
| 2002 | |
| 2003 const ListNode<InitDeclaratorAST*> *declarators = 0; | |
| 2004 parseInitDeclaratorList(declarators); | |
| 2005 ADVANCE(';', ";"); | |
| 2006 | |
| 2007 SimpleDeclarationAST *ast = CreateNode<SimpleDeclarationAST>(_M_pool); | |
| 2008 ast->type_specifier = spec; | |
| 2009 ast->init_declarators = declarators; | |
| 2010 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2011 node = ast; | |
| 2012 | |
| 2013 return true; | |
| 2014 } | |
| 2015 | |
| 2016 token_stream.rewind((int) start); | |
| 2017 return parseDeclarationInternal(node); | |
| 2018 } | |
| 2019 | |
| 2020 bool Parser::parseCtorInitializer(CtorInitializerAST *&node) | |
| 2021 { | |
| 2022 std::size_t start = token_stream.cursor(); | |
| 2023 | |
| 2024 CHECK(':'); | |
| 2025 | |
| 2026 CtorInitializerAST *ast = CreateNode<CtorInitializerAST>(_M_pool); | |
| 2027 ast->colon = start; | |
| 2028 | |
| 2029 if (!parseMemInitializerList(ast->member_initializers)) | |
| 2030 { | |
| 2031 reportError(("Member initializers expected")); | |
| 2032 } | |
| 2033 | |
| 2034 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2035 node = ast; | |
| 2036 | |
| 2037 return true; | |
| 2038 } | |
| 2039 | |
| 2040 bool Parser::parseElaboratedTypeSpecifier(TypeSpecifierAST *&node) | |
| 2041 { | |
| 2042 std::size_t start = token_stream.cursor(); | |
| 2043 | |
| 2044 int tk = token_stream.lookAhead(); | |
| 2045 if (tk == Token_class || | |
| 2046 tk == Token_struct || | |
| 2047 tk == Token_union || | |
| 2048 tk == Token_enum || | |
| 2049 tk == Token_typename) | |
| 2050 { | |
| 2051 std::size_t type = token_stream.cursor(); | |
| 2052 token_stream.nextToken(); | |
| 2053 | |
| 2054 NameAST *name = 0; | |
| 2055 if (parseName(name, true)) | |
| 2056 { | |
| 2057 ElaboratedTypeSpecifierAST *ast | |
| 2058 = CreateNode<ElaboratedTypeSpecifierAST>(_M_pool); | |
| 2059 | |
| 2060 ast->type = type; | |
| 2061 ast->name = name; | |
| 2062 | |
| 2063 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2064 node = ast; | |
| 2065 | |
| 2066 return true; | |
| 2067 } | |
| 2068 } | |
| 2069 | |
| 2070 token_stream.rewind((int) start); | |
| 2071 return false; | |
| 2072 } | |
| 2073 | |
| 2074 bool Parser::parseExceptionSpecification(ExceptionSpecificationAST *&node) | |
| 2075 { | |
| 2076 std::size_t start = token_stream.cursor(); | |
| 2077 | |
| 2078 CHECK(Token_throw); | |
| 2079 ADVANCE('(', "("); | |
| 2080 | |
| 2081 ExceptionSpecificationAST *ast | |
| 2082 = CreateNode<ExceptionSpecificationAST>(_M_pool); | |
| 2083 | |
| 2084 if (token_stream.lookAhead() == Token_ellipsis) | |
| 2085 { | |
| 2086 ast->ellipsis = token_stream.cursor(); | |
| 2087 token_stream.nextToken(); | |
| 2088 } | |
| 2089 else | |
| 2090 { | |
| 2091 parseTypeIdList(ast->type_ids); | |
| 2092 } | |
| 2093 | |
| 2094 ADVANCE(')', ")"); | |
| 2095 | |
| 2096 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2097 node = ast; | |
| 2098 | |
| 2099 return true; | |
| 2100 } | |
| 2101 | |
| 2102 bool Parser::parseEnumerator(EnumeratorAST *&node) | |
| 2103 { | |
| 2104 std::size_t start = token_stream.cursor(); | |
| 2105 | |
| 2106 CHECK(Token_identifier); | |
| 2107 std::size_t id = token_stream.cursor() - 1; | |
| 2108 | |
| 2109 EnumeratorAST *ast = CreateNode<EnumeratorAST>(_M_pool); | |
| 2110 ast->id = id; | |
| 2111 | |
| 2112 if (token_stream.lookAhead() == '=') | |
| 2113 { | |
| 2114 token_stream.nextToken(); | |
| 2115 | |
| 2116 if (!parseConstantExpression(ast->expression)) | |
| 2117 { | |
| 2118 reportError(("Constant expression expected")); | |
| 2119 } | |
| 2120 } | |
| 2121 | |
| 2122 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2123 node = ast; | |
| 2124 | |
| 2125 return true; | |
| 2126 } | |
| 2127 | |
| 2128 bool Parser::parseInitDeclarator(InitDeclaratorAST *&node) | |
| 2129 { | |
| 2130 std::size_t start = token_stream.cursor(); | |
| 2131 | |
| 2132 DeclaratorAST *decl = 0; | |
| 2133 if (!parseDeclarator(decl)) | |
| 2134 { | |
| 2135 return false; | |
| 2136 } | |
| 2137 | |
| 2138 if (token_stream.lookAhead(0) == Token_asm) | |
| 2139 { | |
| 2140 token_stream.nextToken(); | |
| 2141 skip('(', ')'); | |
| 2142 token_stream.nextToken(); | |
| 2143 } | |
| 2144 | |
| 2145 InitializerAST *init = 0; | |
| 2146 parseInitializer(init); | |
| 2147 | |
| 2148 InitDeclaratorAST *ast = CreateNode<InitDeclaratorAST>(_M_pool); | |
| 2149 ast->declarator = decl; | |
| 2150 ast->initializer = init; | |
| 2151 | |
| 2152 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2153 node = ast; | |
| 2154 | |
| 2155 return true; | |
| 2156 } | |
| 2157 | |
| 2158 bool Parser::parseBaseClause(BaseClauseAST *&node) | |
| 2159 { | |
| 2160 std::size_t start = token_stream.cursor(); | |
| 2161 | |
| 2162 CHECK(':'); | |
| 2163 | |
| 2164 BaseSpecifierAST *baseSpec = 0; | |
| 2165 if (!parseBaseSpecifier(baseSpec)) | |
| 2166 return false; | |
| 2167 | |
| 2168 BaseClauseAST *ast = CreateNode<BaseClauseAST>(_M_pool); | |
| 2169 ast->base_specifiers = snoc(ast->base_specifiers, baseSpec, _M_pool); | |
| 2170 | |
| 2171 while (token_stream.lookAhead() == ',') | |
| 2172 { | |
| 2173 token_stream.nextToken(); | |
| 2174 | |
| 2175 if (!parseBaseSpecifier(baseSpec)) | |
| 2176 { | |
| 2177 reportError(("Base class specifier expected")); | |
| 2178 break; | |
| 2179 } | |
| 2180 ast->base_specifiers = snoc(ast->base_specifiers, baseSpec, _M_pool); | |
| 2181 } | |
| 2182 | |
| 2183 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2184 node = ast; | |
| 2185 | |
| 2186 return true; | |
| 2187 } | |
| 2188 | |
| 2189 bool Parser::parseInitializer(InitializerAST *&node) | |
| 2190 { | |
| 2191 std::size_t start = token_stream.cursor(); | |
| 2192 | |
| 2193 int tk = token_stream.lookAhead(); | |
| 2194 if (tk != '=' && tk != '(') | |
| 2195 return false; | |
| 2196 | |
| 2197 InitializerAST *ast = CreateNode<InitializerAST>(_M_pool); | |
| 2198 | |
| 2199 if (tk == '=') | |
| 2200 { | |
| 2201 token_stream.nextToken(); | |
| 2202 | |
| 2203 if (!parseInitializerClause(ast->initializer_clause)) | |
| 2204 { | |
| 2205 reportError(("Initializer clause expected")); | |
| 2206 } | |
| 2207 } | |
| 2208 else if (tk == '(') | |
| 2209 { | |
| 2210 token_stream.nextToken(); | |
| 2211 parseCommaExpression(ast->expression); | |
| 2212 CHECK(')'); | |
| 2213 } | |
| 2214 | |
| 2215 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2216 node = ast; | |
| 2217 | |
| 2218 return true; | |
| 2219 } | |
| 2220 | |
| 2221 bool Parser::parseMemInitializerList(const ListNode<MemInitializerAST*> *&node) | |
| 2222 { | |
| 2223 MemInitializerAST *init = 0; | |
| 2224 | |
| 2225 if (!parseMemInitializer(init)) | |
| 2226 return false; | |
| 2227 | |
| 2228 node = snoc(node, init, _M_pool); | |
| 2229 | |
| 2230 while (token_stream.lookAhead() == ',') | |
| 2231 { | |
| 2232 token_stream.nextToken(); | |
| 2233 | |
| 2234 if (!parseMemInitializer(init)) | |
| 2235 break; | |
| 2236 | |
| 2237 node = snoc(node, init, _M_pool); | |
| 2238 } | |
| 2239 | |
| 2240 return true; | |
| 2241 } | |
| 2242 | |
| 2243 bool Parser::parseMemInitializer(MemInitializerAST *&node) | |
| 2244 { | |
| 2245 std::size_t start = token_stream.cursor(); | |
| 2246 | |
| 2247 NameAST *initId = 0; | |
| 2248 if (!parseName(initId, true)) | |
| 2249 { | |
| 2250 reportError(("Identifier expected")); | |
| 2251 return false; | |
| 2252 } | |
| 2253 | |
| 2254 ADVANCE('(', "("); | |
| 2255 ExpressionAST *expr = 0; | |
| 2256 parseCommaExpression(expr); | |
| 2257 ADVANCE(')', ")"); | |
| 2258 | |
| 2259 MemInitializerAST *ast = CreateNode<MemInitializerAST>(_M_pool); | |
| 2260 ast->initializer_id = initId; | |
| 2261 ast->expression = expr; | |
| 2262 | |
| 2263 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2264 node = ast; | |
| 2265 | |
| 2266 return true; | |
| 2267 } | |
| 2268 | |
| 2269 bool Parser::parseTypeIdList(const ListNode<TypeIdAST*> *&node) | |
| 2270 { | |
| 2271 TypeIdAST *typeId = 0; | |
| 2272 if (!parseTypeId(typeId)) | |
| 2273 return false; | |
| 2274 | |
| 2275 node = snoc(node, typeId, _M_pool); | |
| 2276 | |
| 2277 while (token_stream.lookAhead() == ',') | |
| 2278 { | |
| 2279 token_stream.nextToken(); | |
| 2280 if (parseTypeId(typeId)) | |
| 2281 { | |
| 2282 node = snoc(node, typeId, _M_pool); | |
| 2283 } | |
| 2284 else | |
| 2285 { | |
| 2286 reportError(("Type id expected")); | |
| 2287 break; | |
| 2288 } | |
| 2289 } | |
| 2290 | |
| 2291 return true; | |
| 2292 } | |
| 2293 | |
| 2294 bool Parser::parseBaseSpecifier(BaseSpecifierAST *&node) | |
| 2295 { | |
| 2296 std::size_t start = token_stream.cursor(); | |
| 2297 | |
| 2298 BaseSpecifierAST *ast = CreateNode<BaseSpecifierAST>(_M_pool); | |
| 2299 | |
| 2300 if (token_stream.lookAhead() == Token_virtual) | |
| 2301 { | |
| 2302 ast->virt = token_stream.cursor(); | |
| 2303 token_stream.nextToken(); | |
| 2304 | |
| 2305 int tk = token_stream.lookAhead(); | |
| 2306 if (tk == Token_public || tk == Token_protected | |
| 2307 || tk == Token_private) | |
| 2308 { | |
| 2309 ast->access_specifier = token_stream.cursor(); | |
| 2310 token_stream.nextToken(); | |
| 2311 } | |
| 2312 } | |
| 2313 else | |
| 2314 { | |
| 2315 int tk = token_stream.lookAhead(); | |
| 2316 if (tk == Token_public || tk == Token_protected | |
| 2317 || tk == Token_private) | |
| 2318 { | |
| 2319 ast->access_specifier = token_stream.cursor(); | |
| 2320 token_stream.nextToken(); | |
| 2321 } | |
| 2322 | |
| 2323 if (token_stream.lookAhead() == Token_virtual) | |
| 2324 { | |
| 2325 ast->virt = token_stream.cursor(); | |
| 2326 token_stream.nextToken(); | |
| 2327 } | |
| 2328 } | |
| 2329 | |
| 2330 if (!parseName(ast->name, true)) | |
| 2331 reportError(("Class name expected")); | |
| 2332 | |
| 2333 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2334 node = ast; | |
| 2335 | |
| 2336 return true; | |
| 2337 } | |
| 2338 | |
| 2339 bool Parser::parseInitializerClause(InitializerClauseAST *&node) | |
| 2340 { | |
| 2341 std::size_t start = token_stream.cursor(); | |
| 2342 | |
| 2343 InitializerClauseAST *ast = CreateNode<InitializerClauseAST>(_M_pool); | |
| 2344 | |
| 2345 if (token_stream.lookAhead() == '{') | |
| 2346 { | |
| 2347 #if defined(__GNUC__) | |
| 2348 #warning "implement me" | |
| 2349 #endif | |
| 2350 if (skip('{','}')) | |
| 2351 token_stream.nextToken(); | |
| 2352 else | |
| 2353 reportError(("} missing")); | |
| 2354 } | |
| 2355 else | |
| 2356 { | |
| 2357 if (!parseAssignmentExpression(ast->expression)) | |
| 2358 { | |
| 2359 //reportError(("Expression expected")); | |
| 2360 } | |
| 2361 } | |
| 2362 | |
| 2363 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2364 node = ast; | |
| 2365 | |
| 2366 return true; | |
| 2367 } | |
| 2368 | |
| 2369 bool Parser::parsePtrToMember(PtrToMemberAST *&node) | |
| 2370 { | |
| 2371 #if defined(__GNUC__) | |
| 2372 #warning "implemente me (AST)" | |
| 2373 #endif | |
| 2374 | |
| 2375 std::size_t start = token_stream.cursor(); | |
| 2376 | |
| 2377 std::size_t global_scope = 0; | |
| 2378 if (token_stream.lookAhead() == Token_scope) | |
| 2379 { | |
| 2380 global_scope = token_stream.cursor(); | |
| 2381 token_stream.nextToken(); | |
| 2382 } | |
| 2383 | |
| 2384 UnqualifiedNameAST *name = 0; | |
| 2385 while (token_stream.lookAhead() == Token_identifier) | |
| 2386 { | |
| 2387 if (!parseUnqualifiedName(name)) | |
| 2388 break; | |
| 2389 | |
| 2390 if (token_stream.lookAhead() == Token_scope | |
| 2391 && token_stream.lookAhead(1) == '*') | |
| 2392 { | |
| 2393 token_stream.nextToken(); | |
| 2394 token_stream.nextToken(); | |
| 2395 | |
| 2396 PtrToMemberAST *ast = CreateNode<PtrToMemberAST>(_M_pool); | |
| 2397 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2398 node = ast; | |
| 2399 | |
| 2400 return true; | |
| 2401 } | |
| 2402 | |
| 2403 if (token_stream.lookAhead() == Token_scope) | |
| 2404 token_stream.nextToken(); | |
| 2405 } | |
| 2406 | |
| 2407 token_stream.rewind((int) start); | |
| 2408 return false; | |
| 2409 } | |
| 2410 | |
| 2411 bool Parser::parseUnqualifiedName(UnqualifiedNameAST *&node, | |
| 2412 bool parseTemplateId) | |
| 2413 { | |
| 2414 std::size_t start = token_stream.cursor(); | |
| 2415 | |
| 2416 std::size_t tilde = 0; | |
| 2417 std::size_t id = 0; | |
| 2418 OperatorFunctionIdAST *operator_id = 0; | |
| 2419 | |
| 2420 if (token_stream.lookAhead() == Token_identifier) | |
| 2421 { | |
| 2422 id = token_stream.cursor(); | |
| 2423 token_stream.nextToken(); | |
| 2424 } | |
| 2425 else if (token_stream.lookAhead() == '~' | |
| 2426 && token_stream.lookAhead(1) == Token_identifier) | |
| 2427 { | |
| 2428 tilde = token_stream.cursor(); | |
| 2429 token_stream.nextToken(); // skip ~ | |
| 2430 | |
| 2431 id = token_stream.cursor(); | |
| 2432 token_stream.nextToken(); // skip classname | |
| 2433 } | |
| 2434 else if (token_stream.lookAhead() == Token_operator) | |
| 2435 { | |
| 2436 if (!parseOperatorFunctionId(operator_id)) | |
| 2437 return false; | |
| 2438 } | |
| 2439 else | |
| 2440 { | |
| 2441 return false; | |
| 2442 } | |
| 2443 | |
| 2444 UnqualifiedNameAST *ast = CreateNode<UnqualifiedNameAST>(_M_pool); | |
| 2445 ast->tilde = tilde; | |
| 2446 ast->id = id; | |
| 2447 ast->operator_id = operator_id; | |
| 2448 | |
| 2449 if (parseTemplateId && !tilde) | |
| 2450 { | |
| 2451 std::size_t index = token_stream.cursor(); | |
| 2452 | |
| 2453 if (token_stream.lookAhead() == '<') | |
| 2454 { | |
| 2455 token_stream.nextToken(); | |
| 2456 | |
| 2457 // optional template arguments | |
| 2458 parseTemplateArgumentList(ast->template_arguments); | |
| 2459 | |
| 2460 if (token_stream.lookAhead() == '>') | |
| 2461 { | |
| 2462 token_stream.nextToken(); | |
| 2463 } | |
| 2464 else | |
| 2465 { | |
| 2466 ast->template_arguments = 0; | |
| 2467 token_stream.rewind((int) index); | |
| 2468 } | |
| 2469 } | |
| 2470 } | |
| 2471 | |
| 2472 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2473 node = ast; | |
| 2474 | |
| 2475 return true; | |
| 2476 } | |
| 2477 | |
| 2478 bool Parser::parseStringLiteral(StringLiteralAST *&node) | |
| 2479 { | |
| 2480 std::size_t start = token_stream.cursor(); | |
| 2481 | |
| 2482 if (token_stream.lookAhead() != Token_string_literal) | |
| 2483 return false; | |
| 2484 | |
| 2485 StringLiteralAST *ast = CreateNode<StringLiteralAST>(_M_pool); | |
| 2486 | |
| 2487 while (token_stream.lookAhead() == Token_string_literal) | |
| 2488 { | |
| 2489 ast->literals = snoc(ast->literals, token_stream.cursor(), _M_pool); | |
| 2490 token_stream.nextToken(); | |
| 2491 } | |
| 2492 | |
| 2493 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2494 node = ast; | |
| 2495 | |
| 2496 return true; | |
| 2497 } | |
| 2498 | |
| 2499 bool Parser::parseExpressionStatement(StatementAST *&node) | |
| 2500 { | |
| 2501 std::size_t start = token_stream.cursor(); | |
| 2502 | |
| 2503 ExpressionAST *expr = 0; | |
| 2504 parseCommaExpression(expr); | |
| 2505 | |
| 2506 ADVANCE(';', ";"); | |
| 2507 | |
| 2508 ExpressionStatementAST *ast = CreateNode<ExpressionStatementAST>(_M_pool); | |
| 2509 ast->expression = expr; | |
| 2510 | |
| 2511 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2512 node = ast; | |
| 2513 | |
| 2514 return true; | |
| 2515 } | |
| 2516 | |
| 2517 bool Parser::parseStatement(StatementAST *&node) | |
| 2518 { | |
| 2519 std::size_t start = token_stream.cursor(); | |
| 2520 | |
| 2521 switch(token_stream.lookAhead()) | |
| 2522 { | |
| 2523 case Token_while: | |
| 2524 return parseWhileStatement(node); | |
| 2525 | |
| 2526 case Token_do: | |
| 2527 return parseDoStatement(node); | |
| 2528 | |
| 2529 case Token_for: | |
| 2530 return parseForStatement(node); | |
| 2531 | |
| 2532 case Token_if: | |
| 2533 return parseIfStatement(node); | |
| 2534 | |
| 2535 case Token_switch: | |
| 2536 return parseSwitchStatement(node); | |
| 2537 | |
| 2538 case Token_try: | |
| 2539 return parseTryBlockStatement(node); | |
| 2540 | |
| 2541 case Token_case: | |
| 2542 case Token_default: | |
| 2543 return parseLabeledStatement(node); | |
| 2544 | |
| 2545 case Token_break: | |
| 2546 case Token_continue: | |
| 2547 #if defined(__GNUC__) | |
| 2548 #warning "implement me" | |
| 2549 #endif | |
| 2550 token_stream.nextToken(); | |
| 2551 ADVANCE(';', ";"); | |
| 2552 return true; | |
| 2553 | |
| 2554 case Token_goto: | |
| 2555 #if defined(__GNUC__) | |
| 2556 #warning "implement me" | |
| 2557 #endif | |
| 2558 token_stream.nextToken(); | |
| 2559 ADVANCE(Token_identifier, "identifier"); | |
| 2560 ADVANCE(';', ";"); | |
| 2561 return true; | |
| 2562 | |
| 2563 case Token_return: | |
| 2564 { | |
| 2565 token_stream.nextToken(); | |
| 2566 ExpressionAST *expr = 0; | |
| 2567 parseCommaExpression(expr); | |
| 2568 | |
| 2569 ADVANCE(';', ";"); | |
| 2570 | |
| 2571 ReturnStatementAST *ast = CreateNode<ReturnStatementAST>(_M_pool); | |
| 2572 ast->expression = expr; | |
| 2573 | |
| 2574 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2575 node = ast; | |
| 2576 } | |
| 2577 return true; | |
| 2578 | |
| 2579 case '{': | |
| 2580 return parseCompoundStatement(node); | |
| 2581 | |
| 2582 case Token_identifier: | |
| 2583 if (parseLabeledStatement(node)) | |
| 2584 return true; | |
| 2585 break; | |
| 2586 } | |
| 2587 | |
| 2588 return parseExpressionOrDeclarationStatement(node); | |
| 2589 } | |
| 2590 | |
| 2591 bool Parser::parseExpressionOrDeclarationStatement(StatementAST *&node) | |
| 2592 { | |
| 2593 bool blocked = block_errors(true); | |
| 2594 | |
| 2595 std::size_t start = token_stream.cursor(); | |
| 2596 | |
| 2597 StatementAST *decl_ast = 0; | |
| 2598 bool maybe_amb = parseDeclarationStatement(decl_ast); | |
| 2599 maybe_amb &= token_stream.kind(token_stream.cursor() - 1) == ';'; | |
| 2600 | |
| 2601 std::size_t end = token_stream.cursor(); | |
| 2602 | |
| 2603 token_stream.rewind((int) start); | |
| 2604 StatementAST *expr_ast = 0; | |
| 2605 maybe_amb &= parseExpressionStatement(expr_ast); | |
| 2606 maybe_amb &= token_stream.kind(token_stream.cursor() - 1) == ';'; | |
| 2607 | |
| 2608 if (maybe_amb) | |
| 2609 { | |
| 2610 Q_ASSERT(decl_ast != 0 && expr_ast != 0); | |
| 2611 ExpressionOrDeclarationStatementAST *ast | |
| 2612 = CreateNode<ExpressionOrDeclarationStatementAST>(_M_pool); | |
| 2613 ast->declaration = decl_ast; | |
| 2614 ast->expression = expr_ast; | |
| 2615 | |
| 2616 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2617 node = ast; | |
| 2618 } | |
| 2619 else | |
| 2620 { | |
| 2621 token_stream.rewind((int) std::max(end, token_stream.cursor())); | |
| 2622 | |
| 2623 node = decl_ast; | |
| 2624 if (!node) | |
| 2625 node = expr_ast; | |
| 2626 } | |
| 2627 | |
| 2628 block_errors(blocked); | |
| 2629 | |
| 2630 if (!node) | |
| 2631 syntaxError(); | |
| 2632 | |
| 2633 return node != 0; | |
| 2634 } | |
| 2635 | |
| 2636 bool Parser::parseCondition(ConditionAST *&node, bool initRequired) | |
| 2637 { | |
| 2638 std::size_t start = token_stream.cursor(); | |
| 2639 | |
| 2640 ConditionAST *ast = CreateNode<ConditionAST>(_M_pool); | |
| 2641 TypeSpecifierAST *spec = 0; | |
| 2642 | |
| 2643 if (parseTypeSpecifier(spec)) | |
| 2644 { | |
| 2645 ast->type_specifier = spec; | |
| 2646 | |
| 2647 std::size_t declarator_start = token_stream.cursor(); | |
| 2648 | |
| 2649 DeclaratorAST *decl = 0; | |
| 2650 if (!parseDeclarator(decl)) | |
| 2651 { | |
| 2652 token_stream.rewind((int) declarator_start); | |
| 2653 if (!initRequired && !parseAbstractDeclarator(decl)) | |
| 2654 decl = 0; | |
| 2655 } | |
| 2656 | |
| 2657 if (decl && (!initRequired || token_stream.lookAhead() == '=')) | |
| 2658 { | |
| 2659 ast->declarator = decl; | |
| 2660 | |
| 2661 if (token_stream.lookAhead() == '=') | |
| 2662 { | |
| 2663 token_stream.nextToken(); | |
| 2664 | |
| 2665 parseExpression(ast->expression); | |
| 2666 } | |
| 2667 | |
| 2668 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2669 node = ast; | |
| 2670 | |
| 2671 return true; | |
| 2672 } | |
| 2673 } | |
| 2674 | |
| 2675 token_stream.rewind((int) start); | |
| 2676 | |
| 2677 if (!parseCommaExpression(ast->expression)) | |
| 2678 return false; | |
| 2679 | |
| 2680 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2681 node = ast; | |
| 2682 | |
| 2683 return true; | |
| 2684 } | |
| 2685 | |
| 2686 | |
| 2687 bool Parser::parseWhileStatement(StatementAST *&node) | |
| 2688 { | |
| 2689 std::size_t start = token_stream.cursor(); | |
| 2690 | |
| 2691 ADVANCE(Token_while, "while"); | |
| 2692 ADVANCE('(' , "("); | |
| 2693 | |
| 2694 ConditionAST *cond = 0; | |
| 2695 if (!parseCondition(cond)) | |
| 2696 { | |
| 2697 reportError(("condition expected")); | |
| 2698 return false; | |
| 2699 } | |
| 2700 ADVANCE(')', ")"); | |
| 2701 | |
| 2702 StatementAST *body = 0; | |
| 2703 if (!parseStatement(body)) | |
| 2704 { | |
| 2705 reportError(("statement expected")); | |
| 2706 return false; | |
| 2707 } | |
| 2708 | |
| 2709 WhileStatementAST *ast = CreateNode<WhileStatementAST>(_M_pool); | |
| 2710 ast->condition = cond; | |
| 2711 ast->statement = body; | |
| 2712 | |
| 2713 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2714 node = ast; | |
| 2715 | |
| 2716 return true; | |
| 2717 } | |
| 2718 | |
| 2719 bool Parser::parseDoStatement(StatementAST *&node) | |
| 2720 { | |
| 2721 std::size_t start = token_stream.cursor(); | |
| 2722 | |
| 2723 ADVANCE(Token_do, "do"); | |
| 2724 | |
| 2725 StatementAST *body = 0; | |
| 2726 if (!parseStatement(body)) | |
| 2727 { | |
| 2728 reportError(("statement expected")); | |
| 2729 //return false; | |
| 2730 } | |
| 2731 | |
| 2732 ADVANCE_NR(Token_while, "while"); | |
| 2733 ADVANCE_NR('(' , "("); | |
| 2734 | |
| 2735 ExpressionAST *expr = 0; | |
| 2736 if (!parseCommaExpression(expr)) | |
| 2737 { | |
| 2738 reportError(("expression expected")); | |
| 2739 //return false; | |
| 2740 } | |
| 2741 | |
| 2742 ADVANCE_NR(')', ")"); | |
| 2743 ADVANCE_NR(';', ";"); | |
| 2744 | |
| 2745 DoStatementAST *ast = CreateNode<DoStatementAST>(_M_pool); | |
| 2746 ast->statement = body; | |
| 2747 ast->expression = expr; | |
| 2748 | |
| 2749 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2750 node = ast; | |
| 2751 | |
| 2752 return true; | |
| 2753 } | |
| 2754 | |
| 2755 bool Parser::parseForStatement(StatementAST *&node) | |
| 2756 { | |
| 2757 std::size_t start = token_stream.cursor(); | |
| 2758 | |
| 2759 ADVANCE(Token_for, "for"); | |
| 2760 ADVANCE('(', "("); | |
| 2761 | |
| 2762 StatementAST *init = 0; | |
| 2763 if (!parseForInitStatement(init)) | |
| 2764 { | |
| 2765 reportError(("for initialization expected")); | |
| 2766 return false; | |
| 2767 } | |
| 2768 | |
| 2769 ConditionAST *cond = 0; | |
| 2770 parseCondition(cond); | |
| 2771 ADVANCE(';', ";"); | |
| 2772 | |
| 2773 ExpressionAST *expr = 0; | |
| 2774 parseCommaExpression(expr); | |
| 2775 ADVANCE(')', ")"); | |
| 2776 | |
| 2777 StatementAST *body = 0; | |
| 2778 if (!parseStatement(body)) | |
| 2779 return false; | |
| 2780 | |
| 2781 ForStatementAST *ast = CreateNode<ForStatementAST>(_M_pool); | |
| 2782 ast->init_statement = init; | |
| 2783 ast->condition = cond; | |
| 2784 ast->expression = expr; | |
| 2785 ast->statement = body; | |
| 2786 | |
| 2787 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2788 node = ast; | |
| 2789 | |
| 2790 return true; | |
| 2791 } | |
| 2792 | |
| 2793 bool Parser::parseForInitStatement(StatementAST *&node) | |
| 2794 { | |
| 2795 if (parseDeclarationStatement(node)) | |
| 2796 return true; | |
| 2797 | |
| 2798 return parseExpressionStatement(node); | |
| 2799 } | |
| 2800 | |
| 2801 bool Parser::parseCompoundStatement(StatementAST *&node) | |
| 2802 { | |
| 2803 std::size_t start = token_stream.cursor(); | |
| 2804 | |
| 2805 CHECK('{'); | |
| 2806 | |
| 2807 CompoundStatementAST *ast = CreateNode<CompoundStatementAST>(_M_pool); | |
| 2808 | |
| 2809 while (token_stream.lookAhead()) | |
| 2810 { | |
| 2811 if (token_stream.lookAhead() == '}') | |
| 2812 break; | |
| 2813 | |
| 2814 std::size_t startStmt = token_stream.cursor(); | |
| 2815 | |
| 2816 StatementAST *stmt = 0; | |
| 2817 if (!parseStatement(stmt)) | |
| 2818 { | |
| 2819 if (startStmt == token_stream.cursor()) | |
| 2820 token_stream.nextToken(); | |
| 2821 | |
| 2822 skipUntilStatement(); | |
| 2823 } | |
| 2824 else | |
| 2825 { | |
| 2826 ast->statements = snoc(ast->statements, stmt, _M_pool); | |
| 2827 } | |
| 2828 } | |
| 2829 | |
| 2830 ADVANCE_NR('}', "}"); | |
| 2831 | |
| 2832 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2833 node = ast; | |
| 2834 | |
| 2835 return true; | |
| 2836 } | |
| 2837 | |
| 2838 bool Parser::parseIfStatement(StatementAST *&node) | |
| 2839 { | |
| 2840 std::size_t start = token_stream.cursor(); | |
| 2841 | |
| 2842 ADVANCE(Token_if, "if"); | |
| 2843 | |
| 2844 ADVANCE('(' , "("); | |
| 2845 | |
| 2846 IfStatementAST *ast = CreateNode<IfStatementAST>(_M_pool); | |
| 2847 | |
| 2848 ConditionAST *cond = 0; | |
| 2849 if (!parseCondition(cond)) | |
| 2850 { | |
| 2851 reportError(("condition expected")); | |
| 2852 return false; | |
| 2853 } | |
| 2854 ADVANCE(')', ")"); | |
| 2855 | |
| 2856 StatementAST *stmt = 0; | |
| 2857 if (!parseStatement(stmt)) | |
| 2858 { | |
| 2859 reportError(("statement expected")); | |
| 2860 return false; | |
| 2861 } | |
| 2862 | |
| 2863 ast->condition = cond; | |
| 2864 ast->statement = stmt; | |
| 2865 | |
| 2866 if (token_stream.lookAhead() == Token_else) | |
| 2867 { | |
| 2868 token_stream.nextToken(); | |
| 2869 | |
| 2870 if (!parseStatement(ast->else_statement)) | |
| 2871 { | |
| 2872 reportError(("statement expected")); | |
| 2873 return false; | |
| 2874 } | |
| 2875 } | |
| 2876 | |
| 2877 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2878 node = ast; | |
| 2879 | |
| 2880 return true; | |
| 2881 } | |
| 2882 | |
| 2883 bool Parser::parseSwitchStatement(StatementAST *&node) | |
| 2884 { | |
| 2885 std::size_t start = token_stream.cursor(); | |
| 2886 ADVANCE(Token_switch, "switch"); | |
| 2887 | |
| 2888 ADVANCE('(' , "("); | |
| 2889 | |
| 2890 ConditionAST *cond = 0; | |
| 2891 if (!parseCondition(cond)) | |
| 2892 { | |
| 2893 reportError(("condition expected")); | |
| 2894 return false; | |
| 2895 } | |
| 2896 ADVANCE(')', ")"); | |
| 2897 | |
| 2898 StatementAST *stmt = 0; | |
| 2899 if (!parseCompoundStatement(stmt)) | |
| 2900 { | |
| 2901 syntaxError(); | |
| 2902 return false; | |
| 2903 } | |
| 2904 | |
| 2905 SwitchStatementAST *ast = CreateNode<SwitchStatementAST>(_M_pool); | |
| 2906 ast->condition = cond; | |
| 2907 ast->statement = stmt; | |
| 2908 | |
| 2909 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 2910 node = ast; | |
| 2911 | |
| 2912 return true; | |
| 2913 } | |
| 2914 | |
| 2915 bool Parser::parseLabeledStatement(StatementAST *&node) | |
| 2916 { | |
| 2917 switch(token_stream.lookAhead()) | |
| 2918 { | |
| 2919 case Token_identifier: | |
| 2920 case Token_default: | |
| 2921 if (token_stream.lookAhead(1) == ':') | |
| 2922 { | |
| 2923 token_stream.nextToken(); | |
| 2924 token_stream.nextToken(); | |
| 2925 | |
| 2926 StatementAST *stmt = 0; | |
| 2927 if (parseStatement(stmt)) | |
| 2928 { | |
| 2929 node = stmt; | |
| 2930 return true; | |
| 2931 } | |
| 2932 } | |
| 2933 break; | |
| 2934 | |
| 2935 case Token_case: | |
| 2936 { | |
| 2937 token_stream.nextToken(); | |
| 2938 ExpressionAST *expr = 0; | |
| 2939 if (!parseConstantExpression(expr)) | |
| 2940 { | |
| 2941 reportError(("expression expected")); | |
| 2942 } | |
| 2943 else if (token_stream.lookAhead() == Token_ellipsis) | |
| 2944 { | |
| 2945 token_stream.nextToken(); | |
| 2946 | |
| 2947 ExpressionAST *expr2 = 0; | |
| 2948 if (!parseConstantExpression(expr2)) | |
| 2949 { | |
| 2950 reportError(("expression expected")); | |
| 2951 } | |
| 2952 } | |
| 2953 ADVANCE(':', ":"); | |
| 2954 | |
| 2955 StatementAST *stmt = 0; | |
| 2956 if (parseStatement(stmt)) | |
| 2957 { | |
| 2958 node = stmt; | |
| 2959 return true; | |
| 2960 } | |
| 2961 } | |
| 2962 break; | |
| 2963 | |
| 2964 } | |
| 2965 | |
| 2966 return false; | |
| 2967 } | |
| 2968 | |
| 2969 bool Parser::parseBlockDeclaration(DeclarationAST *&node) | |
| 2970 { | |
| 2971 switch(token_stream.lookAhead()) | |
| 2972 { | |
| 2973 case Token_typedef: | |
| 2974 return parseTypedef(node); | |
| 2975 case Token_using: | |
| 2976 return parseUsing(node); | |
| 2977 case Token_asm: | |
| 2978 return parseAsmDefinition(node); | |
| 2979 case Token_namespace: | |
| 2980 return parseNamespaceAliasDefinition(node); | |
| 2981 } | |
| 2982 | |
| 2983 std::size_t start = token_stream.cursor(); | |
| 2984 | |
| 2985 const ListNode<std::size_t> *cv = 0; | |
| 2986 parseCvQualify(cv); | |
| 2987 | |
| 2988 const ListNode<std::size_t> *storageSpec = 0; | |
| 2989 parseStorageClassSpecifier(storageSpec); | |
| 2990 | |
| 2991 parseCvQualify(cv); | |
| 2992 | |
| 2993 TypeSpecifierAST *spec = 0; | |
| 2994 if (!parseTypeSpecifierOrClassSpec(spec)) | |
| 2995 { // replace with simpleTypeSpecifier?!?! | |
| 2996 token_stream.rewind((int) start); | |
| 2997 return false; | |
| 2998 } | |
| 2999 | |
| 3000 parseCvQualify(cv); | |
| 3001 spec->cv = cv; | |
| 3002 | |
| 3003 const ListNode<InitDeclaratorAST*> *declarators = 0; | |
| 3004 parseInitDeclaratorList(declarators); | |
| 3005 | |
| 3006 if (token_stream.lookAhead() != ';') | |
| 3007 { | |
| 3008 token_stream.rewind((int) start); | |
| 3009 return false; | |
| 3010 } | |
| 3011 token_stream.nextToken(); | |
| 3012 | |
| 3013 SimpleDeclarationAST *ast = CreateNode<SimpleDeclarationAST>(_M_pool); | |
| 3014 ast->type_specifier = spec; | |
| 3015 ast->init_declarators = declarators; | |
| 3016 | |
| 3017 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3018 node = ast; | |
| 3019 | |
| 3020 return true; | |
| 3021 } | |
| 3022 | |
| 3023 bool Parser::parseNamespaceAliasDefinition(DeclarationAST *&node) | |
| 3024 { | |
| 3025 std::size_t start = token_stream.cursor(); | |
| 3026 | |
| 3027 CHECK(Token_namespace); | |
| 3028 | |
| 3029 NamespaceAliasDefinitionAST *ast | |
| 3030 = CreateNode<NamespaceAliasDefinitionAST>(_M_pool); | |
| 3031 | |
| 3032 ADVANCE(Token_identifier, "identifier"); | |
| 3033 ast->namespace_name = token_stream.cursor() - 1; | |
| 3034 | |
| 3035 ADVANCE('=', "="); | |
| 3036 | |
| 3037 if (!parseName(ast->alias_name)) | |
| 3038 { | |
| 3039 reportError(("Namespace name expected")); | |
| 3040 } | |
| 3041 | |
| 3042 ADVANCE(';', ";"); | |
| 3043 | |
| 3044 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3045 node = ast; | |
| 3046 | |
| 3047 return true; | |
| 3048 } | |
| 3049 | |
| 3050 bool Parser::parseDeclarationStatement(StatementAST *&node) | |
| 3051 { | |
| 3052 std::size_t start = token_stream.cursor(); | |
| 3053 | |
| 3054 DeclarationAST *decl = 0; | |
| 3055 if (!parseBlockDeclaration(decl)) | |
| 3056 return false; | |
| 3057 | |
| 3058 DeclarationStatementAST *ast = CreateNode<DeclarationStatementAST>(_M_pool); | |
| 3059 ast->declaration = decl; | |
| 3060 | |
| 3061 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3062 node = ast; | |
| 3063 | |
| 3064 return true; | |
| 3065 } | |
| 3066 | |
| 3067 bool Parser::parseDeclarationInternal(DeclarationAST *&node) | |
| 3068 { | |
| 3069 std::size_t start = token_stream.cursor(); | |
| 3070 | |
| 3071 // that is for the case '__declspec(dllexport) int ...' or | |
| 3072 // '__declspec(dllexport) inline int ...', etc. | |
| 3073 WinDeclSpecAST *winDeclSpec = 0; | |
| 3074 parseWinDeclSpec(winDeclSpec); | |
| 3075 | |
| 3076 const ListNode<std::size_t> *funSpec = 0; | |
| 3077 bool hasFunSpec = parseFunctionSpecifier(funSpec); | |
| 3078 | |
| 3079 const ListNode<std::size_t> *cv = 0; | |
| 3080 parseCvQualify(cv); | |
| 3081 | |
| 3082 const ListNode<std::size_t> *storageSpec = 0; | |
| 3083 bool hasStorageSpec = parseStorageClassSpecifier(storageSpec); | |
| 3084 | |
| 3085 if (hasStorageSpec && !hasFunSpec) | |
| 3086 hasFunSpec = parseFunctionSpecifier(funSpec); | |
| 3087 | |
| 3088 // that is for the case 'friend __declspec(dllexport) ....' | |
| 3089 parseWinDeclSpec(winDeclSpec); | |
| 3090 | |
| 3091 if (!cv) | |
| 3092 parseCvQualify(cv); | |
| 3093 | |
| 3094 int index = (int) token_stream.cursor(); | |
| 3095 NameAST *name = 0; | |
| 3096 if (parseName(name, true) && token_stream.lookAhead() == '(') | |
| 3097 { | |
| 3098 // no type specifier, maybe a constructor or a cast operator?? | |
| 3099 | |
| 3100 token_stream.rewind((int) index); | |
| 3101 | |
| 3102 InitDeclaratorAST *declarator = 0; | |
| 3103 if (parseInitDeclarator(declarator)) | |
| 3104 { | |
| 3105 switch(token_stream.lookAhead()) | |
| 3106 { | |
| 3107 case ';': | |
| 3108 { | |
| 3109 token_stream.nextToken(); | |
| 3110 | |
| 3111 SimpleDeclarationAST *ast | |
| 3112 = CreateNode<SimpleDeclarationAST>(_M_pool); | |
| 3113 | |
| 3114 ast->storage_specifiers = storageSpec; | |
| 3115 ast->function_specifiers = funSpec; | |
| 3116 ast->init_declarators = snoc(ast->init_declarators, | |
| 3117 declarator, _M_pool); | |
| 3118 | |
| 3119 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3120 node = ast; | |
| 3121 } | |
| 3122 return true; | |
| 3123 | |
| 3124 case ':': | |
| 3125 { | |
| 3126 CtorInitializerAST *ctorInit = 0; | |
| 3127 StatementAST *funBody = 0; | |
| 3128 | |
| 3129 if (parseCtorInitializer(ctorInit) | |
| 3130 && parseFunctionBody(funBody)) | |
| 3131 { | |
| 3132 FunctionDefinitionAST *ast | |
| 3133 = CreateNode<FunctionDefinitionAST>(_M_pool); | |
| 3134 | |
| 3135 ast->storage_specifiers = storageSpec; | |
| 3136 ast->function_specifiers = funSpec; | |
| 3137 ast->init_declarator = declarator; | |
| 3138 ast->function_body = funBody; | |
| 3139 | |
| 3140 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3141 node = ast; | |
| 3142 | |
| 3143 return true; | |
| 3144 } | |
| 3145 } | |
| 3146 break; | |
| 3147 | |
| 3148 case '{': | |
| 3149 { | |
| 3150 StatementAST *funBody = 0; | |
| 3151 if (parseFunctionBody(funBody)) | |
| 3152 { | |
| 3153 FunctionDefinitionAST *ast | |
| 3154 = CreateNode<FunctionDefinitionAST>(_M_pool); | |
| 3155 | |
| 3156 ast->storage_specifiers = storageSpec; | |
| 3157 ast->function_specifiers = funSpec; | |
| 3158 ast->init_declarator = declarator; | |
| 3159 ast->function_body = funBody; | |
| 3160 | |
| 3161 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3162 node = ast; | |
| 3163 | |
| 3164 return true; | |
| 3165 } | |
| 3166 } | |
| 3167 break; | |
| 3168 | |
| 3169 case '(': | |
| 3170 case '[': | |
| 3171 // ops!! it seems a declarator | |
| 3172 goto start_decl; | |
| 3173 break; | |
| 3174 } | |
| 3175 | |
| 3176 } | |
| 3177 } | |
| 3178 | |
| 3179 start_decl: | |
| 3180 token_stream.rewind((int) index); | |
| 3181 | |
| 3182 if (token_stream.lookAhead() == Token_const | |
| 3183 && token_stream.lookAhead(1) == Token_identifier | |
| 3184 && token_stream.lookAhead(2) == '=') | |
| 3185 { | |
| 3186 // constant definition | |
| 3187 token_stream.nextToken(); // skip const | |
| 3188 | |
| 3189 const ListNode<InitDeclaratorAST*> *declarators = 0; | |
| 3190 if (!parseInitDeclaratorList(declarators)) | |
| 3191 { | |
| 3192 syntaxError(); | |
| 3193 return false; | |
| 3194 } | |
| 3195 | |
| 3196 ADVANCE(';', ";"); | |
| 3197 | |
| 3198 #if defined(__GNUC__) | |
| 3199 #warning "mark the ast as constant" | |
| 3200 #endif | |
| 3201 SimpleDeclarationAST *ast = CreateNode<SimpleDeclarationAST>(_M_pool); | |
| 3202 ast->init_declarators = declarators; | |
| 3203 | |
| 3204 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3205 node = ast; | |
| 3206 | |
| 3207 return true; | |
| 3208 } | |
| 3209 | |
| 3210 TypeSpecifierAST *spec = 0; | |
| 3211 if (parseTypeSpecifier(spec)) | |
| 3212 { | |
| 3213 Q_ASSERT(spec != 0); | |
| 3214 | |
| 3215 if (!hasFunSpec) | |
| 3216 parseFunctionSpecifier(funSpec); // e.g. "void inline" | |
| 3217 | |
| 3218 spec->cv = cv; | |
| 3219 | |
| 3220 const ListNode<InitDeclaratorAST*> *declarators = 0; | |
| 3221 InitDeclaratorAST *decl = 0; | |
| 3222 int startDeclarator = (int) token_stream.cursor(); | |
| 3223 bool maybeFunctionDefinition = false; | |
| 3224 | |
| 3225 if (token_stream.lookAhead() != ';') | |
| 3226 { | |
| 3227 if (parseInitDeclarator(decl) && token_stream.lookAhead() == '{') | |
| 3228 { | |
| 3229 // function definition | |
| 3230 maybeFunctionDefinition = true; | |
| 3231 } | |
| 3232 else | |
| 3233 { | |
| 3234 token_stream.rewind((int) startDeclarator); | |
| 3235 if (!parseInitDeclaratorList(declarators)) | |
| 3236 { | |
| 3237 syntaxError(); | |
| 3238 return false; | |
| 3239 } | |
| 3240 } | |
| 3241 } | |
| 3242 | |
| 3243 switch(token_stream.lookAhead()) | |
| 3244 { | |
| 3245 case ';': | |
| 3246 { | |
| 3247 token_stream.nextToken(); | |
| 3248 SimpleDeclarationAST *ast | |
| 3249 = CreateNode<SimpleDeclarationAST>(_M_pool); | |
| 3250 | |
| 3251 ast->storage_specifiers = storageSpec; | |
| 3252 ast->function_specifiers = funSpec; | |
| 3253 ast->type_specifier = spec; | |
| 3254 ast->win_decl_specifiers = winDeclSpec; | |
| 3255 ast->init_declarators = declarators; | |
| 3256 | |
| 3257 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3258 node = ast; | |
| 3259 } | |
| 3260 return true; | |
| 3261 | |
| 3262 case '{': | |
| 3263 { | |
| 3264 if (!maybeFunctionDefinition) | |
| 3265 { | |
| 3266 syntaxError(); | |
| 3267 return false; | |
| 3268 } | |
| 3269 | |
| 3270 StatementAST *funBody = 0; | |
| 3271 if (parseFunctionBody(funBody)) | |
| 3272 { | |
| 3273 FunctionDefinitionAST *ast | |
| 3274 = CreateNode<FunctionDefinitionAST>(_M_pool); | |
| 3275 | |
| 3276 ast->win_decl_specifiers = winDeclSpec; | |
| 3277 ast->storage_specifiers = storageSpec; | |
| 3278 ast->function_specifiers = funSpec; | |
| 3279 ast->type_specifier = spec; | |
| 3280 ast->init_declarator = decl; | |
| 3281 ast->function_body = funBody; | |
| 3282 | |
| 3283 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3284 node = ast; | |
| 3285 | |
| 3286 return true; | |
| 3287 } | |
| 3288 } | |
| 3289 break; | |
| 3290 } // end switch | |
| 3291 } | |
| 3292 | |
| 3293 syntaxError(); | |
| 3294 return false; | |
| 3295 } | |
| 3296 | |
| 3297 bool Parser::skipFunctionBody(StatementAST *&) | |
| 3298 { | |
| 3299 #if defined(__GNUC__) | |
| 3300 #warning "Parser::skipFunctionBody() -- implement me" | |
| 3301 #endif | |
| 3302 Q_ASSERT(0); // ### not implemented | |
| 3303 return 0; | |
| 3304 } | |
| 3305 | |
| 3306 bool Parser::parseFunctionBody(StatementAST *&node) | |
| 3307 { | |
| 3308 if (control->skipFunctionBody()) | |
| 3309 return skipFunctionBody(node); | |
| 3310 | |
| 3311 return parseCompoundStatement(node); | |
| 3312 } | |
| 3313 | |
| 3314 bool Parser::parseTypeSpecifierOrClassSpec(TypeSpecifierAST *&node) | |
| 3315 { | |
| 3316 if (parseClassSpecifier(node)) | |
| 3317 return true; | |
| 3318 else if (parseEnumSpecifier(node)) | |
| 3319 return true; | |
| 3320 else if (parseTypeSpecifier(node)) | |
| 3321 return true; | |
| 3322 | |
| 3323 return false; | |
| 3324 } | |
| 3325 | |
| 3326 bool Parser::parseTryBlockStatement(StatementAST *&node) | |
| 3327 { | |
| 3328 #if defined(__GNUC__) | |
| 3329 #warning "implement me" | |
| 3330 #endif | |
| 3331 CHECK(Token_try); | |
| 3332 | |
| 3333 StatementAST *stmt = 0; | |
| 3334 if (!parseCompoundStatement(stmt)) | |
| 3335 { | |
| 3336 syntaxError(); | |
| 3337 return false; | |
| 3338 } | |
| 3339 | |
| 3340 if (token_stream.lookAhead() != Token_catch) | |
| 3341 { | |
| 3342 reportError(("catch expected")); | |
| 3343 return false; | |
| 3344 } | |
| 3345 | |
| 3346 while (token_stream.lookAhead() == Token_catch) | |
| 3347 { | |
| 3348 token_stream.nextToken(); | |
| 3349 ADVANCE('(', "("); | |
| 3350 ConditionAST *cond = 0; | |
| 3351 if (token_stream.lookAhead() == Token_ellipsis) | |
| 3352 { | |
| 3353 token_stream.nextToken(); | |
| 3354 } | |
| 3355 else if (!parseCondition(cond, false)) | |
| 3356 { | |
| 3357 reportError(("condition expected")); | |
| 3358 return false; | |
| 3359 } | |
| 3360 ADVANCE(')', ")"); | |
| 3361 | |
| 3362 StatementAST *body = 0; | |
| 3363 if (!parseCompoundStatement(body)) | |
| 3364 { | |
| 3365 syntaxError(); | |
| 3366 return false; | |
| 3367 } | |
| 3368 } | |
| 3369 | |
| 3370 node = stmt; | |
| 3371 return true; | |
| 3372 } | |
| 3373 | |
| 3374 bool Parser::parsePrimaryExpression(ExpressionAST *&node) | |
| 3375 { | |
| 3376 std::size_t start = token_stream.cursor(); | |
| 3377 | |
| 3378 PrimaryExpressionAST *ast = CreateNode<PrimaryExpressionAST>(_M_pool); | |
| 3379 | |
| 3380 switch(token_stream.lookAhead()) | |
| 3381 { | |
| 3382 case Token_string_literal: | |
| 3383 parseStringLiteral(ast->literal); | |
| 3384 break; | |
| 3385 | |
| 3386 case Token_number_literal: | |
| 3387 case Token_char_literal: | |
| 3388 case Token_true: | |
| 3389 case Token_false: | |
| 3390 case Token_this: | |
| 3391 ast->token = token_stream.cursor(); | |
| 3392 token_stream.nextToken(); | |
| 3393 break; | |
| 3394 | |
| 3395 case '(': | |
| 3396 token_stream.nextToken(); | |
| 3397 | |
| 3398 if (token_stream.lookAhead() == '{') | |
| 3399 { | |
| 3400 if (!parseCompoundStatement(ast->expression_statement)) | |
| 3401 return false; | |
| 3402 } | |
| 3403 else | |
| 3404 { | |
| 3405 if (!parseExpression(ast->sub_expression)) | |
| 3406 return false; | |
| 3407 } | |
| 3408 | |
| 3409 CHECK(')'); | |
| 3410 break; | |
| 3411 | |
| 3412 default: | |
| 3413 if (!parseName(ast->name)) | |
| 3414 return false; | |
| 3415 | |
| 3416 break; | |
| 3417 } | |
| 3418 | |
| 3419 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3420 node = ast; | |
| 3421 | |
| 3422 return true; | |
| 3423 } | |
| 3424 | |
| 3425 | |
| 3426 /* | |
| 3427 postfix-expression-internal: | |
| 3428 [ expression ] | |
| 3429 ( expression-list [opt] ) | |
| 3430 (.|->) template [opt] id-expression | |
| 3431 (.|->) pseudo-destructor-name | |
| 3432 ++ | |
| 3433 -- | |
| 3434 */ | |
| 3435 bool Parser::parsePostfixExpressionInternal(ExpressionAST *&node) | |
| 3436 { | |
| 3437 std::size_t start = token_stream.cursor(); | |
| 3438 | |
| 3439 switch (token_stream.lookAhead()) | |
| 3440 { | |
| 3441 case '[': | |
| 3442 { | |
| 3443 token_stream.nextToken(); | |
| 3444 ExpressionAST *expr = 0; | |
| 3445 parseExpression(expr); | |
| 3446 CHECK(']'); | |
| 3447 | |
| 3448 SubscriptExpressionAST *ast | |
| 3449 = CreateNode<SubscriptExpressionAST>(_M_pool); | |
| 3450 | |
| 3451 ast->subscript = expr; | |
| 3452 | |
| 3453 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3454 node = ast; | |
| 3455 } | |
| 3456 return true; | |
| 3457 | |
| 3458 case '(': | |
| 3459 { | |
| 3460 token_stream.nextToken(); | |
| 3461 ExpressionAST *expr = 0; | |
| 3462 parseExpression(expr); | |
| 3463 CHECK(')'); | |
| 3464 | |
| 3465 FunctionCallAST *ast = CreateNode<FunctionCallAST>(_M_pool); | |
| 3466 ast->arguments = expr; | |
| 3467 | |
| 3468 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3469 node = ast; | |
| 3470 } | |
| 3471 return true; | |
| 3472 | |
| 3473 case '.': | |
| 3474 case Token_arrow: | |
| 3475 { | |
| 3476 std::size_t op = token_stream.cursor(); | |
| 3477 token_stream.nextToken(); | |
| 3478 | |
| 3479 std::size_t templ = 0; | |
| 3480 if (token_stream.lookAhead() == Token_template) | |
| 3481 { | |
| 3482 templ = token_stream.cursor(); | |
| 3483 token_stream.nextToken(); | |
| 3484 } | |
| 3485 | |
| 3486 int saved = int(token_stream.cursor()); | |
| 3487 NameAST *name = 0; | |
| 3488 | |
| 3489 if (parseName(name, true) && name->unqualified_name | |
| 3490 && name->unqualified_name->template_arguments != 0 | |
| 3491 && token_stream.lookAhead() == '(') { | |
| 3492 // a template method call | |
| 3493 // ### reverse the logic | |
| 3494 } else { | |
| 3495 token_stream.rewind(saved); | |
| 3496 name = 0; | |
| 3497 | |
| 3498 if (! parseName (name, templ != 0)) | |
| 3499 return false; | |
| 3500 } | |
| 3501 | |
| 3502 ClassMemberAccessAST *ast = CreateNode<ClassMemberAccessAST>(_M_pool); | |
| 3503 ast->op = op; | |
| 3504 ast->name = name; | |
| 3505 | |
| 3506 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3507 node = ast; | |
| 3508 } | |
| 3509 return true; | |
| 3510 | |
| 3511 case Token_incr: | |
| 3512 case Token_decr: | |
| 3513 { | |
| 3514 std::size_t op = token_stream.cursor(); | |
| 3515 token_stream.nextToken(); | |
| 3516 | |
| 3517 IncrDecrExpressionAST *ast = CreateNode<IncrDecrExpressionAST>(_M_pool); | |
| 3518 ast->op = op; | |
| 3519 | |
| 3520 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3521 node = ast; | |
| 3522 } | |
| 3523 return true; | |
| 3524 | |
| 3525 default: | |
| 3526 return false; | |
| 3527 } | |
| 3528 } | |
| 3529 | |
| 3530 /* | |
| 3531 postfix-expression: | |
| 3532 simple-type-specifier ( expression-list [opt] ) | |
| 3533 primary-expression postfix-expression-internal* | |
| 3534 */ | |
| 3535 bool Parser::parsePostfixExpression(ExpressionAST *&node) | |
| 3536 { | |
| 3537 std::size_t start = token_stream.cursor(); | |
| 3538 | |
| 3539 switch (token_stream.lookAhead()) | |
| 3540 { | |
| 3541 case Token_dynamic_cast: | |
| 3542 case Token_static_cast: | |
| 3543 case Token_reinterpret_cast: | |
| 3544 case Token_const_cast: | |
| 3545 { | |
| 3546 std::size_t castOp = token_stream.cursor(); | |
| 3547 token_stream.nextToken(); | |
| 3548 | |
| 3549 CHECK('<'); | |
| 3550 TypeIdAST *typeId = 0; | |
| 3551 parseTypeId(typeId); | |
| 3552 CHECK('>'); | |
| 3553 | |
| 3554 CHECK('('); | |
| 3555 ExpressionAST *expr = 0; | |
| 3556 parseCommaExpression(expr); | |
| 3557 CHECK(')'); | |
| 3558 | |
| 3559 CppCastExpressionAST *ast = CreateNode<CppCastExpressionAST>(_M_pool); | |
| 3560 ast->op = castOp; | |
| 3561 ast->type_id = typeId; | |
| 3562 ast->expression = expr; | |
| 3563 | |
| 3564 ExpressionAST *e = 0; | |
| 3565 while (parsePostfixExpressionInternal(e)) | |
| 3566 { | |
| 3567 ast->sub_expressions = snoc(ast->sub_expressions, e, _M_pool); | |
| 3568 } | |
| 3569 | |
| 3570 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3571 node = ast; | |
| 3572 } | |
| 3573 return true; | |
| 3574 | |
| 3575 case Token_typename: | |
| 3576 { | |
| 3577 std::size_t token = token_stream.cursor(); | |
| 3578 token_stream.nextToken(); | |
| 3579 | |
| 3580 NameAST* name = 0; | |
| 3581 if (!parseName(name, true)) | |
| 3582 return false; | |
| 3583 | |
| 3584 CHECK('('); | |
| 3585 ExpressionAST *expr = 0; | |
| 3586 parseCommaExpression(expr); | |
| 3587 CHECK(')'); | |
| 3588 | |
| 3589 TypeIdentificationAST *ast = CreateNode<TypeIdentificationAST>(_M_pool); | |
| 3590 ast->typename_token = token; | |
| 3591 ast->name = name; | |
| 3592 ast->expression = expr; | |
| 3593 | |
| 3594 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3595 node = ast; | |
| 3596 } | |
| 3597 return true; | |
| 3598 | |
| 3599 case Token_typeid: | |
| 3600 { | |
| 3601 token_stream.nextToken(); | |
| 3602 | |
| 3603 CHECK('('); | |
| 3604 TypeIdAST *typeId = 0; | |
| 3605 parseTypeId(typeId); | |
| 3606 CHECK(')'); | |
| 3607 | |
| 3608 TypeIdentificationAST *ast = CreateNode<TypeIdentificationAST>(_M_pool); | |
| 3609 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3610 node = ast; | |
| 3611 } | |
| 3612 return true; | |
| 3613 | |
| 3614 default: | |
| 3615 break; | |
| 3616 } | |
| 3617 | |
| 3618 std::size_t saved_pos = token_stream.cursor(); | |
| 3619 | |
| 3620 TypeSpecifierAST *typeSpec = 0; | |
| 3621 ExpressionAST *expr = 0; | |
| 3622 | |
| 3623 // let's try to parse a type | |
| 3624 NameAST *name = 0; | |
| 3625 if (parseName(name, true)) | |
| 3626 { | |
| 3627 Q_ASSERT(name->unqualified_name != 0); | |
| 3628 | |
| 3629 bool has_template_args | |
| 3630 = name->unqualified_name->template_arguments != 0; | |
| 3631 | |
| 3632 if (has_template_args && token_stream.lookAhead() == '(') | |
| 3633 { | |
| 3634 ExpressionAST *cast_expr = 0; | |
| 3635 if (parseCastExpression(cast_expr) | |
| 3636 && cast_expr->kind == AST::Kind_CastExpression) | |
| 3637 { | |
| 3638 token_stream.rewind((int) saved_pos); | |
| 3639 parsePrimaryExpression(expr); | |
| 3640 goto L_no_rewind; | |
| 3641 } | |
| 3642 } | |
| 3643 } | |
| 3644 | |
| 3645 token_stream.rewind((int) saved_pos); | |
| 3646 | |
| 3647 L_no_rewind: | |
| 3648 if (!expr && parseSimpleTypeSpecifier(typeSpec) | |
| 3649 && token_stream.lookAhead() == '(') | |
| 3650 { | |
| 3651 token_stream.nextToken(); // skip '(' | |
| 3652 parseCommaExpression(expr); | |
| 3653 CHECK(')'); | |
| 3654 } | |
| 3655 else if (expr) | |
| 3656 { | |
| 3657 typeSpec = 0; | |
| 3658 } | |
| 3659 else | |
| 3660 { | |
| 3661 typeSpec = 0; | |
| 3662 token_stream.rewind((int) start); | |
| 3663 | |
| 3664 if (!parsePrimaryExpression(expr)) | |
| 3665 return false; | |
| 3666 } | |
| 3667 | |
| 3668 const ListNode<ExpressionAST*> *sub_expressions = 0; | |
| 3669 ExpressionAST *sub_expression = 0; | |
| 3670 | |
| 3671 while (parsePostfixExpressionInternal(sub_expression)) | |
| 3672 sub_expressions = snoc(sub_expressions, sub_expression, _M_pool); | |
| 3673 | |
| 3674 if (sub_expressions || ! expr || (typeSpec && expr)) | |
| 3675 { | |
| 3676 PostfixExpressionAST *ast = CreateNode<PostfixExpressionAST>(_M_pool); | |
| 3677 ast->type_specifier = typeSpec; | |
| 3678 ast->expression = expr; | |
| 3679 ast->sub_expressions = sub_expressions; | |
| 3680 | |
| 3681 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3682 node = ast; | |
| 3683 } | |
| 3684 else | |
| 3685 node = expr; | |
| 3686 | |
| 3687 return true; | |
| 3688 } | |
| 3689 | |
| 3690 bool Parser::parseUnaryExpression(ExpressionAST *&node) | |
| 3691 { | |
| 3692 std::size_t start = token_stream.cursor(); | |
| 3693 | |
| 3694 switch(token_stream.lookAhead()) | |
| 3695 { | |
| 3696 case Token_incr: | |
| 3697 case Token_decr: | |
| 3698 case '*': | |
| 3699 case '&': | |
| 3700 case '+': | |
| 3701 case '-': | |
| 3702 case '!': | |
| 3703 case '~': | |
| 3704 { | |
| 3705 std::size_t op = token_stream.cursor(); | |
| 3706 token_stream.nextToken(); | |
| 3707 | |
| 3708 ExpressionAST *expr = 0; | |
| 3709 if (!parseCastExpression(expr)) | |
| 3710 return false; | |
| 3711 | |
| 3712 UnaryExpressionAST *ast = CreateNode<UnaryExpressionAST>(_M_pool); | |
| 3713 ast->op = op; | |
| 3714 ast->expression = expr; | |
| 3715 | |
| 3716 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3717 node = ast; | |
| 3718 } | |
| 3719 return true; | |
| 3720 | |
| 3721 case Token_sizeof: | |
| 3722 { | |
| 3723 std::size_t sizeof_token = token_stream.cursor(); | |
| 3724 token_stream.nextToken(); | |
| 3725 | |
| 3726 SizeofExpressionAST *ast = CreateNode<SizeofExpressionAST>(_M_pool); | |
| 3727 ast->sizeof_token = sizeof_token; | |
| 3728 | |
| 3729 std::size_t index = token_stream.cursor(); | |
| 3730 if (token_stream.lookAhead() == '(') | |
| 3731 { | |
| 3732 token_stream.nextToken(); | |
| 3733 if (parseTypeId(ast->type_id) && token_stream.lookAhead() == ')') | |
| 3734 { | |
| 3735 token_stream.nextToken(); // skip ) | |
| 3736 | |
| 3737 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3738 node = ast; | |
| 3739 return true; | |
| 3740 } | |
| 3741 | |
| 3742 ast->type_id = 0; | |
| 3743 token_stream.rewind((int) index); | |
| 3744 } | |
| 3745 | |
| 3746 if (!parseUnaryExpression(ast->expression)) | |
| 3747 return false; | |
| 3748 | |
| 3749 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3750 node = ast; | |
| 3751 return true; | |
| 3752 } | |
| 3753 | |
| 3754 default: | |
| 3755 break; | |
| 3756 } | |
| 3757 | |
| 3758 int token = token_stream.lookAhead(); | |
| 3759 | |
| 3760 if (token == Token_new | |
| 3761 || (token == Token_scope && token_stream.lookAhead(1) == Token_new)) | |
| 3762 return parseNewExpression(node); | |
| 3763 | |
| 3764 if (token == Token_delete | |
| 3765 || (token == Token_scope && token_stream.lookAhead(1) == Token_delete)) | |
| 3766 return parseDeleteExpression(node); | |
| 3767 | |
| 3768 return parsePostfixExpression(node); | |
| 3769 } | |
| 3770 | |
| 3771 bool Parser::parseNewExpression(ExpressionAST *&node) | |
| 3772 { | |
| 3773 std::size_t start = token_stream.cursor(); | |
| 3774 | |
| 3775 NewExpressionAST *ast = CreateNode<NewExpressionAST>(_M_pool); | |
| 3776 | |
| 3777 if (token_stream.lookAhead() == Token_scope | |
| 3778 && token_stream.lookAhead(1) == Token_new) | |
| 3779 { | |
| 3780 ast->scope_token = token_stream.cursor(); | |
| 3781 token_stream.nextToken(); | |
| 3782 } | |
| 3783 | |
| 3784 CHECK(Token_new); | |
| 3785 ast->new_token = token_stream.cursor() - 1; | |
| 3786 | |
| 3787 if (token_stream.lookAhead() == '(') | |
| 3788 { | |
| 3789 token_stream.nextToken(); | |
| 3790 parseCommaExpression(ast->expression); | |
| 3791 CHECK(')'); | |
| 3792 } | |
| 3793 | |
| 3794 if (token_stream.lookAhead() == '(') | |
| 3795 { | |
| 3796 token_stream.nextToken(); | |
| 3797 parseTypeId(ast->type_id); | |
| 3798 CHECK(')'); | |
| 3799 } | |
| 3800 else | |
| 3801 { | |
| 3802 parseNewTypeId(ast->new_type_id); | |
| 3803 } | |
| 3804 | |
| 3805 parseNewInitializer(ast->new_initializer); | |
| 3806 | |
| 3807 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3808 node = ast; | |
| 3809 | |
| 3810 return true; | |
| 3811 } | |
| 3812 | |
| 3813 bool Parser::parseNewTypeId(NewTypeIdAST *&node) | |
| 3814 { | |
| 3815 std::size_t start = token_stream.cursor(); | |
| 3816 | |
| 3817 TypeSpecifierAST *typeSpec = 0; | |
| 3818 if (!parseTypeSpecifier(typeSpec)) | |
| 3819 return false; | |
| 3820 | |
| 3821 NewTypeIdAST *ast = CreateNode<NewTypeIdAST>(_M_pool); | |
| 3822 ast->type_specifier = typeSpec; | |
| 3823 | |
| 3824 parseNewDeclarator(ast->new_declarator); | |
| 3825 | |
| 3826 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3827 node = ast; | |
| 3828 | |
| 3829 return true; | |
| 3830 } | |
| 3831 | |
| 3832 bool Parser::parseNewDeclarator(NewDeclaratorAST *&node) | |
| 3833 { | |
| 3834 std::size_t start = token_stream.cursor(); | |
| 3835 | |
| 3836 NewDeclaratorAST *ast = CreateNode<NewDeclaratorAST>(_M_pool); | |
| 3837 | |
| 3838 PtrOperatorAST *ptrOp = 0; | |
| 3839 if (parsePtrOperator(ptrOp)) | |
| 3840 { | |
| 3841 ast->ptr_op = ptrOp; | |
| 3842 parseNewDeclarator(ast->sub_declarator); | |
| 3843 } | |
| 3844 | |
| 3845 while (token_stream.lookAhead() == '[') | |
| 3846 { | |
| 3847 token_stream.nextToken(); | |
| 3848 ExpressionAST *expr = 0; | |
| 3849 parseExpression(expr); | |
| 3850 ast->expressions = snoc(ast->expressions, expr, _M_pool); | |
| 3851 ADVANCE(']', "]"); | |
| 3852 } | |
| 3853 | |
| 3854 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3855 node = ast; | |
| 3856 | |
| 3857 return true; | |
| 3858 } | |
| 3859 | |
| 3860 bool Parser::parseNewInitializer(NewInitializerAST *&node) | |
| 3861 { | |
| 3862 std::size_t start = token_stream.cursor(); | |
| 3863 | |
| 3864 CHECK('('); | |
| 3865 | |
| 3866 NewInitializerAST *ast = CreateNode<NewInitializerAST>(_M_pool); | |
| 3867 | |
| 3868 parseCommaExpression(ast->expression); | |
| 3869 | |
| 3870 CHECK(')'); | |
| 3871 | |
| 3872 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3873 node = ast; | |
| 3874 | |
| 3875 return true; | |
| 3876 } | |
| 3877 | |
| 3878 bool Parser::parseDeleteExpression(ExpressionAST *&node) | |
| 3879 { | |
| 3880 std::size_t start = token_stream.cursor(); | |
| 3881 | |
| 3882 DeleteExpressionAST *ast = CreateNode<DeleteExpressionAST>(_M_pool); | |
| 3883 | |
| 3884 if (token_stream.lookAhead() == Token_scope | |
| 3885 && token_stream.lookAhead(1) == Token_delete) | |
| 3886 { | |
| 3887 ast->scope_token = token_stream.cursor(); | |
| 3888 token_stream.nextToken(); | |
| 3889 } | |
| 3890 | |
| 3891 CHECK(Token_delete); | |
| 3892 ast->delete_token = token_stream.cursor() - 1; | |
| 3893 | |
| 3894 if (token_stream.lookAhead() == '[') | |
| 3895 { | |
| 3896 ast->lbracket_token = token_stream.cursor(); | |
| 3897 token_stream.nextToken(); | |
| 3898 CHECK(']'); | |
| 3899 ast->rbracket_token = token_stream.cursor() - 1; | |
| 3900 } | |
| 3901 | |
| 3902 if (!parseCastExpression(ast->expression)) | |
| 3903 return false; | |
| 3904 | |
| 3905 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3906 node = ast; | |
| 3907 | |
| 3908 return true; | |
| 3909 } | |
| 3910 | |
| 3911 bool Parser::parseCastExpression(ExpressionAST *&node) | |
| 3912 { | |
| 3913 std::size_t start = token_stream.cursor(); | |
| 3914 | |
| 3915 if (token_stream.lookAhead() == '(') | |
| 3916 { | |
| 3917 token_stream.nextToken(); | |
| 3918 | |
| 3919 CastExpressionAST *ast = CreateNode<CastExpressionAST>(_M_pool); | |
| 3920 | |
| 3921 if (parseTypeId(ast->type_id)) | |
| 3922 { | |
| 3923 if (token_stream.lookAhead() == ')') | |
| 3924 { | |
| 3925 token_stream.nextToken(); | |
| 3926 | |
| 3927 if (parseCastExpression(ast->expression)) | |
| 3928 { | |
| 3929 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3930 node = ast; | |
| 3931 | |
| 3932 return true; | |
| 3933 } | |
| 3934 } | |
| 3935 } | |
| 3936 } | |
| 3937 | |
| 3938 token_stream.rewind((int) start); | |
| 3939 return parseUnaryExpression(node); | |
| 3940 } | |
| 3941 | |
| 3942 bool Parser::parsePmExpression(ExpressionAST *&node) | |
| 3943 { | |
| 3944 std::size_t start = token_stream.cursor(); | |
| 3945 | |
| 3946 if (!parseCastExpression(node) || !node) // ### fixme | |
| 3947 return false; | |
| 3948 | |
| 3949 while (token_stream.lookAhead() == Token_ptrmem) | |
| 3950 { | |
| 3951 std::size_t op = token_stream.cursor(); | |
| 3952 token_stream.nextToken(); | |
| 3953 | |
| 3954 ExpressionAST *rightExpr = 0; | |
| 3955 if (!parseCastExpression(rightExpr)) | |
| 3956 return false; | |
| 3957 | |
| 3958 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 3959 ast->op = op; | |
| 3960 ast->left_expression = node; | |
| 3961 ast->right_expression = rightExpr; | |
| 3962 | |
| 3963 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3964 node = ast; | |
| 3965 } | |
| 3966 | |
| 3967 return true; | |
| 3968 } | |
| 3969 | |
| 3970 bool Parser::parseMultiplicativeExpression(ExpressionAST *&node) | |
| 3971 { | |
| 3972 std::size_t start = token_stream.cursor(); | |
| 3973 | |
| 3974 if (!parsePmExpression(node)) | |
| 3975 return false; | |
| 3976 | |
| 3977 while (token_stream.lookAhead() == '*' | |
| 3978 || token_stream.lookAhead() == '/' | |
| 3979 || token_stream.lookAhead() == '%') | |
| 3980 { | |
| 3981 std::size_t op = token_stream.cursor(); | |
| 3982 token_stream.nextToken(); | |
| 3983 | |
| 3984 ExpressionAST *rightExpr = 0; | |
| 3985 if (!parsePmExpression(rightExpr)) | |
| 3986 return false; | |
| 3987 | |
| 3988 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 3989 ast->op = op; | |
| 3990 ast->left_expression = node; | |
| 3991 ast->right_expression = rightExpr; | |
| 3992 | |
| 3993 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 3994 node = ast; | |
| 3995 } | |
| 3996 | |
| 3997 return true; | |
| 3998 } | |
| 3999 | |
| 4000 | |
| 4001 bool Parser::parseAdditiveExpression(ExpressionAST *&node) | |
| 4002 { | |
| 4003 std::size_t start = token_stream.cursor(); | |
| 4004 | |
| 4005 if (!parseMultiplicativeExpression(node)) | |
| 4006 return false; | |
| 4007 | |
| 4008 while (token_stream.lookAhead() == '+' || token_stream.lookAhead() == '-') | |
| 4009 { | |
| 4010 std::size_t op = token_stream.cursor(); | |
| 4011 token_stream.nextToken(); | |
| 4012 | |
| 4013 ExpressionAST *rightExpr = 0; | |
| 4014 if (!parseMultiplicativeExpression(rightExpr)) | |
| 4015 return false; | |
| 4016 | |
| 4017 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4018 ast->op = op; | |
| 4019 ast->left_expression = node; | |
| 4020 ast->right_expression = rightExpr; | |
| 4021 | |
| 4022 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4023 node = ast; | |
| 4024 } | |
| 4025 | |
| 4026 return true; | |
| 4027 } | |
| 4028 | |
| 4029 bool Parser::parseShiftExpression(ExpressionAST *&node) | |
| 4030 { | |
| 4031 std::size_t start = token_stream.cursor(); | |
| 4032 | |
| 4033 if (!parseAdditiveExpression(node)) | |
| 4034 return false; | |
| 4035 | |
| 4036 while (token_stream.lookAhead() == Token_shift) | |
| 4037 { | |
| 4038 std::size_t op = token_stream.cursor(); | |
| 4039 token_stream.nextToken(); | |
| 4040 | |
| 4041 ExpressionAST *rightExpr = 0; | |
| 4042 if (!parseAdditiveExpression(rightExpr)) | |
| 4043 return false; | |
| 4044 | |
| 4045 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4046 ast->op = op; | |
| 4047 ast->left_expression = node; | |
| 4048 ast->right_expression = rightExpr; | |
| 4049 | |
| 4050 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4051 node = ast; | |
| 4052 } | |
| 4053 | |
| 4054 return true; | |
| 4055 } | |
| 4056 | |
| 4057 bool Parser::parseRelationalExpression(ExpressionAST *&node, bool templArgs) | |
| 4058 { | |
| 4059 std::size_t start = token_stream.cursor(); | |
| 4060 | |
| 4061 if (!parseShiftExpression(node)) | |
| 4062 return false; | |
| 4063 | |
| 4064 while (token_stream.lookAhead() == '<' | |
| 4065 || (token_stream.lookAhead() == '>' && !templArgs) | |
| 4066 || token_stream.lookAhead() == Token_leq | |
| 4067 || token_stream.lookAhead() == Token_geq) | |
| 4068 { | |
| 4069 std::size_t op = token_stream.cursor(); | |
| 4070 token_stream.nextToken(); | |
| 4071 | |
| 4072 ExpressionAST *rightExpr = 0; | |
| 4073 if (!parseShiftExpression(rightExpr)) | |
| 4074 return false; | |
| 4075 | |
| 4076 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4077 ast->op = op; | |
| 4078 ast->left_expression = node; | |
| 4079 ast->right_expression = rightExpr; | |
| 4080 | |
| 4081 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4082 node = ast; | |
| 4083 } | |
| 4084 | |
| 4085 return true; | |
| 4086 } | |
| 4087 | |
| 4088 bool Parser::parseEqualityExpression(ExpressionAST *&node, bool templArgs) | |
| 4089 { | |
| 4090 std::size_t start = token_stream.cursor(); | |
| 4091 | |
| 4092 if (!parseRelationalExpression(node, templArgs)) | |
| 4093 return false; | |
| 4094 | |
| 4095 while (token_stream.lookAhead() == Token_eq | |
| 4096 || token_stream.lookAhead() == Token_not_eq) | |
| 4097 { | |
| 4098 std::size_t op = token_stream.cursor(); | |
| 4099 token_stream.nextToken(); | |
| 4100 | |
| 4101 ExpressionAST *rightExpr = 0; | |
| 4102 if (!parseRelationalExpression(rightExpr, templArgs)) | |
| 4103 return false; | |
| 4104 | |
| 4105 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4106 ast->op = op; | |
| 4107 ast->left_expression = node; | |
| 4108 ast->right_expression = rightExpr; | |
| 4109 | |
| 4110 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4111 node = ast; | |
| 4112 } | |
| 4113 | |
| 4114 return true; | |
| 4115 } | |
| 4116 | |
| 4117 bool Parser::parseAndExpression(ExpressionAST *&node, bool templArgs) | |
| 4118 { | |
| 4119 std::size_t start = token_stream.cursor(); | |
| 4120 | |
| 4121 if (!parseEqualityExpression(node, templArgs)) | |
| 4122 return false; | |
| 4123 | |
| 4124 while (token_stream.lookAhead() == '&') | |
| 4125 { | |
| 4126 std::size_t op = token_stream.cursor(); | |
| 4127 token_stream.nextToken(); | |
| 4128 | |
| 4129 ExpressionAST *rightExpr = 0; | |
| 4130 if (!parseEqualityExpression(rightExpr, templArgs)) | |
| 4131 return false; | |
| 4132 | |
| 4133 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4134 ast->op = op; | |
| 4135 ast->left_expression = node; | |
| 4136 ast->right_expression = rightExpr; | |
| 4137 | |
| 4138 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4139 node = ast; | |
| 4140 } | |
| 4141 | |
| 4142 return true; | |
| 4143 } | |
| 4144 | |
| 4145 bool Parser::parseExclusiveOrExpression(ExpressionAST *&node, bool templArgs) | |
| 4146 { | |
| 4147 std::size_t start = token_stream.cursor(); | |
| 4148 | |
| 4149 if (!parseAndExpression(node, templArgs)) | |
| 4150 return false; | |
| 4151 | |
| 4152 while (token_stream.lookAhead() == '^') | |
| 4153 { | |
| 4154 std::size_t op = token_stream.cursor(); | |
| 4155 token_stream.nextToken(); | |
| 4156 | |
| 4157 ExpressionAST *rightExpr = 0; | |
| 4158 if (!parseAndExpression(rightExpr, templArgs)) | |
| 4159 return false; | |
| 4160 | |
| 4161 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4162 ast->op = op; | |
| 4163 ast->left_expression = node; | |
| 4164 ast->right_expression = rightExpr; | |
| 4165 | |
| 4166 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4167 node = ast; | |
| 4168 } | |
| 4169 | |
| 4170 return true; | |
| 4171 } | |
| 4172 | |
| 4173 bool Parser::parseInclusiveOrExpression(ExpressionAST *&node, bool templArgs) | |
| 4174 { | |
| 4175 std::size_t start = token_stream.cursor(); | |
| 4176 | |
| 4177 if (!parseExclusiveOrExpression(node, templArgs)) | |
| 4178 return false; | |
| 4179 | |
| 4180 while (token_stream.lookAhead() == '|') | |
| 4181 { | |
| 4182 std::size_t op = token_stream.cursor(); | |
| 4183 token_stream.nextToken(); | |
| 4184 | |
| 4185 ExpressionAST *rightExpr = 0; | |
| 4186 if (!parseExclusiveOrExpression(rightExpr, templArgs)) | |
| 4187 return false; | |
| 4188 | |
| 4189 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4190 ast->op = op; | |
| 4191 ast->left_expression = node; | |
| 4192 ast->right_expression = rightExpr; | |
| 4193 | |
| 4194 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4195 node = ast; | |
| 4196 } | |
| 4197 | |
| 4198 return true; | |
| 4199 } | |
| 4200 | |
| 4201 bool Parser::parseLogicalAndExpression(ExpressionAST *&node, bool templArgs) | |
| 4202 { | |
| 4203 std::size_t start = token_stream.cursor(); | |
| 4204 | |
| 4205 if (!parseInclusiveOrExpression(node, templArgs)) | |
| 4206 return false; | |
| 4207 | |
| 4208 while (token_stream.lookAhead() == Token_and) | |
| 4209 { | |
| 4210 std::size_t op = token_stream.cursor(); | |
| 4211 token_stream.nextToken(); | |
| 4212 | |
| 4213 ExpressionAST *rightExpr = 0; | |
| 4214 if (!parseInclusiveOrExpression(rightExpr, templArgs)) | |
| 4215 return false; | |
| 4216 | |
| 4217 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4218 ast->op = op; | |
| 4219 ast->left_expression = node; | |
| 4220 ast->right_expression = rightExpr; | |
| 4221 | |
| 4222 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4223 node = ast; | |
| 4224 } | |
| 4225 | |
| 4226 return true; | |
| 4227 } | |
| 4228 | |
| 4229 bool Parser::parseLogicalOrExpression(ExpressionAST *&node, bool templArgs) | |
| 4230 { | |
| 4231 std::size_t start = token_stream.cursor(); | |
| 4232 | |
| 4233 if (!parseLogicalAndExpression(node, templArgs)) | |
| 4234 return false; | |
| 4235 | |
| 4236 while (token_stream.lookAhead() == Token_or) | |
| 4237 { | |
| 4238 std::size_t op = token_stream.cursor(); | |
| 4239 token_stream.nextToken(); | |
| 4240 | |
| 4241 ExpressionAST *rightExpr = 0; | |
| 4242 if (!parseLogicalAndExpression(rightExpr, templArgs)) | |
| 4243 return false; | |
| 4244 | |
| 4245 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4246 ast->op = op; | |
| 4247 ast->left_expression = node; | |
| 4248 ast->right_expression = rightExpr; | |
| 4249 | |
| 4250 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4251 node = ast; | |
| 4252 } | |
| 4253 | |
| 4254 return true; | |
| 4255 } | |
| 4256 | |
| 4257 bool Parser::parseConditionalExpression(ExpressionAST *&node) | |
| 4258 { | |
| 4259 std::size_t start = token_stream.cursor(); | |
| 4260 | |
| 4261 if (!parseLogicalOrExpression(node)) | |
| 4262 return false; | |
| 4263 | |
| 4264 if (token_stream.lookAhead() == '?') | |
| 4265 { | |
| 4266 token_stream.nextToken(); | |
| 4267 | |
| 4268 ExpressionAST *leftExpr = 0; | |
| 4269 if (!parseExpression(leftExpr)) | |
| 4270 return false; | |
| 4271 | |
| 4272 CHECK(':'); | |
| 4273 | |
| 4274 ExpressionAST *rightExpr = 0; | |
| 4275 if (!parseAssignmentExpression(rightExpr)) | |
| 4276 return false; | |
| 4277 | |
| 4278 ConditionalExpressionAST *ast | |
| 4279 = CreateNode<ConditionalExpressionAST>(_M_pool); | |
| 4280 | |
| 4281 ast->condition = node; | |
| 4282 ast->left_expression = leftExpr; | |
| 4283 ast->right_expression = rightExpr; | |
| 4284 | |
| 4285 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4286 node = ast; | |
| 4287 } | |
| 4288 | |
| 4289 return true; | |
| 4290 } | |
| 4291 | |
| 4292 bool Parser::parseAssignmentExpression(ExpressionAST *&node) | |
| 4293 { | |
| 4294 std::size_t start = token_stream.cursor(); | |
| 4295 | |
| 4296 if (token_stream.lookAhead() == Token_throw && !parseThrowExpression(node)) | |
| 4297 return false; | |
| 4298 else if (!parseConditionalExpression(node)) | |
| 4299 return false; | |
| 4300 | |
| 4301 while (token_stream.lookAhead() == Token_assign | |
| 4302 || token_stream.lookAhead() == '=') | |
| 4303 { | |
| 4304 std::size_t op = token_stream.cursor(); | |
| 4305 token_stream.nextToken(); | |
| 4306 | |
| 4307 ExpressionAST *rightExpr = 0; | |
| 4308 if (!parseConditionalExpression(rightExpr)) | |
| 4309 return false; | |
| 4310 | |
| 4311 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4312 ast->op = op; | |
| 4313 ast->left_expression = node; | |
| 4314 ast->right_expression = rightExpr; | |
| 4315 | |
| 4316 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4317 node = ast; | |
| 4318 } | |
| 4319 | |
| 4320 return true; | |
| 4321 } | |
| 4322 | |
| 4323 bool Parser::parseConstantExpression(ExpressionAST *&node) | |
| 4324 { | |
| 4325 return parseConditionalExpression(node); | |
| 4326 } | |
| 4327 | |
| 4328 bool Parser::parseExpression(ExpressionAST *&node) | |
| 4329 { | |
| 4330 return parseCommaExpression(node); | |
| 4331 } | |
| 4332 | |
| 4333 bool Parser::parseCommaExpression(ExpressionAST *&node) | |
| 4334 { | |
| 4335 std::size_t start = token_stream.cursor(); | |
| 4336 | |
| 4337 if (!parseAssignmentExpression(node)) | |
| 4338 return false; | |
| 4339 | |
| 4340 while (token_stream.lookAhead() == ',') | |
| 4341 { | |
| 4342 std::size_t op = token_stream.cursor(); | |
| 4343 token_stream.nextToken(); | |
| 4344 | |
| 4345 ExpressionAST *rightExpr = 0; | |
| 4346 if (!parseAssignmentExpression(rightExpr)) | |
| 4347 return false; | |
| 4348 | |
| 4349 BinaryExpressionAST *ast = CreateNode<BinaryExpressionAST>(_M_pool); | |
| 4350 ast->op = op; | |
| 4351 ast->left_expression = node; | |
| 4352 ast->right_expression = rightExpr; | |
| 4353 | |
| 4354 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4355 node = ast; | |
| 4356 } | |
| 4357 | |
| 4358 return true; | |
| 4359 } | |
| 4360 | |
| 4361 bool Parser::parseThrowExpression(ExpressionAST *&node) | |
| 4362 { | |
| 4363 std::size_t start = token_stream.cursor(); | |
| 4364 | |
| 4365 CHECK(Token_throw); | |
| 4366 | |
| 4367 ThrowExpressionAST *ast = CreateNode<ThrowExpressionAST>(_M_pool); | |
| 4368 ast->throw_token = token_stream.cursor() - 1; | |
| 4369 | |
| 4370 parseAssignmentExpression(ast->expression); | |
| 4371 | |
| 4372 UPDATE_POS(ast, start, token_stream.cursor()); | |
| 4373 node = ast; | |
| 4374 | |
| 4375 return true; | |
| 4376 } | |
| 4377 | |
| 4378 bool Parser::parseQ_ENUMS(DeclarationAST *&node) | |
| 4379 { | |
| 4380 if (token_stream.lookAhead() != Token_Q_ENUMS) | |
| 4381 return false; | |
| 4382 | |
| 4383 if (token_stream.lookAhead(1) != '(') | |
| 4384 return false; | |
| 4385 | |
| 4386 token_stream.nextToken(); | |
| 4387 token_stream.nextToken(); | |
| 4388 | |
| 4389 int firstToken = token_stream.cursor(); | |
| 4390 while (token_stream.lookAhead() != ')') { | |
| 4391 token_stream.nextToken(); | |
| 4392 } | |
| 4393 QEnumsAST *ast = CreateNode<QEnumsAST>(_M_pool); | |
| 4394 UPDATE_POS(ast, firstToken, token_stream.cursor()); | |
| 4395 node = ast; | |
| 4396 | |
| 4397 token_stream.nextToken(); | |
| 4398 | |
| 4399 return true; | |
| 4400 } | |
| 4401 | |
| 4402 bool Parser::parseQ_PROPERTY(DeclarationAST *&node) | |
| 4403 { | |
| 4404 if (token_stream.lookAhead() != Token_Q_PROPERTY) | |
| 4405 return false; | |
| 4406 | |
| 4407 if (token_stream.lookAhead(1) != '(') | |
| 4408 return false; | |
| 4409 | |
| 4410 token_stream.nextToken(); | |
| 4411 token_stream.nextToken(); | |
| 4412 | |
| 4413 int firstToken = token_stream.cursor(); | |
| 4414 while (token_stream.lookAhead() != ')') { | |
| 4415 token_stream.nextToken(); | |
| 4416 } | |
| 4417 QPropertyAST *ast = CreateNode<QPropertyAST>(_M_pool); | |
| 4418 UPDATE_POS(ast, firstToken, token_stream.cursor()); | |
| 4419 node = ast; | |
| 4420 | |
| 4421 // const Token &t1 = token_stream[firstToken]; | |
| 4422 // const Token &t2 = token_stream[token_stream.cursor()]; | |
| 4423 // printf("property: %s\n", | |
| 4424 // qPrintable(QString::fromLatin1(t1.text + t1.position, t2.position - t1.position))); | |
| 4425 | |
| 4426 token_stream.nextToken(); | |
| 4427 | |
| 4428 return true; | |
| 4429 } | |
| 4430 | |
| 4431 bool Parser::block_errors(bool block) | |
| 4432 { | |
| 4433 bool current = _M_block_errors; | |
| 4434 _M_block_errors = block; | |
| 4435 return current; | |
| 4436 } | |
| 4437 | |
| 4438 | |
| 4439 // kate: space-indent on; indent-width 2; replace-tabs on; |