Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 1 | //===--- ParseExpr.cpp - Expression Parsing -------------------------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by Chris Lattner and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This file implements the Expression parsing implementation. Expressions in |
| 11 | // C99 basically consist of a bunch of binary operators with unary operators and |
| 12 | // other random stuff at the leaves. |
| 13 | // |
| 14 | // In the C99 grammar, these unary operators bind tightest and are represented |
| 15 | // as the 'cast-expression' production. Everything else is either a binary |
| 16 | // operator (e.g. '/') or a ternary operator ("?:"). The unary leaves are |
| 17 | // handled by ParseCastExpression, the higher level pieces are handled by |
| 18 | // ParseBinaryExpression. |
| 19 | // |
| 20 | //===----------------------------------------------------------------------===// |
| 21 | |
| 22 | #include "clang/Parse/Parser.h" |
| 23 | #include "clang/Basic/Diagnostic.h" |
| 24 | #include "llvm/ADT/SmallVector.h" |
| 25 | #include "llvm/ADT/SmallString.h" |
| 26 | using namespace clang; |
| 27 | |
| 28 | /// PrecedenceLevels - These are precedences for the binary/ternary operators in |
| 29 | /// the C99 grammar. These have been named to relate with the C99 grammar |
| 30 | /// productions. Low precedences numbers bind more weakly than high numbers. |
| 31 | namespace prec { |
| 32 | enum Level { |
| 33 | Unknown = 0, // Not binary operator. |
| 34 | Comma = 1, // , |
| 35 | Assignment = 2, // =, *=, /=, %=, +=, -=, <<=, >>=, &=, ^=, |= |
| 36 | Conditional = 3, // ? |
| 37 | LogicalOr = 4, // || |
| 38 | LogicalAnd = 5, // && |
| 39 | InclusiveOr = 6, // | |
| 40 | ExclusiveOr = 7, // ^ |
| 41 | And = 8, // & |
| 42 | Equality = 9, // ==, != |
| 43 | Relational = 10, // >=, <=, >, < |
| 44 | Shift = 11, // <<, >> |
| 45 | Additive = 12, // -, + |
| 46 | Multiplicative = 13 // *, /, % |
| 47 | }; |
| 48 | } |
| 49 | |
| 50 | |
| 51 | /// getBinOpPrecedence - Return the precedence of the specified binary operator |
| 52 | /// token. This returns: |
| 53 | /// |
| 54 | static prec::Level getBinOpPrecedence(tok::TokenKind Kind) { |
| 55 | switch (Kind) { |
| 56 | default: return prec::Unknown; |
| 57 | case tok::comma: return prec::Comma; |
| 58 | case tok::equal: |
| 59 | case tok::starequal: |
| 60 | case tok::slashequal: |
| 61 | case tok::percentequal: |
| 62 | case tok::plusequal: |
| 63 | case tok::minusequal: |
| 64 | case tok::lesslessequal: |
| 65 | case tok::greatergreaterequal: |
| 66 | case tok::ampequal: |
| 67 | case tok::caretequal: |
| 68 | case tok::pipeequal: return prec::Assignment; |
| 69 | case tok::question: return prec::Conditional; |
| 70 | case tok::pipepipe: return prec::LogicalOr; |
| 71 | case tok::ampamp: return prec::LogicalAnd; |
| 72 | case tok::pipe: return prec::InclusiveOr; |
| 73 | case tok::caret: return prec::ExclusiveOr; |
| 74 | case tok::amp: return prec::And; |
| 75 | case tok::exclaimequal: |
| 76 | case tok::equalequal: return prec::Equality; |
| 77 | case tok::lessequal: |
| 78 | case tok::less: |
| 79 | case tok::greaterequal: |
| 80 | case tok::greater: return prec::Relational; |
| 81 | case tok::lessless: |
| 82 | case tok::greatergreater: return prec::Shift; |
| 83 | case tok::plus: |
| 84 | case tok::minus: return prec::Additive; |
| 85 | case tok::percent: |
| 86 | case tok::slash: |
| 87 | case tok::star: return prec::Multiplicative; |
| 88 | } |
| 89 | } |
| 90 | |
| 91 | |
| 92 | /// ParseExpression - Simple precedence-based parser for binary/ternary |
| 93 | /// operators. |
| 94 | /// |
| 95 | /// Note: we diverge from the C99 grammar when parsing the assignment-expression |
| 96 | /// production. C99 specifies that the LHS of an assignment operator should be |
| 97 | /// parsed as a unary-expression, but consistency dictates that it be a |
| 98 | /// conditional-expession. In practice, the important thing here is that the |
| 99 | /// LHS of an assignment has to be an l-value, which productions between |
| 100 | /// unary-expression and conditional-expression don't produce. Because we want |
| 101 | /// consistency, we parse the LHS as a conditional-expression, then check for |
| 102 | /// l-value-ness in semantic analysis stages. |
| 103 | /// |
| 104 | /// multiplicative-expression: [C99 6.5.5] |
| 105 | /// cast-expression |
| 106 | /// multiplicative-expression '*' cast-expression |
| 107 | /// multiplicative-expression '/' cast-expression |
| 108 | /// multiplicative-expression '%' cast-expression |
| 109 | /// |
| 110 | /// additive-expression: [C99 6.5.6] |
| 111 | /// multiplicative-expression |
| 112 | /// additive-expression '+' multiplicative-expression |
| 113 | /// additive-expression '-' multiplicative-expression |
| 114 | /// |
| 115 | /// shift-expression: [C99 6.5.7] |
| 116 | /// additive-expression |
| 117 | /// shift-expression '<<' additive-expression |
| 118 | /// shift-expression '>>' additive-expression |
| 119 | /// |
| 120 | /// relational-expression: [C99 6.5.8] |
| 121 | /// shift-expression |
| 122 | /// relational-expression '<' shift-expression |
| 123 | /// relational-expression '>' shift-expression |
| 124 | /// relational-expression '<=' shift-expression |
| 125 | /// relational-expression '>=' shift-expression |
| 126 | /// |
| 127 | /// equality-expression: [C99 6.5.9] |
| 128 | /// relational-expression |
| 129 | /// equality-expression '==' relational-expression |
| 130 | /// equality-expression '!=' relational-expression |
| 131 | /// |
| 132 | /// AND-expression: [C99 6.5.10] |
| 133 | /// equality-expression |
| 134 | /// AND-expression '&' equality-expression |
| 135 | /// |
| 136 | /// exclusive-OR-expression: [C99 6.5.11] |
| 137 | /// AND-expression |
| 138 | /// exclusive-OR-expression '^' AND-expression |
| 139 | /// |
| 140 | /// inclusive-OR-expression: [C99 6.5.12] |
| 141 | /// exclusive-OR-expression |
| 142 | /// inclusive-OR-expression '|' exclusive-OR-expression |
| 143 | /// |
| 144 | /// logical-AND-expression: [C99 6.5.13] |
| 145 | /// inclusive-OR-expression |
| 146 | /// logical-AND-expression '&&' inclusive-OR-expression |
| 147 | /// |
| 148 | /// logical-OR-expression: [C99 6.5.14] |
| 149 | /// logical-AND-expression |
| 150 | /// logical-OR-expression '||' logical-AND-expression |
| 151 | /// |
| 152 | /// conditional-expression: [C99 6.5.15] |
| 153 | /// logical-OR-expression |
| 154 | /// logical-OR-expression '?' expression ':' conditional-expression |
| 155 | /// [GNU] logical-OR-expression '?' ':' conditional-expression |
| 156 | /// |
| 157 | /// assignment-expression: [C99 6.5.16] |
| 158 | /// conditional-expression |
| 159 | /// unary-expression assignment-operator assignment-expression |
| 160 | /// |
| 161 | /// assignment-operator: one of |
| 162 | /// = *= /= %= += -= <<= >>= &= ^= |= |
| 163 | /// |
| 164 | /// expression: [C99 6.5.17] |
| 165 | /// assignment-expression |
| 166 | /// expression ',' assignment-expression |
| 167 | /// |
| 168 | Parser::ExprResult Parser::ParseExpression() { |
| 169 | ExprResult LHS = ParseCastExpression(false); |
| 170 | if (LHS.isInvalid) return LHS; |
| 171 | |
| 172 | return ParseRHSOfBinaryExpression(LHS, prec::Comma); |
| 173 | } |
| 174 | |
| 175 | /// ParseAssignmentExpression - Parse an expr that doesn't include commas. |
| 176 | /// |
| 177 | Parser::ExprResult Parser::ParseAssignmentExpression() { |
| 178 | ExprResult LHS = ParseCastExpression(false); |
| 179 | if (LHS.isInvalid) return LHS; |
| 180 | |
| 181 | return ParseRHSOfBinaryExpression(LHS, prec::Assignment); |
| 182 | } |
| 183 | |
| 184 | Parser::ExprResult Parser::ParseConstantExpression() { |
| 185 | ExprResult LHS = ParseCastExpression(false); |
| 186 | if (LHS.isInvalid) return LHS; |
| 187 | |
| 188 | // TODO: Validate that this is a constant expr! |
| 189 | return ParseRHSOfBinaryExpression(LHS, prec::Conditional); |
| 190 | } |
| 191 | |
| 192 | /// ParseExpressionWithLeadingIdentifier - This special purpose method is used |
| 193 | /// in contexts where we have already consumed an identifier (which we saved in |
| 194 | /// 'IdTok'), then discovered that the identifier was really the leading token |
| 195 | /// of part of an expression. For example, in "A[1]+B", we consumed "A" (which |
| 196 | /// is now in 'IdTok') and the current token is "[". |
| 197 | Parser::ExprResult Parser:: |
Chris Lattner | d217773 | 2007-07-20 16:59:19 +0000 | [diff] [blame] | 198 | ParseExpressionWithLeadingIdentifier(const Token &IdTok) { |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 199 | // We know that 'IdTok' must correspond to this production: |
| 200 | // primary-expression: identifier |
| 201 | |
| 202 | // Let the actions module handle the identifier. |
| 203 | ExprResult Res = Actions.ParseIdentifierExpr(CurScope, IdTok.getLocation(), |
| 204 | *IdTok.getIdentifierInfo(), |
| 205 | Tok.getKind() == tok::l_paren); |
| 206 | |
| 207 | // Because we have to parse an entire cast-expression before starting the |
| 208 | // ParseRHSOfBinaryExpression method (which parses any trailing binops), we |
| 209 | // need to handle the 'postfix-expression' rules. We do this by invoking |
| 210 | // ParsePostfixExpressionSuffix to consume any postfix-expression suffixes: |
| 211 | Res = ParsePostfixExpressionSuffix(Res); |
| 212 | if (Res.isInvalid) return Res; |
| 213 | |
| 214 | // At this point, the "A[1]" part of "A[1]+B" has been consumed. Once this is |
| 215 | // done, we know we don't have to do anything for cast-expression, because the |
| 216 | // only non-postfix-expression production starts with a '(' token, and we know |
| 217 | // we have an identifier. As such, we can invoke ParseRHSOfBinaryExpression |
| 218 | // to consume any trailing operators (e.g. "+" in this example) and connected |
| 219 | // chunks of the expression. |
| 220 | return ParseRHSOfBinaryExpression(Res, prec::Comma); |
| 221 | } |
| 222 | |
| 223 | /// ParseExpressionWithLeadingIdentifier - This special purpose method is used |
| 224 | /// in contexts where we have already consumed an identifier (which we saved in |
| 225 | /// 'IdTok'), then discovered that the identifier was really the leading token |
| 226 | /// of part of an assignment-expression. For example, in "A[1]+B", we consumed |
| 227 | /// "A" (which is now in 'IdTok') and the current token is "[". |
| 228 | Parser::ExprResult Parser:: |
Chris Lattner | d217773 | 2007-07-20 16:59:19 +0000 | [diff] [blame] | 229 | ParseAssignmentExprWithLeadingIdentifier(const Token &IdTok) { |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 230 | // We know that 'IdTok' must correspond to this production: |
| 231 | // primary-expression: identifier |
| 232 | |
| 233 | // Let the actions module handle the identifier. |
| 234 | ExprResult Res = Actions.ParseIdentifierExpr(CurScope, IdTok.getLocation(), |
| 235 | *IdTok.getIdentifierInfo(), |
| 236 | Tok.getKind() == tok::l_paren); |
| 237 | |
| 238 | // Because we have to parse an entire cast-expression before starting the |
| 239 | // ParseRHSOfBinaryExpression method (which parses any trailing binops), we |
| 240 | // need to handle the 'postfix-expression' rules. We do this by invoking |
| 241 | // ParsePostfixExpressionSuffix to consume any postfix-expression suffixes: |
| 242 | Res = ParsePostfixExpressionSuffix(Res); |
| 243 | if (Res.isInvalid) return Res; |
| 244 | |
| 245 | // At this point, the "A[1]" part of "A[1]+B" has been consumed. Once this is |
| 246 | // done, we know we don't have to do anything for cast-expression, because the |
| 247 | // only non-postfix-expression production starts with a '(' token, and we know |
| 248 | // we have an identifier. As such, we can invoke ParseRHSOfBinaryExpression |
| 249 | // to consume any trailing operators (e.g. "+" in this example) and connected |
| 250 | // chunks of the expression. |
| 251 | return ParseRHSOfBinaryExpression(Res, prec::Assignment); |
| 252 | } |
| 253 | |
| 254 | |
| 255 | /// ParseAssignmentExpressionWithLeadingStar - This special purpose method is |
| 256 | /// used in contexts where we have already consumed a '*' (which we saved in |
| 257 | /// 'StarTok'), then discovered that the '*' was really the leading token of an |
| 258 | /// expression. For example, in "*(int*)P+B", we consumed "*" (which is |
| 259 | /// now in 'StarTok') and the current token is "(". |
| 260 | Parser::ExprResult Parser:: |
Chris Lattner | d217773 | 2007-07-20 16:59:19 +0000 | [diff] [blame] | 261 | ParseAssignmentExpressionWithLeadingStar(const Token &StarTok) { |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 262 | // We know that 'StarTok' must correspond to this production: |
| 263 | // unary-expression: unary-operator cast-expression |
| 264 | // where 'unary-operator' is '*'. |
| 265 | |
| 266 | // Parse the cast-expression that follows the '*'. This will parse the |
| 267 | // "*(int*)P" part of "*(int*)P+B". |
| 268 | ExprResult Res = ParseCastExpression(false); |
| 269 | if (Res.isInvalid) return Res; |
| 270 | |
| 271 | // Combine StarTok + Res to get the new AST for the combined expression.. |
| 272 | Res = Actions.ParseUnaryOp(StarTok.getLocation(), tok::star, Res.Val); |
| 273 | if (Res.isInvalid) return Res; |
| 274 | |
| 275 | |
| 276 | // We have to parse an entire cast-expression before starting the |
| 277 | // ParseRHSOfBinaryExpression method (which parses any trailing binops). Since |
| 278 | // we know that the only production above us is the cast-expression |
| 279 | // production, and because the only alternative productions start with a '(' |
| 280 | // token (we know we had a '*'), there is no work to do to get a whole |
| 281 | // cast-expression. |
| 282 | |
| 283 | // At this point, the "*(int*)P" part of "*(int*)P+B" has been consumed. Once |
| 284 | // this is done, we can invoke ParseRHSOfBinaryExpression to consume any |
| 285 | // trailing operators (e.g. "+" in this example) and connected chunks of the |
| 286 | // assignment-expression. |
| 287 | return ParseRHSOfBinaryExpression(Res, prec::Assignment); |
| 288 | } |
| 289 | |
| 290 | |
| 291 | /// ParseRHSOfBinaryExpression - Parse a binary expression that starts with |
| 292 | /// LHS and has a precedence of at least MinPrec. |
| 293 | Parser::ExprResult |
| 294 | Parser::ParseRHSOfBinaryExpression(ExprResult LHS, unsigned MinPrec) { |
| 295 | unsigned NextTokPrec = getBinOpPrecedence(Tok.getKind()); |
| 296 | SourceLocation ColonLoc; |
| 297 | |
| 298 | while (1) { |
| 299 | // If this token has a lower precedence than we are allowed to parse (e.g. |
| 300 | // because we are called recursively, or because the token is not a binop), |
| 301 | // then we are done! |
| 302 | if (NextTokPrec < MinPrec) |
| 303 | return LHS; |
| 304 | |
| 305 | // Consume the operator, saving the operator token for error reporting. |
Chris Lattner | d217773 | 2007-07-20 16:59:19 +0000 | [diff] [blame] | 306 | Token OpToken = Tok; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 307 | ConsumeToken(); |
| 308 | |
| 309 | // Special case handling for the ternary operator. |
| 310 | ExprResult TernaryMiddle(true); |
| 311 | if (NextTokPrec == prec::Conditional) { |
| 312 | if (Tok.getKind() != tok::colon) { |
| 313 | // Handle this production specially: |
| 314 | // logical-OR-expression '?' expression ':' conditional-expression |
| 315 | // In particular, the RHS of the '?' is 'expression', not |
| 316 | // 'logical-OR-expression' as we might expect. |
| 317 | TernaryMiddle = ParseExpression(); |
| 318 | if (TernaryMiddle.isInvalid) return TernaryMiddle; |
| 319 | } else { |
| 320 | // Special case handling of "X ? Y : Z" where Y is empty: |
| 321 | // logical-OR-expression '?' ':' conditional-expression [GNU] |
| 322 | TernaryMiddle = ExprResult(false); |
| 323 | Diag(Tok, diag::ext_gnu_conditional_expr); |
| 324 | } |
| 325 | |
| 326 | if (Tok.getKind() != tok::colon) { |
| 327 | Diag(Tok, diag::err_expected_colon); |
| 328 | Diag(OpToken, diag::err_matching, "?"); |
| 329 | return ExprResult(true); |
| 330 | } |
| 331 | |
| 332 | // Eat the colon. |
| 333 | ColonLoc = ConsumeToken(); |
| 334 | } |
| 335 | |
| 336 | // Parse another leaf here for the RHS of the operator. |
| 337 | ExprResult RHS = ParseCastExpression(false); |
| 338 | if (RHS.isInvalid) return RHS; |
| 339 | |
| 340 | // Remember the precedence of this operator and get the precedence of the |
| 341 | // operator immediately to the right of the RHS. |
| 342 | unsigned ThisPrec = NextTokPrec; |
| 343 | NextTokPrec = getBinOpPrecedence(Tok.getKind()); |
| 344 | |
| 345 | // Assignment and conditional expressions are right-associative. |
| 346 | bool isRightAssoc = NextTokPrec == prec::Conditional || |
| 347 | NextTokPrec == prec::Assignment; |
| 348 | |
| 349 | // Get the precedence of the operator to the right of the RHS. If it binds |
| 350 | // more tightly with RHS than we do, evaluate it completely first. |
| 351 | if (ThisPrec < NextTokPrec || |
| 352 | (ThisPrec == NextTokPrec && isRightAssoc)) { |
| 353 | // If this is left-associative, only parse things on the RHS that bind |
| 354 | // more tightly than the current operator. If it is left-associative, it |
| 355 | // is okay, to bind exactly as tightly. For example, compile A=B=C=D as |
| 356 | // A=(B=(C=D)), where each paren is a level of recursion here. |
| 357 | RHS = ParseRHSOfBinaryExpression(RHS, ThisPrec + !isRightAssoc); |
| 358 | if (RHS.isInvalid) return RHS; |
| 359 | |
| 360 | NextTokPrec = getBinOpPrecedence(Tok.getKind()); |
| 361 | } |
| 362 | assert(NextTokPrec <= ThisPrec && "Recursion didn't work!"); |
| 363 | |
| 364 | // Combine the LHS and RHS into the LHS (e.g. build AST). |
| 365 | if (TernaryMiddle.isInvalid) |
| 366 | LHS = Actions.ParseBinOp(OpToken.getLocation(), OpToken.getKind(), |
| 367 | LHS.Val, RHS.Val); |
| 368 | else |
| 369 | LHS = Actions.ParseConditionalOp(OpToken.getLocation(), ColonLoc, |
| 370 | LHS.Val, TernaryMiddle.Val, RHS.Val); |
| 371 | } |
| 372 | } |
| 373 | |
| 374 | /// ParseCastExpression - Parse a cast-expression, or, if isUnaryExpression is |
| 375 | /// true, parse a unary-expression. |
| 376 | /// |
| 377 | /// cast-expression: [C99 6.5.4] |
| 378 | /// unary-expression |
| 379 | /// '(' type-name ')' cast-expression |
| 380 | /// |
| 381 | /// unary-expression: [C99 6.5.3] |
| 382 | /// postfix-expression |
| 383 | /// '++' unary-expression |
| 384 | /// '--' unary-expression |
| 385 | /// unary-operator cast-expression |
| 386 | /// 'sizeof' unary-expression |
| 387 | /// 'sizeof' '(' type-name ')' |
| 388 | /// [GNU] '__alignof' unary-expression |
| 389 | /// [GNU] '__alignof' '(' type-name ')' |
| 390 | /// [GNU] '&&' identifier |
| 391 | /// |
| 392 | /// unary-operator: one of |
| 393 | /// '&' '*' '+' '-' '~' '!' |
| 394 | /// [GNU] '__extension__' '__real' '__imag' |
| 395 | /// |
| 396 | /// primary-expression: [C99 6.5.1] |
| 397 | /// identifier |
| 398 | /// constant |
| 399 | /// string-literal |
| 400 | /// [C++] boolean-literal [C++ 2.13.5] |
| 401 | /// '(' expression ')' |
| 402 | /// '__func__' [C99 6.4.2.2] |
| 403 | /// [GNU] '__FUNCTION__' |
| 404 | /// [GNU] '__PRETTY_FUNCTION__' |
| 405 | /// [GNU] '(' compound-statement ')' |
| 406 | /// [GNU] '__builtin_va_arg' '(' assignment-expression ',' type-name ')' |
| 407 | /// [GNU] '__builtin_offsetof' '(' type-name ',' offsetof-member-designator')' |
| 408 | /// [GNU] '__builtin_choose_expr' '(' assign-expr ',' assign-expr ',' |
| 409 | /// assign-expr ')' |
| 410 | /// [GNU] '__builtin_types_compatible_p' '(' type-name ',' type-name ')' |
| 411 | /// [OBC] '[' objc-receiver objc-message-args ']' [TODO] |
| 412 | /// [OBC] '@selector' '(' objc-selector-arg ')' [TODO] |
| 413 | /// [OBC] '@protocol' '(' identifier ')' [TODO] |
| 414 | /// [OBC] '@encode' '(' type-name ')' [TODO] |
Anders Carlsson | 5dac7f6 | 2007-08-21 19:18:49 +0000 | [diff] [blame] | 415 | /// [OBC] objc-string-literal |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 416 | /// [C++] 'const_cast' '<' type-name '>' '(' expression ')' [C++ 5.2p1] |
| 417 | /// [C++] 'dynamic_cast' '<' type-name '>' '(' expression ')' [C++ 5.2p1] |
| 418 | /// [C++] 'reinterpret_cast' '<' type-name '>' '(' expression ')' [C++ 5.2p1] |
| 419 | /// [C++] 'static_cast' '<' type-name '>' '(' expression ')' [C++ 5.2p1] |
| 420 | /// |
| 421 | /// constant: [C99 6.4.4] |
| 422 | /// integer-constant |
| 423 | /// floating-constant |
| 424 | /// enumeration-constant -> identifier |
| 425 | /// character-constant |
| 426 | /// |
| 427 | Parser::ExprResult Parser::ParseCastExpression(bool isUnaryExpression) { |
| 428 | ExprResult Res; |
| 429 | tok::TokenKind SavedKind = Tok.getKind(); |
| 430 | |
| 431 | // This handles all of cast-expression, unary-expression, postfix-expression, |
| 432 | // and primary-expression. We handle them together like this for efficiency |
| 433 | // and to simplify handling of an expression starting with a '(' token: which |
| 434 | // may be one of a parenthesized expression, cast-expression, compound literal |
| 435 | // expression, or statement expression. |
| 436 | // |
| 437 | // If the parsed tokens consist of a primary-expression, the cases below |
| 438 | // call ParsePostfixExpressionSuffix to handle the postfix expression |
| 439 | // suffixes. Cases that cannot be followed by postfix exprs should |
| 440 | // return without invoking ParsePostfixExpressionSuffix. |
| 441 | switch (SavedKind) { |
| 442 | case tok::l_paren: { |
| 443 | // If this expression is limited to being a unary-expression, the parent can |
| 444 | // not start a cast expression. |
| 445 | ParenParseOption ParenExprType = |
| 446 | isUnaryExpression ? CompoundLiteral : CastExpr; |
| 447 | TypeTy *CastTy; |
| 448 | SourceLocation LParenLoc = Tok.getLocation(); |
| 449 | SourceLocation RParenLoc; |
| 450 | Res = ParseParenExpression(ParenExprType, CastTy, RParenLoc); |
| 451 | if (Res.isInvalid) return Res; |
| 452 | |
| 453 | switch (ParenExprType) { |
| 454 | case SimpleExpr: break; // Nothing else to do. |
| 455 | case CompoundStmt: break; // Nothing else to do. |
| 456 | case CompoundLiteral: |
| 457 | // We parsed '(' type-name ')' '{' ... '}'. If any suffixes of |
| 458 | // postfix-expression exist, parse them now. |
| 459 | break; |
| 460 | case CastExpr: |
| 461 | // We parsed '(' type-name ')' and the thing after it wasn't a '{'. Parse |
| 462 | // the cast-expression that follows it next. |
| 463 | // TODO: For cast expression with CastTy. |
| 464 | Res = ParseCastExpression(false); |
| 465 | if (!Res.isInvalid) |
| 466 | Res = Actions.ParseCastExpr(LParenLoc, CastTy, RParenLoc, Res.Val); |
| 467 | return Res; |
| 468 | } |
| 469 | |
| 470 | // These can be followed by postfix-expr pieces. |
| 471 | return ParsePostfixExpressionSuffix(Res); |
| 472 | } |
| 473 | |
| 474 | // primary-expression |
| 475 | case tok::numeric_constant: |
| 476 | // constant: integer-constant |
| 477 | // constant: floating-constant |
| 478 | |
| 479 | Res = Actions.ParseNumericConstant(Tok); |
| 480 | ConsumeToken(); |
| 481 | |
| 482 | // These can be followed by postfix-expr pieces. |
| 483 | return ParsePostfixExpressionSuffix(Res); |
| 484 | |
| 485 | case tok::kw_true: |
| 486 | case tok::kw_false: |
| 487 | return ParseCXXBoolLiteral(); |
| 488 | |
| 489 | case tok::identifier: { // primary-expression: identifier |
| 490 | // constant: enumeration-constant |
| 491 | // Consume the identifier so that we can see if it is followed by a '('. |
| 492 | // Function designators are allowed to be undeclared (C99 6.5.1p2), so we |
| 493 | // need to know whether or not this identifier is a function designator or |
| 494 | // not. |
| 495 | IdentifierInfo &II = *Tok.getIdentifierInfo(); |
| 496 | SourceLocation L = ConsumeToken(); |
| 497 | Res = Actions.ParseIdentifierExpr(CurScope, L, II, |
| 498 | Tok.getKind() == tok::l_paren); |
| 499 | // These can be followed by postfix-expr pieces. |
| 500 | return ParsePostfixExpressionSuffix(Res); |
| 501 | } |
| 502 | case tok::char_constant: // constant: character-constant |
| 503 | Res = Actions.ParseCharacterConstant(Tok); |
| 504 | ConsumeToken(); |
| 505 | // These can be followed by postfix-expr pieces. |
| 506 | return ParsePostfixExpressionSuffix(Res); |
| 507 | case tok::kw___func__: // primary-expression: __func__ [C99 6.4.2.2] |
| 508 | case tok::kw___FUNCTION__: // primary-expression: __FUNCTION__ [GNU] |
| 509 | case tok::kw___PRETTY_FUNCTION__: // primary-expression: __P..Y_F..N__ [GNU] |
Anders Carlsson | 2274266 | 2007-07-21 05:21:51 +0000 | [diff] [blame] | 510 | Res = Actions.ParsePreDefinedExpr(Tok.getLocation(), SavedKind); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 511 | ConsumeToken(); |
| 512 | // These can be followed by postfix-expr pieces. |
| 513 | return ParsePostfixExpressionSuffix(Res); |
| 514 | case tok::string_literal: // primary-expression: string-literal |
| 515 | case tok::wide_string_literal: |
| 516 | Res = ParseStringLiteralExpression(); |
| 517 | if (Res.isInvalid) return Res; |
| 518 | // This can be followed by postfix-expr pieces (e.g. "foo"[1]). |
| 519 | return ParsePostfixExpressionSuffix(Res); |
| 520 | case tok::kw___builtin_va_arg: |
| 521 | case tok::kw___builtin_offsetof: |
| 522 | case tok::kw___builtin_choose_expr: |
| 523 | case tok::kw___builtin_types_compatible_p: |
| 524 | return ParseBuiltinPrimaryExpression(); |
| 525 | case tok::plusplus: // unary-expression: '++' unary-expression |
| 526 | case tok::minusminus: { // unary-expression: '--' unary-expression |
| 527 | SourceLocation SavedLoc = ConsumeToken(); |
| 528 | Res = ParseCastExpression(true); |
| 529 | if (!Res.isInvalid) |
| 530 | Res = Actions.ParseUnaryOp(SavedLoc, SavedKind, Res.Val); |
| 531 | return Res; |
| 532 | } |
| 533 | case tok::amp: // unary-expression: '&' cast-expression |
| 534 | case tok::star: // unary-expression: '*' cast-expression |
| 535 | case tok::plus: // unary-expression: '+' cast-expression |
| 536 | case tok::minus: // unary-expression: '-' cast-expression |
| 537 | case tok::tilde: // unary-expression: '~' cast-expression |
| 538 | case tok::exclaim: // unary-expression: '!' cast-expression |
| 539 | case tok::kw___real: // unary-expression: '__real' cast-expression [GNU] |
| 540 | case tok::kw___imag: // unary-expression: '__imag' cast-expression [GNU] |
| 541 | case tok::kw___extension__:{//unary-expression:'__extension__' cast-expr [GNU] |
Chris Lattner | ab18c4c | 2007-07-24 16:58:17 +0000 | [diff] [blame] | 542 | // FIXME: Extension should silence extwarns in subexpressions. |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 543 | SourceLocation SavedLoc = ConsumeToken(); |
| 544 | Res = ParseCastExpression(false); |
| 545 | if (!Res.isInvalid) |
| 546 | Res = Actions.ParseUnaryOp(SavedLoc, SavedKind, Res.Val); |
| 547 | return Res; |
| 548 | } |
| 549 | case tok::kw_sizeof: // unary-expression: 'sizeof' unary-expression |
| 550 | // unary-expression: 'sizeof' '(' type-name ')' |
| 551 | case tok::kw___alignof: // unary-expression: '__alignof' unary-expression |
| 552 | // unary-expression: '__alignof' '(' type-name ')' |
| 553 | return ParseSizeofAlignofExpression(); |
| 554 | case tok::ampamp: { // unary-expression: '&&' identifier |
| 555 | SourceLocation AmpAmpLoc = ConsumeToken(); |
| 556 | if (Tok.getKind() != tok::identifier) { |
| 557 | Diag(Tok, diag::err_expected_ident); |
| 558 | return ExprResult(true); |
| 559 | } |
| 560 | |
| 561 | Diag(AmpAmpLoc, diag::ext_gnu_address_of_label); |
| 562 | Res = Actions.ParseAddrLabel(AmpAmpLoc, Tok.getLocation(), |
| 563 | Tok.getIdentifierInfo()); |
| 564 | ConsumeToken(); |
| 565 | return Res; |
| 566 | } |
| 567 | case tok::kw_const_cast: |
| 568 | case tok::kw_dynamic_cast: |
| 569 | case tok::kw_reinterpret_cast: |
| 570 | case tok::kw_static_cast: |
| 571 | return ParseCXXCasts(); |
Anders Carlsson | 5508518 | 2007-08-21 17:43:55 +0000 | [diff] [blame] | 572 | case tok::at: |
| 573 | return ParseObjCExpression(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 574 | default: |
| 575 | Diag(Tok, diag::err_expected_expression); |
| 576 | return ExprResult(true); |
| 577 | } |
| 578 | |
| 579 | // unreachable. |
| 580 | abort(); |
| 581 | } |
| 582 | |
| 583 | /// ParsePostfixExpressionSuffix - Once the leading part of a postfix-expression |
| 584 | /// is parsed, this method parses any suffixes that apply. |
| 585 | /// |
| 586 | /// postfix-expression: [C99 6.5.2] |
| 587 | /// primary-expression |
| 588 | /// postfix-expression '[' expression ']' |
| 589 | /// postfix-expression '(' argument-expression-list[opt] ')' |
| 590 | /// postfix-expression '.' identifier |
| 591 | /// postfix-expression '->' identifier |
| 592 | /// postfix-expression '++' |
| 593 | /// postfix-expression '--' |
| 594 | /// '(' type-name ')' '{' initializer-list '}' |
| 595 | /// '(' type-name ')' '{' initializer-list ',' '}' |
| 596 | /// |
| 597 | /// argument-expression-list: [C99 6.5.2] |
| 598 | /// argument-expression |
| 599 | /// argument-expression-list ',' assignment-expression |
| 600 | /// |
| 601 | Parser::ExprResult Parser::ParsePostfixExpressionSuffix(ExprResult LHS) { |
| 602 | |
| 603 | // Now that the primary-expression piece of the postfix-expression has been |
| 604 | // parsed, see if there are any postfix-expression pieces here. |
| 605 | SourceLocation Loc; |
| 606 | while (1) { |
| 607 | switch (Tok.getKind()) { |
| 608 | default: // Not a postfix-expression suffix. |
| 609 | return LHS; |
| 610 | case tok::l_square: { // postfix-expression: p-e '[' expression ']' |
| 611 | Loc = ConsumeBracket(); |
| 612 | ExprResult Idx = ParseExpression(); |
| 613 | |
| 614 | SourceLocation RLoc = Tok.getLocation(); |
| 615 | |
| 616 | if (!LHS.isInvalid && !Idx.isInvalid && Tok.getKind() == tok::r_square) |
| 617 | LHS = Actions.ParseArraySubscriptExpr(LHS.Val, Loc, Idx.Val, RLoc); |
| 618 | else |
| 619 | LHS = ExprResult(true); |
| 620 | |
| 621 | // Match the ']'. |
| 622 | MatchRHSPunctuation(tok::r_square, Loc); |
| 623 | break; |
| 624 | } |
| 625 | |
| 626 | case tok::l_paren: { // p-e: p-e '(' argument-expression-list[opt] ')' |
| 627 | llvm::SmallVector<ExprTy*, 8> ArgExprs; |
| 628 | llvm::SmallVector<SourceLocation, 8> CommaLocs; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 629 | |
| 630 | Loc = ConsumeParen(); |
| 631 | |
| 632 | if (Tok.getKind() != tok::r_paren) { |
| 633 | while (1) { |
| 634 | ExprResult ArgExpr = ParseAssignmentExpression(); |
| 635 | if (ArgExpr.isInvalid) { |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 636 | SkipUntil(tok::r_paren); |
Chris Lattner | 2ff5426 | 2007-07-21 05:18:12 +0000 | [diff] [blame] | 637 | return ExprResult(true); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 638 | } else |
| 639 | ArgExprs.push_back(ArgExpr.Val); |
| 640 | |
| 641 | if (Tok.getKind() != tok::comma) |
| 642 | break; |
| 643 | // Move to the next argument, remember where the comma was. |
| 644 | CommaLocs.push_back(ConsumeToken()); |
| 645 | } |
| 646 | } |
| 647 | |
| 648 | // Match the ')'. |
Chris Lattner | 2ff5426 | 2007-07-21 05:18:12 +0000 | [diff] [blame] | 649 | if (!LHS.isInvalid && Tok.getKind() == tok::r_paren) { |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 650 | assert((ArgExprs.size() == 0 || ArgExprs.size()-1 == CommaLocs.size())&& |
| 651 | "Unexpected number of commas!"); |
| 652 | LHS = Actions.ParseCallExpr(LHS.Val, Loc, &ArgExprs[0], ArgExprs.size(), |
| 653 | &CommaLocs[0], Tok.getLocation()); |
| 654 | } |
| 655 | |
Chris Lattner | 2ff5426 | 2007-07-21 05:18:12 +0000 | [diff] [blame] | 656 | MatchRHSPunctuation(tok::r_paren, Loc); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 657 | break; |
| 658 | } |
| 659 | case tok::arrow: // postfix-expression: p-e '->' identifier |
| 660 | case tok::period: { // postfix-expression: p-e '.' identifier |
| 661 | tok::TokenKind OpKind = Tok.getKind(); |
| 662 | SourceLocation OpLoc = ConsumeToken(); // Eat the "." or "->" token. |
| 663 | |
| 664 | if (Tok.getKind() != tok::identifier) { |
| 665 | Diag(Tok, diag::err_expected_ident); |
| 666 | return ExprResult(true); |
| 667 | } |
| 668 | |
| 669 | if (!LHS.isInvalid) |
| 670 | LHS = Actions.ParseMemberReferenceExpr(LHS.Val, OpLoc, OpKind, |
| 671 | Tok.getLocation(), |
| 672 | *Tok.getIdentifierInfo()); |
| 673 | ConsumeToken(); |
| 674 | break; |
| 675 | } |
| 676 | case tok::plusplus: // postfix-expression: postfix-expression '++' |
| 677 | case tok::minusminus: // postfix-expression: postfix-expression '--' |
| 678 | if (!LHS.isInvalid) |
| 679 | LHS = Actions.ParsePostfixUnaryOp(Tok.getLocation(), Tok.getKind(), |
| 680 | LHS.Val); |
| 681 | ConsumeToken(); |
| 682 | break; |
| 683 | } |
| 684 | } |
| 685 | } |
| 686 | |
| 687 | |
| 688 | /// ParseSizeofAlignofExpression - Parse a sizeof or alignof expression. |
| 689 | /// unary-expression: [C99 6.5.3] |
| 690 | /// 'sizeof' unary-expression |
| 691 | /// 'sizeof' '(' type-name ')' |
| 692 | /// [GNU] '__alignof' unary-expression |
| 693 | /// [GNU] '__alignof' '(' type-name ')' |
| 694 | Parser::ExprResult Parser::ParseSizeofAlignofExpression() { |
| 695 | assert((Tok.getKind() == tok::kw_sizeof || |
| 696 | Tok.getKind() == tok::kw___alignof) && |
| 697 | "Not a sizeof/alignof expression!"); |
Chris Lattner | d217773 | 2007-07-20 16:59:19 +0000 | [diff] [blame] | 698 | Token OpTok = Tok; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 699 | ConsumeToken(); |
| 700 | |
| 701 | // If the operand doesn't start with an '(', it must be an expression. |
| 702 | ExprResult Operand; |
| 703 | if (Tok.getKind() != tok::l_paren) { |
| 704 | Operand = ParseCastExpression(true); |
| 705 | } else { |
| 706 | // If it starts with a '(', we know that it is either a parenthesized |
| 707 | // type-name, or it is a unary-expression that starts with a compound |
| 708 | // literal, or starts with a primary-expression that is a parenthesized |
| 709 | // expression. |
| 710 | ParenParseOption ExprType = CastExpr; |
| 711 | TypeTy *CastTy; |
| 712 | SourceLocation LParenLoc = Tok.getLocation(), RParenLoc; |
| 713 | Operand = ParseParenExpression(ExprType, CastTy, RParenLoc); |
| 714 | |
| 715 | // If ParseParenExpression parsed a '(typename)' sequence only, the this is |
| 716 | // sizeof/alignof a type. Otherwise, it is sizeof/alignof an expression. |
| 717 | if (ExprType == CastExpr) { |
| 718 | return Actions.ParseSizeOfAlignOfTypeExpr(OpTok.getLocation(), |
| 719 | OpTok.getKind() == tok::kw_sizeof, |
| 720 | LParenLoc, CastTy, RParenLoc); |
| 721 | } |
| 722 | } |
| 723 | |
| 724 | // If we get here, the operand to the sizeof/alignof was an expresion. |
| 725 | if (!Operand.isInvalid) |
| 726 | Operand = Actions.ParseUnaryOp(OpTok.getLocation(), OpTok.getKind(), |
| 727 | Operand.Val); |
| 728 | return Operand; |
| 729 | } |
| 730 | |
| 731 | /// ParseBuiltinPrimaryExpression |
| 732 | /// |
| 733 | /// primary-expression: [C99 6.5.1] |
| 734 | /// [GNU] '__builtin_va_arg' '(' assignment-expression ',' type-name ')' |
| 735 | /// [GNU] '__builtin_offsetof' '(' type-name ',' offsetof-member-designator')' |
| 736 | /// [GNU] '__builtin_choose_expr' '(' assign-expr ',' assign-expr ',' |
| 737 | /// assign-expr ')' |
| 738 | /// [GNU] '__builtin_types_compatible_p' '(' type-name ',' type-name ')' |
| 739 | /// |
| 740 | /// [GNU] offsetof-member-designator: |
| 741 | /// [GNU] identifier |
| 742 | /// [GNU] offsetof-member-designator '.' identifier |
| 743 | /// [GNU] offsetof-member-designator '[' expression ']' |
| 744 | /// |
| 745 | Parser::ExprResult Parser::ParseBuiltinPrimaryExpression() { |
| 746 | ExprResult Res(false); |
| 747 | const IdentifierInfo *BuiltinII = Tok.getIdentifierInfo(); |
| 748 | |
| 749 | tok::TokenKind T = Tok.getKind(); |
| 750 | SourceLocation StartLoc = ConsumeToken(); // Eat the builtin identifier. |
| 751 | |
| 752 | // All of these start with an open paren. |
| 753 | if (Tok.getKind() != tok::l_paren) { |
| 754 | Diag(Tok, diag::err_expected_lparen_after, BuiltinII->getName()); |
| 755 | return ExprResult(true); |
| 756 | } |
| 757 | |
| 758 | SourceLocation LParenLoc = ConsumeParen(); |
| 759 | // TODO: Build AST. |
| 760 | |
| 761 | switch (T) { |
| 762 | default: assert(0 && "Not a builtin primary expression!"); |
| 763 | case tok::kw___builtin_va_arg: |
| 764 | Res = ParseAssignmentExpression(); |
| 765 | if (Res.isInvalid) { |
| 766 | SkipUntil(tok::r_paren); |
| 767 | return Res; |
| 768 | } |
| 769 | |
| 770 | if (ExpectAndConsume(tok::comma, diag::err_expected_comma, "",tok::r_paren)) |
| 771 | return ExprResult(true); |
| 772 | |
| 773 | ParseTypeName(); |
Chris Lattner | 6eb2109 | 2007-08-30 15:52:49 +0000 | [diff] [blame] | 774 | |
| 775 | MatchRHSPunctuation(tok::r_paren, LParenLoc); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 776 | break; |
| 777 | |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 778 | case tok::kw___builtin_offsetof: { |
Chris Lattner | 9fddf0a | 2007-08-30 17:08:45 +0000 | [diff] [blame^] | 779 | SourceLocation TypeLoc = Tok.getLocation(); |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 780 | TypeTy *Ty = ParseTypeName(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 781 | |
| 782 | if (ExpectAndConsume(tok::comma, diag::err_expected_comma, "",tok::r_paren)) |
| 783 | return ExprResult(true); |
| 784 | |
| 785 | // We must have at least one identifier here. |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 786 | if (Tok.getKind() != tok::identifier) { |
| 787 | Diag(Tok, diag::err_expected_ident); |
| 788 | SkipUntil(tok::r_paren); |
| 789 | return true; |
| 790 | } |
| 791 | |
| 792 | // Keep track of the various subcomponents we see. |
| 793 | llvm::SmallVector<Action::OffsetOfComponent, 4> Comps; |
| 794 | |
| 795 | Comps.push_back(Action::OffsetOfComponent()); |
| 796 | Comps.back().isBrackets = false; |
| 797 | Comps.back().U.IdentInfo = Tok.getIdentifierInfo(); |
| 798 | Comps.back().LocStart = Comps.back().LocEnd = ConsumeToken(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 799 | |
| 800 | while (1) { |
| 801 | if (Tok.getKind() == tok::period) { |
| 802 | // offsetof-member-designator: offsetof-member-designator '.' identifier |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 803 | Comps.push_back(Action::OffsetOfComponent()); |
| 804 | Comps.back().isBrackets = false; |
| 805 | Comps.back().LocStart = ConsumeToken(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 806 | |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 807 | if (Tok.getKind() != tok::identifier) { |
| 808 | Diag(Tok, diag::err_expected_ident); |
| 809 | SkipUntil(tok::r_paren); |
| 810 | return true; |
| 811 | } |
| 812 | Comps.back().U.IdentInfo = Tok.getIdentifierInfo(); |
| 813 | Comps.back().LocEnd = ConsumeToken(); |
| 814 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 815 | } else if (Tok.getKind() == tok::l_square) { |
| 816 | // offsetof-member-designator: offsetof-member-design '[' expression ']' |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 817 | Comps.push_back(Action::OffsetOfComponent()); |
| 818 | Comps.back().isBrackets = true; |
| 819 | Comps.back().LocStart = ConsumeBracket(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 820 | Res = ParseExpression(); |
| 821 | if (Res.isInvalid) { |
| 822 | SkipUntil(tok::r_paren); |
| 823 | return Res; |
| 824 | } |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 825 | Comps.back().U.E = Res.Val; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 826 | |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 827 | Comps.back().LocEnd = |
| 828 | MatchRHSPunctuation(tok::r_square, Comps.back().LocStart); |
| 829 | } else if (Tok.getKind() == tok::r_paren) { |
Chris Lattner | 9fddf0a | 2007-08-30 17:08:45 +0000 | [diff] [blame^] | 830 | Res = Actions.ParseBuiltinOffsetOf(StartLoc, TypeLoc, Ty, &Comps[0], |
Chris Lattner | 6eb2109 | 2007-08-30 15:52:49 +0000 | [diff] [blame] | 831 | Comps.size(), ConsumeParen()); |
| 832 | break; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 833 | } else { |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 834 | // Error occurred. |
| 835 | return ExprResult(true); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 836 | } |
| 837 | } |
| 838 | break; |
Chris Lattner | f9aa3cb | 2007-08-30 15:51:11 +0000 | [diff] [blame] | 839 | } |
Steve Naroff | d04fdd5 | 2007-08-03 21:21:27 +0000 | [diff] [blame] | 840 | case tok::kw___builtin_choose_expr: { |
| 841 | ExprResult Cond = ParseAssignmentExpression(); |
| 842 | if (Cond.isInvalid) { |
| 843 | SkipUntil(tok::r_paren); |
| 844 | return Cond; |
| 845 | } |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 846 | if (ExpectAndConsume(tok::comma, diag::err_expected_comma, "",tok::r_paren)) |
| 847 | return ExprResult(true); |
| 848 | |
Steve Naroff | d04fdd5 | 2007-08-03 21:21:27 +0000 | [diff] [blame] | 849 | ExprResult Expr1 = ParseAssignmentExpression(); |
| 850 | if (Expr1.isInvalid) { |
| 851 | SkipUntil(tok::r_paren); |
| 852 | return Expr1; |
| 853 | } |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 854 | if (ExpectAndConsume(tok::comma, diag::err_expected_comma, "",tok::r_paren)) |
| 855 | return ExprResult(true); |
| 856 | |
Steve Naroff | d04fdd5 | 2007-08-03 21:21:27 +0000 | [diff] [blame] | 857 | ExprResult Expr2 = ParseAssignmentExpression(); |
| 858 | if (Expr2.isInvalid) { |
| 859 | SkipUntil(tok::r_paren); |
| 860 | return Expr2; |
| 861 | } |
| 862 | if (Tok.getKind() != tok::r_paren) { |
| 863 | Diag(Tok, diag::err_expected_rparen); |
| 864 | return ExprResult(true); |
| 865 | } |
Chris Lattner | 6eb2109 | 2007-08-30 15:52:49 +0000 | [diff] [blame] | 866 | Res = Actions.ParseChooseExpr(StartLoc, Cond.Val, Expr1.Val, Expr2.Val, |
| 867 | ConsumeParen()); |
| 868 | break; |
Steve Naroff | d04fdd5 | 2007-08-03 21:21:27 +0000 | [diff] [blame] | 869 | } |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 870 | case tok::kw___builtin_types_compatible_p: |
Steve Naroff | 363bcff | 2007-08-01 23:45:51 +0000 | [diff] [blame] | 871 | TypeTy *Ty1 = ParseTypeName(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 872 | |
| 873 | if (ExpectAndConsume(tok::comma, diag::err_expected_comma, "",tok::r_paren)) |
| 874 | return ExprResult(true); |
| 875 | |
Steve Naroff | 363bcff | 2007-08-01 23:45:51 +0000 | [diff] [blame] | 876 | TypeTy *Ty2 = ParseTypeName(); |
| 877 | |
| 878 | if (Tok.getKind() != tok::r_paren) { |
| 879 | Diag(Tok, diag::err_expected_rparen); |
| 880 | return ExprResult(true); |
| 881 | } |
Chris Lattner | 6eb2109 | 2007-08-30 15:52:49 +0000 | [diff] [blame] | 882 | Res = Actions.ParseTypesCompatibleExpr(StartLoc, Ty1, Ty2, ConsumeParen()); |
| 883 | break; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 884 | } |
| 885 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 886 | // These can be followed by postfix-expr pieces because they are |
| 887 | // primary-expressions. |
| 888 | return ParsePostfixExpressionSuffix(Res); |
| 889 | } |
| 890 | |
| 891 | /// ParseParenExpression - This parses the unit that starts with a '(' token, |
| 892 | /// based on what is allowed by ExprType. The actual thing parsed is returned |
| 893 | /// in ExprType. |
| 894 | /// |
| 895 | /// primary-expression: [C99 6.5.1] |
| 896 | /// '(' expression ')' |
| 897 | /// [GNU] '(' compound-statement ')' (if !ParenExprOnly) |
| 898 | /// postfix-expression: [C99 6.5.2] |
| 899 | /// '(' type-name ')' '{' initializer-list '}' |
| 900 | /// '(' type-name ')' '{' initializer-list ',' '}' |
| 901 | /// cast-expression: [C99 6.5.4] |
| 902 | /// '(' type-name ')' cast-expression |
| 903 | /// |
| 904 | Parser::ExprResult Parser::ParseParenExpression(ParenParseOption &ExprType, |
| 905 | TypeTy *&CastTy, |
| 906 | SourceLocation &RParenLoc) { |
| 907 | assert(Tok.getKind() == tok::l_paren && "Not a paren expr!"); |
| 908 | SourceLocation OpenLoc = ConsumeParen(); |
Chris Lattner | ab18c4c | 2007-07-24 16:58:17 +0000 | [diff] [blame] | 909 | ExprResult Result(true); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 910 | CastTy = 0; |
| 911 | |
| 912 | if (ExprType >= CompoundStmt && Tok.getKind() == tok::l_brace && |
| 913 | !getLang().NoExtensions) { |
| 914 | Diag(Tok, diag::ext_gnu_statement_expr); |
Chris Lattner | ab18c4c | 2007-07-24 16:58:17 +0000 | [diff] [blame] | 915 | Parser::StmtResult Stmt = ParseCompoundStatement(); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 916 | ExprType = CompoundStmt; |
Chris Lattner | ab18c4c | 2007-07-24 16:58:17 +0000 | [diff] [blame] | 917 | |
| 918 | // If the substmt parsed correctly, build the AST node. |
| 919 | if (!Stmt.isInvalid && Tok.getKind() == tok::r_paren) |
| 920 | Result = Actions.ParseStmtExpr(OpenLoc, Stmt.Val, Tok.getLocation()); |
| 921 | |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 922 | } else if (ExprType >= CompoundLiteral && isTypeSpecifierQualifier()) { |
| 923 | // Otherwise, this is a compound literal expression or cast expression. |
| 924 | TypeTy *Ty = ParseTypeName(); |
| 925 | |
| 926 | // Match the ')'. |
| 927 | if (Tok.getKind() == tok::r_paren) |
| 928 | RParenLoc = ConsumeParen(); |
| 929 | else |
| 930 | MatchRHSPunctuation(tok::r_paren, OpenLoc); |
| 931 | |
| 932 | if (Tok.getKind() == tok::l_brace) { |
| 933 | if (!getLang().C99) // Compound literals don't exist in C90. |
| 934 | Diag(OpenLoc, diag::ext_c99_compound_literal); |
| 935 | Result = ParseInitializer(); |
| 936 | ExprType = CompoundLiteral; |
Steve Naroff | 4aa88f8 | 2007-07-19 01:06:55 +0000 | [diff] [blame] | 937 | if (!Result.isInvalid) |
| 938 | return Actions.ParseCompoundLiteral(OpenLoc, Ty, RParenLoc, Result.Val); |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 939 | } else if (ExprType == CastExpr) { |
| 940 | // Note that this doesn't parse the subsequence cast-expression, it just |
| 941 | // returns the parsed type to the callee. |
| 942 | ExprType = CastExpr; |
| 943 | CastTy = Ty; |
| 944 | return ExprResult(false); |
| 945 | } else { |
| 946 | Diag(Tok, diag::err_expected_lbrace_in_compound_literal); |
| 947 | return ExprResult(true); |
| 948 | } |
| 949 | return Result; |
| 950 | } else { |
| 951 | Result = ParseExpression(); |
| 952 | ExprType = SimpleExpr; |
| 953 | if (!Result.isInvalid && Tok.getKind() == tok::r_paren) |
| 954 | Result = Actions.ParseParenExpr(OpenLoc, Tok.getLocation(), Result.Val); |
| 955 | } |
| 956 | |
| 957 | // Match the ')'. |
| 958 | if (Result.isInvalid) |
| 959 | SkipUntil(tok::r_paren); |
| 960 | else { |
| 961 | if (Tok.getKind() == tok::r_paren) |
| 962 | RParenLoc = ConsumeParen(); |
| 963 | else |
| 964 | MatchRHSPunctuation(tok::r_paren, OpenLoc); |
| 965 | } |
| 966 | |
| 967 | return Result; |
| 968 | } |
| 969 | |
| 970 | /// ParseStringLiteralExpression - This handles the various token types that |
| 971 | /// form string literals, and also handles string concatenation [C99 5.1.1.2, |
| 972 | /// translation phase #6]. |
| 973 | /// |
| 974 | /// primary-expression: [C99 6.5.1] |
| 975 | /// string-literal |
| 976 | Parser::ExprResult Parser::ParseStringLiteralExpression() { |
| 977 | assert(isTokenStringLiteral() && "Not a string literal!"); |
| 978 | |
| 979 | // String concat. Note that keywords like __func__ and __FUNCTION__ are not |
| 980 | // considered to be strings for concatenation purposes. |
Chris Lattner | d217773 | 2007-07-20 16:59:19 +0000 | [diff] [blame] | 981 | llvm::SmallVector<Token, 4> StringToks; |
Reid Spencer | 5f016e2 | 2007-07-11 17:01:13 +0000 | [diff] [blame] | 982 | |
| 983 | do { |
| 984 | StringToks.push_back(Tok); |
| 985 | ConsumeStringToken(); |
| 986 | } while (isTokenStringLiteral()); |
| 987 | |
| 988 | // Pass the set of string tokens, ready for concatenation, to the actions. |
| 989 | return Actions.ParseStringLiteral(&StringToks[0], StringToks.size()); |
| 990 | } |