diff options
author | chriseth <c@ethdev.com> | 2015-12-17 08:21:22 +0800 |
---|---|---|
committer | chriseth <c@ethdev.com> | 2015-12-17 08:21:22 +0800 |
commit | eb11c7f43f2fdfe608716db8cf58775bc22ad440 (patch) | |
tree | f00e1a47c786cc4eaae63c8860a8652e22030779 /libsolidity/parsing | |
parent | 591a4f1ff44af20fce9bafebf0fa0607e2bdfcc0 (diff) | |
parent | ed1dd50acda058a9c0c5b9c43776fba3642e23e2 (diff) | |
download | dexon-solidity-eb11c7f43f2fdfe608716db8cf58775bc22ad440.tar dexon-solidity-eb11c7f43f2fdfe608716db8cf58775bc22ad440.tar.gz dexon-solidity-eb11c7f43f2fdfe608716db8cf58775bc22ad440.tar.bz2 dexon-solidity-eb11c7f43f2fdfe608716db8cf58775bc22ad440.tar.lz dexon-solidity-eb11c7f43f2fdfe608716db8cf58775bc22ad440.tar.xz dexon-solidity-eb11c7f43f2fdfe608716db8cf58775bc22ad440.tar.zst dexon-solidity-eb11c7f43f2fdfe608716db8cf58775bc22ad440.zip |
Merge pull request #305 from VoR0220/inlineArrays
Parsing for Inline Arrays is passing
Diffstat (limited to 'libsolidity/parsing')
-rw-r--r-- | libsolidity/parsing/Parser.cpp | 22 |
1 files changed, 15 insertions, 7 deletions
diff --git a/libsolidity/parsing/Parser.cpp b/libsolidity/parsing/Parser.cpp index 2b886121..caf38b1d 100644 --- a/libsolidity/parsing/Parser.cpp +++ b/libsolidity/parsing/Parser.cpp @@ -1035,27 +1035,35 @@ ASTPointer<Expression> Parser::parsePrimaryExpression() expression = nodeFactory.createNode<Identifier>(getLiteralAndAdvance()); break; case Token::LParen: + case Token::LBrack: { - // Tuple or parenthesized expression. - // Special cases: () is empty tuple type, (x) is not a real tuple, (x,) is one-dimensional tuple + // Tuple/parenthesized expression or inline array/bracketed expression. + // Special cases: ()/[] is empty tuple/array type, (x) is not a real tuple, + // (x,) is one-dimensional tuple, elements in arrays cannot be left out, only in tuples. m_scanner->next(); vector<ASTPointer<Expression>> components; - if (m_scanner->currentToken() != Token::RParen) + Token::Value oppositeToken = (token == Token::LParen ? Token::RParen : Token::RBrack); + bool isArray = (token == Token::LBrack); + + if (m_scanner->currentToken() != oppositeToken) while (true) { - if (m_scanner->currentToken() != Token::Comma && m_scanner->currentToken() != Token::RParen) + if (m_scanner->currentToken() != Token::Comma && m_scanner->currentToken() != oppositeToken) components.push_back(parseExpression()); + else if (isArray) + parserError("Expected expression (inline array elements cannot be omitted)."); else components.push_back(ASTPointer<Expression>()); - if (m_scanner->currentToken() == Token::RParen) + if (m_scanner->currentToken() == oppositeToken) break; else if (m_scanner->currentToken() == Token::Comma) m_scanner->next(); } nodeFactory.markEndPosition(); - expectToken(Token::RParen); - return nodeFactory.createNode<TupleExpression>(components); + expectToken(oppositeToken); + return nodeFactory.createNode<TupleExpression>(components, isArray); } + default: if (Token::isElementaryTypeName(token)) { |