/* This file is part of cpp-ethereum. cpp-ethereum is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. cpp-ethereum is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with cpp-ethereum. If not, see . */ /** * @author Christian * @date 2014 * Solidity parser. */ #include #include #include #include #include #include #include using namespace std; namespace dev { namespace solidity { /// AST node factory that also tracks the begin and end position of an AST node /// while it is being parsed class Parser::ASTNodeFactory { public: ASTNodeFactory(Parser const& _parser): m_parser(_parser), m_location(_parser.position(), -1, _parser.sourceName()) {} ASTNodeFactory(Parser const& _parser, ASTPointer const& _childNode): m_parser(_parser), m_location(_childNode->location()) {} void markEndPosition() { m_location.end = m_parser.endPosition(); } void setLocation(SourceLocation const& _location) { m_location = _location; } void setLocationEmpty() { m_location.end = m_location.start; } /// Set the end position to the one of the given node. void setEndPositionFromNode(ASTPointer const& _node) { m_location.end = _node->location().end; } template ASTPointer createNode(Args&& ... _args) { if (m_location.end < 0) markEndPosition(); return make_shared(m_location, forward(_args)...); } private: Parser const& m_parser; SourceLocation m_location; }; ASTPointer Parser::parse(shared_ptr const& _scanner) { try { m_scanner = _scanner; ASTNodeFactory nodeFactory(*this); vector> nodes; while (m_scanner->currentToken() != Token::EOS) { switch (auto token = m_scanner->currentToken()) { case Token::Import: nodes.push_back(parseImportDirective()); break; case Token::Contract: case Token::Library: nodes.push_back(parseContractDefinition(token == Token::Library)); break; default: fatalParserError(string("Expected import directive or contract definition.")); } } return nodeFactory.createNode(nodes); } catch (FatalError const&) { if (m_errors.empty()) throw; // Something is weird here, rather throw again. return nullptr; } } std::shared_ptr const& Parser::sourceName() const { return m_scanner->sourceName(); } int Parser::position() const { return m_scanner->currentLocation().start; } int Parser::endPosition() const { return m_scanner->currentLocation().end; } ASTPointer Parser::parseImportDirective() { // import "abc" [as x]; // import * as x from "abc"; // import {a as b, c} from "abc"; ASTNodeFactory nodeFactory(*this); expectToken(Token::Import); ASTPointer path; ASTPointer unitAlias = make_shared(); vector, ASTPointer>> symbolAliases; if (m_scanner->currentToken() == Token::StringLiteral) { path = getLiteralAndAdvance(); if (m_scanner->currentToken() == Token::As) { m_scanner->next(); unitAlias = expectIdentifierToken(); } } else { if (m_scanner->currentToken() == Token::LBrace) { m_scanner->next(); while (true) { ASTPointer id = parseIdentifier(); ASTPointer alias; if (m_scanner->currentToken() == Token::As) { expectToken(Token::As); alias = expectIdentifierToken(); } symbolAliases.push_back(make_pair(move(id), move(alias))); if (m_scanner->currentToken() != Token::Comma) break; m_scanner->next(); } expectToken(Token::RBrace); } else if (m_scanner->currentToken() == Token::Mul) { m_scanner->next(); expectToken(Token::As); unitAlias = expectIdentifierToken(); } else fatalParserError("Expected string literal (path), \"*\" or alias list."); // "from" is not a keyword but parsed as an identifier because of backwards // compatibility and because it is a really common word. if (m_scanner->currentToken() != Token::Identifier || m_scanner->currentLiteral() != "from") fatalParserError("Expected \"from\"."); m_scanner->next(); if (m_scanner->currentToken() != Token::StringLiteral) fatalParserError("Expected import path."); path = getLiteralAndAdvance(); } nodeFactory.markEndPosition(); expectToken(Token::Semicolon); return nodeFactory.createNode(path, unitAlias, move(symbolAliases)); } ASTPointer Parser::parseContractDefinition(bool _isLibrary) { ASTNodeFactory nodeFactory(*this); ASTPointer docString; if (m_scanner->currentCommentLiteral() != "") docString = make_shared(m_scanner->currentCommentLiteral()); expectToken(_isLibrary ? Token::Library : Token::Contract); ASTPointer name = expectIdentifierToken(); vector> baseContracts; if (m_scanner->currentToken() == Token::Is) do { m_scanner->next(); baseContracts.push_back(parseInheritanceSpecifier()); } while (m_scanner->currentToken() == Token::Comma); vector> subNodes; expectToken(Token::LBrace); while (true) { Token::Value currentTokenValue = m_scanner->currentToken(); string lit = m_scanner->currentLiteral(); if (currentTokenValue == Token::RBrace) break; else if (currentTokenValue == Token::Function) subNodes.push_back(parseFunctionDefinition(name.get())); else if (currentTokenValue == Token::Struct) subNodes.push_back(parseStructDefinition()); else if (currentTokenValue == Token::Enum) subNodes.push_back(parseEnumDefinition()); else if ( currentTokenValue == Token::Identifier || currentTokenValue == Token::Mapping || Token::isElementaryTypeName(currentTokenValue) ) { VarDeclParserOptions options; options.isStateVariable = true; options.allowInitialValue = true; subNodes.push_back(parseVariableDeclaration(options)); expectToken(Token::Semicolon); } else if (currentTokenValue == Token::Modifier) subNodes.push_back(parseModifierDefinition()); else if (currentTokenValue == Token::Event) subNodes.push_back(parseEventDefinition()); else if (currentTokenValue == Token::Using) subNodes.push_back(parseUsingDirective()); else fatalParserError(string("Function, variable, struct or modifier declaration expected.")); } nodeFactory.markEndPosition(); expectToken(Token::RBrace); return nodeFactory.createNode( name, docString, baseContracts, subNodes, _isLibrary ); } ASTPointer Parser::parseInheritanceSpecifier() { ASTNodeFactory nodeFactory(*this); ASTPointer name(parseUserDefinedTypeName()); vector> arguments; if (m_scanner->currentToken() == Token::LParen) { m_scanner->next(); arguments = parseFunctionCallListArguments(); nodeFactory.markEndPosition(); expectToken(Token::RParen); } else nodeFactory.setEndPositionFromNode(name); return nodeFactory.createNode(name, arguments); } Declaration::Visibility Parser::parseVisibilitySpecifier(Token::Value _token) { Declaration::Visibility visibility(Declaration::Visibility::Default); if (_token == Token::Public) visibility = Declaration::Visibility::Public; else if (_token == Token::Internal) visibility = Declaration::Visibility::Internal; else if (_token == Token::Private) visibility = Declaration::Visibility::Private; else if (_token == Token::External) visibility = Declaration::Visibility::External; else solAssert(false, "Invalid visibility specifier."); m_scanner->next(); return visibility; } ASTPointer Parser::parseFunctionDefinition(ASTString const* _contractName) { ASTNodeFactory nodeFactory(*this); ASTPointer docstring; if (m_scanner->currentCommentLiteral() != "") docstring = make_shared(m_scanner->currentCommentLiteral()); expectToken(Token::Function); ASTPointer name; if (m_scanner->currentToken() == Token::LParen) name = make_shared(); // anonymous function else name = expectIdentifierToken(); VarDeclParserOptions options; options.allowLocationSpecifier = true; ASTPointer parameters(parseParameterList(options)); bool isDeclaredConst = false; Declaration::Visibility visibility(Declaration::Visibility::Default); vector> modifiers; while (true) { Token::Value token = m_scanner->currentToken(); if (token == Token::Const) { isDeclaredConst = true; m_scanner->next(); } else if (token == Token::Identifier) modifiers.push_back(parseModifierInvocation()); else if (Token::isVisibilitySpecifier(token)) { if (visibility != Declaration::Visibility::Default) fatalParserError(string("Multiple visibility specifiers.")); visibility = parseVisibilitySpecifier(token); } else break; } ASTPointer returnParameters; if (m_scanner->currentToken() == Token::Returns) { bool const permitEmptyParameterList = false; m_scanner->next(); returnParameters = parseParameterList(options, permitEmptyParameterList); } else returnParameters = createEmptyParameterList(); ASTPointer block = ASTPointer(); nodeFactory.markEndPosition(); if (m_scanner->currentToken() != Token::Semicolon) { block = parseBlock(); nodeFactory.setEndPositionFromNode(block); } else m_scanner->next(); // just consume the ';' bool const c_isConstructor = (_contractName && *name == *_contractName); return nodeFactory.createNode( name, visibility, c_isConstructor, docstring, parameters, isDeclaredConst, modifiers, returnParameters, block ); } ASTPointer Parser::parseStructDefinition() { ASTNodeFactory nodeFactory(*this); expectToken(Token::Struct); ASTPointer name = expectIdentifierToken(); vector> members; expectToken(Token::LBrace); while (m_scanner->currentToken() != Token::RBrace) { members.push_back(parseVariableDeclaration()); expectToken(Token::Semicolon); } nodeFactory.markEndPosition(); expectToken(Token::RBrace); return nodeFactory.createNode(name, members); } ASTPointer Parser::parseEnumValue() { ASTNodeFactory nodeFactory(*this); nodeFactory.markEndPosition(); return nodeFactory.createNode(expectIdentifierToken()); } ASTPointer Parser::parseEnumDefinition() { ASTNodeFactory nodeFactory(*this); expectToken(Token::Enum); ASTPointer name = expectIdentifierToken(); vector> members; expectToken(Token::LBrace); while (m_scanner->currentToken() != Token::RBrace) { members.push_back(parseEnumValue()); if (m_scanner->currentToken() == Token::RBrace) break; expectToken(Token::Comma); if (m_scanner->currentToken() != Token::Identifier) fatalParserError(string("Expected Identifier after ','")); } nodeFactory.markEndPosition(); expectToken(Token::RBrace); return nodeFactory.createNode(name, members); } ASTPointer Parser::parseVariableDeclaration( VarDeclParserOptions const& _options, ASTPointer const& _lookAheadArrayType ) { ASTNodeFactory nodeFactory = _lookAheadArrayType ? ASTNodeFactory(*this, _lookAheadArrayType) : ASTNodeFactory(*this); ASTPointer type; if (_lookAheadArrayType) type = _lookAheadArrayType; else { type = parseTypeName(_options.allowVar); if (type != nullptr) nodeFactory.setEndPositionFromNode(type); } bool isIndexed = false; bool isDeclaredConst = false; Declaration::Visibility visibility(Declaration::Visibility::Default); VariableDeclaration::Location location = VariableDeclaration::Location::Default; ASTPointer identifier; while (true) { Token::Value token = m_scanner->currentToken(); if (_options.isStateVariable && Token::isVariableVisibilitySpecifier(token)) { if (visibility != Declaration::Visibility::Default) fatalParserError(string("Visibility already specified.")); visibility = parseVisibilitySpecifier(token); } else { if (_options.allowIndexed && token == Token::Indexed) isIndexed = true; else if (token == Token::Const) isDeclaredConst = true; else if (_options.allowLocationSpecifier && Token::isLocationSpecifier(token)) { if (location != VariableDeclaration::Location::Default) fatalParserError(string("Location already specified.")); if (!type) fatalParserError(string("Location specifier needs explicit type name.")); location = ( token == Token::Memory ? VariableDeclaration::Location::Memory : VariableDeclaration::Location::Storage ); } else break; m_scanner->next(); } } nodeFactory.markEndPosition(); if (_options.allowEmptyName && m_scanner->currentToken() != Token::Identifier) { identifier = make_shared(""); solAssert(type != nullptr, ""); nodeFactory.setEndPositionFromNode(type); } else identifier = expectIdentifierToken(); ASTPointer value; if (_options.allowInitialValue) { if (m_scanner->currentToken() == Token::Assign) { m_scanner->next(); value = parseExpression(); nodeFactory.setEndPositionFromNode(value); } } return nodeFactory.createNode( type, identifier, value, visibility, _options.isStateVariable, isIndexed, isDeclaredConst, location ); } ASTPointer Parser::parseModifierDefinition() { ScopeGuard resetModifierFlag([this]() { m_insideModifier = false; }); m_insideModifier = true; ASTNodeFactory nodeFactory(*this); ASTPointer docstring; if (m_scanner->currentCommentLiteral() != "") docstring = make_shared(m_scanner->currentCommentLiteral()); expectToken(Token::Modifier); ASTPointer name(expectIdentifierToken()); ASTPointer parameters; if (m_scanner->currentToken() == Token::LParen) { VarDeclParserOptions options; options.allowIndexed = true; options.allowLocationSpecifier = true; parameters = parseParameterList(options); } else parameters = createEmptyParameterList(); ASTPointer block = parseBlock(); nodeFactory.setEndPositionFromNode(block); return nodeFactory.createNode(name, docstring, parameters, block); } ASTPointer Parser::parseEventDefinition() { ASTNodeFactory nodeFactory(*this); ASTPointer docstring; if (m_scanner->currentCommentLiteral() != "") docstring = make_shared(m_scanner->currentCommentLiteral()); expectToken(Token::Event); ASTPointer name(expectIdentifierToken()); ASTPointer parameters; if (m_scanner->currentToken() == Token::LParen) { VarDeclParserOptions options; options.allowIndexed = true; parameters = parseParameterList(options); } else parameters = createEmptyParameterList(); bool anonymous = false; if (m_scanner->currentToken() == Token::Anonymous) { anonymous = true; m_scanner->next(); } nodeFactory.markEndPosition(); expectToken(Token::Semicolon); return nodeFactory.createNode(name, docstring, parameters, anonymous); } ASTPointer Parser::parseUsingDirective() { ASTNodeFactory nodeFactory(*this); expectToken(Token::Using); ASTPointer library(parseUserDefinedTypeName()); ASTPointer typeName; expectToken(Token::For); if (m_scanner->currentToken() == Token::Mul) m_scanner->next(); else typeName = parseTypeName(false); nodeFactory.markEndPosition(); expectToken(Token::Semicolon); return nodeFactory.createNode(library, typeName); } ASTPointer Parser::parseModifierInvocation() { ASTNodeFactory nodeFactory(*this); ASTPointer name(parseIdentifier()); vector> arguments; if (m_scanner->currentToken() == Token::LParen) { m_scanner->next(); arguments = parseFunctionCallListArguments(); nodeFactory.markEndPosition(); expectToken(Token::RParen); } else nodeFactory.setEndPositionFromNode(name); return nodeFactory.createNode(name, arguments); } ASTPointer Parser::parseIdentifier() { ASTNodeFactory nodeFactory(*this); nodeFactory.markEndPosition(); return nodeFactory.createNode(expectIdentifierToken()); } ASTPointer Parser::parseUserDefinedTypeName() { ASTNodeFactory nodeFactory(*this); nodeFactory.markEndPosition(); vector identifierPath{*expectIdentifierToken()}; while (m_scanner->currentToken() == Token::Period) { m_scanner->next(); nodeFactory.markEndPosition(); identifierPath.push_back(*expectIdentifierToken()); } return nodeFactory.createNode(identifierPath); } ASTPointer Parser::parseTypeName(bool _allowVar) { ASTNodeFactory nodeFactory(*this); ASTPointer type; Token::Value token = m_scanner->currentToken(); if (Token::isElementaryTypeName(token)) { ElementaryTypeNameToken elemTypeName(token, m_scanner->currentTokenInfo()); type = ASTNodeFactory(*this).createNode(elemTypeName); m_scanner->next(); } else if (token == Token::Var) { if (!_allowVar) fatalParserError(string("Expected explicit type name.")); m_scanner->next(); } else if (token == Token::Mapping) type = parseMapping(); else if (token == Token::Identifier) type = parseUserDefinedTypeName(); else fatalParserError(string("Expected type name")); if (type) // Parse "[...]" postfixes for arrays. while (m_scanner->currentToken() == Token::LBrack) { m_scanner->next(); ASTPointer length; if (m_scanner->currentToken() != Token::RBrack) length = parseExpression(); nodeFactory.markEndPosition(); expectToken(Token::RBrack); type = nodeFactory.createNode(type, length); } return type; } ASTPointer Parser::parseMapping() { ASTNodeFactory nodeFactory(*this); expectToken(Token::Mapping); expectToken(Token::LParen); ASTPointer keyType; if (Token::isElementaryTypeName(m_scanner->currentToken())) keyType = ASTNodeFactory(*this).createNode (ElementaryTypeNameToken(m_scanner->currentToken(), m_scanner->currentTokenInfo())); else fatalParserError(string("Expected elementary type name for mapping key type")); m_scanner->next(); expectToken(Token::Arrow); bool const allowVar = false; ASTPointer valueType = parseTypeName(allowVar); nodeFactory.markEndPosition(); expectToken(Token::RParen); return nodeFactory.createNode(keyType, valueType); } ASTPointer Parser::parseParameterList( VarDeclParserOptions const& _options, bool _allowEmpty ) { ASTNodeFactory nodeFactory(*this); vector> parameters; VarDeclParserOptions options(_options); options.allowEmptyName = true; expectToken(Token::LParen); if (!_allowEmpty || m_scanner->currentToken() != Token::RParen) { parameters.push_back(parseVariableDeclaration(options)); while (m_scanner->currentToken() != Token::RParen) { expectToken(Token::Comma); parameters.push_back(parseVariableDeclaration(options)); } } nodeFactory.markEndPosition(); m_scanner->next(); return nodeFactory.createNode(parameters); } ASTPointer Parser::parseBlock(ASTPointer const& _docString) { ASTNodeFactory nodeFactory(*this); expectToken(Token::LBrace); vector> statements; while (m_scanner->currentToken() != Token::RBrace) statements.push_back(parseStatement()); nodeFactory.markEndPosition(); expectToken(Token::RBrace); return nodeFactory.createNode(_docString, statements); } ASTPointer Parser::parseStatement() { ASTPointer docString; if (m_scanner->currentCommentLiteral() != "") docString = make_shared(m_scanner->currentCommentLiteral()); ASTPointer statement; switch (m_scanner->currentToken()) { case Token::If: return parseIfStatement(docString); case Token::While: return parseWhileStatement(docString); case Token::For: return parseForStatement(docString); case Token::LBrace: return parseBlock(docString); // starting from here, all statements must be terminated by a semicolon case Token::Continue: statement = ASTNodeFactory(*this).createNode(docString); m_scanner->next(); break; case Token::Break: statement = ASTNodeFactory(*this).createNode(docString); m_scanner->next(); break; case Token::Return: { ASTNodeFactory nodeFactory(*this); ASTPointer expression; if (m_scanner->next() != Token::Semicolon) { expression = parseExpression(); nodeFactory.setEndPositionFromNode(expression); } statement = nodeFactory.createNode(docString, expression); break; } case Token::Throw: { statement = ASTNodeFactory(*this).createNode(docString); m_scanner->next(); break; } case Token::Identifier: if (m_insideModifier && m_scanner->currentLiteral() == "_") { statement = ASTNodeFactory(*this).createNode(docString); m_scanner->next(); return statement; } // fall-through default: statement = parseSimpleStatement(docString); } expectToken(Token::Semicolon); return statement; } ASTPointer Parser::parseIfStatement(ASTPointer const& _docString) { ASTNodeFactory nodeFactory(*this); expectToken(Token::If); expectToken(Token::LParen); ASTPointer condition = parseExpression(); expectToken(Token::RParen); ASTPointer trueBody = parseStatement(); ASTPointer falseBody; if (m_scanner->currentToken() == Token::Else) { m_scanner->next(); falseBody = parseStatement(); nodeFactory.setEndPositionFromNode(falseBody); } else nodeFactory.setEndPositionFromNode(trueBody); return nodeFactory.createNode(_docString, condition, trueBody, falseBody); } ASTPointer Parser::parseWhileStatement(ASTPointer const& _docString) { ASTNodeFactory nodeFactory(*this); expectToken(Token::While); expectToken(Token::LParen); ASTPointer condition = parseExpression(); expectToken(Token::RParen); ASTPointer body = parseStatement(); nodeFactory.setEndPositionFromNode(body); return nodeFactory.createNode(_docString, condition, body); } ASTPointer Parser::parseForStatement(ASTPointer const& _docString) { ASTNodeFactory nodeFactory(*this); ASTPointer initExpression; ASTPointer conditionExpression; ASTPointer loopExpression; expectToken(Token::For); expectToken(Token::LParen); // LTODO: Maybe here have some predicate like peekExpression() instead of checking for semicolon and RParen? if (m_scanner->currentToken() != Token::Semicolon) initExpression = parseSimpleStatement(ASTPointer()); expectToken(Token::Semicolon); if (m_scanner->currentToken() != Token::Semicolon) conditionExpression = parseExpression(); expectToken(Token::Semicolon); if (m_scanner->currentToken() != Token::RParen) loopExpression = parseExpressionStatement(ASTPointer()); expectToken(Token::RParen); ASTPointer body = parseStatement(); nodeFactory.setEndPositionFromNode(body); return nodeFactory.createNode( _docString, initExpression, conditionExpression, loopExpression, body ); } ASTPointer Parser::parseSimpleStatement(ASTPointer const& _docString) { // These two cases are very hard to distinguish: // x[7 * 20 + 3] a; - x[7 * 20 + 3] = 9; // In the first case, x is a type name, in the second it is the name of a variable. // As an extension, we can even have: // `x.y.z[1][2] a;` and `x.y.z[1][2] = 10;` // Where in the first, x.y.z leads to a type name where in the second, it accesses structs. switch (peekStatementType()) { case LookAheadInfo::VariableDeclarationStatement: return parseVariableDeclarationStatement(_docString); case LookAheadInfo::ExpressionStatement: return parseExpressionStatement(_docString); default: break; } // At this point, we have 'Identifier "["' or 'Identifier "." Identifier' or 'ElementoryTypeName "["'. // We parse '(Identifier ("." Identifier)* |ElementaryTypeName) ( "[" Expression "]" )+' // until we can decide whether to hand this over to ExpressionStatement or create a // VariableDeclarationStatement out of it. vector> path; bool startedWithElementary = false; if (m_scanner->currentToken() == Token::Identifier) path.push_back(parseIdentifier()); else { startedWithElementary = true; ElementaryTypeNameToken elemToken(m_scanner->currentToken(), m_scanner->currentTokenInfo()); path.push_back(ASTNodeFactory(*this).createNode(elemToken)); m_scanner->next(); } while (!startedWithElementary && m_scanner->currentToken() == Token::Period) { m_scanner->next(); path.push_back(parseIdentifier()); } vector, SourceLocation>> indices; while (m_scanner->currentToken() == Token::LBrack) { expectToken(Token::LBrack); ASTPointer index; if (m_scanner->currentToken() != Token::RBrack) index = parseExpression(); SourceLocation indexLocation = path.front()->location(); indexLocation.end = endPosition(); indices.push_back(make_pair(index, indexLocation)); expectToken(Token::RBrack); } if (m_scanner->currentToken() == Token::Identifier || Token::isLocationSpecifier(m_scanner->currentToken())) return parseVariableDeclarationStatement(_docString, typeNameIndexAccessStructure(path, indices)); else return parseExpressionStatement(_docString, expressionFromIndexAccessStructure(path, indices)); } ASTPointer Parser::parseVariableDeclarationStatement( ASTPointer const& _docString, ASTPointer const& _lookAheadArrayType ) { ASTNodeFactory nodeFactory(*this); if (_lookAheadArrayType) nodeFactory.setLocation(_lookAheadArrayType->location()); vector> variables; ASTPointer value; if ( !_lookAheadArrayType && m_scanner->currentToken() == Token::Var && m_scanner->peekNextToken() == Token::LParen ) { // Parse `var (a, b, ,, c) = ...` into a single VariableDeclarationStatement with multiple variables. m_scanner->next(); m_scanner->next(); if (m_scanner->currentToken() != Token::RParen) while (true) { ASTPointer var; if ( m_scanner->currentToken() != Token::Comma && m_scanner->currentToken() != Token::RParen ) { ASTNodeFactory varDeclNodeFactory(*this); varDeclNodeFactory.markEndPosition(); ASTPointer name = expectIdentifierToken(); var = varDeclNodeFactory.createNode( ASTPointer(), name, ASTPointer(), VariableDeclaration::Visibility::Default ); } variables.push_back(var); if (m_scanner->currentToken() == Token::RParen) break; else expectToken(Token::Comma); } nodeFactory.markEndPosition(); m_scanner->next(); } else { VarDeclParserOptions options; options.allowVar = true; options.allowLocationSpecifier = true; variables.push_back(parseVariableDeclaration(options, _lookAheadArrayType)); } if (m_scanner->currentToken() == Token::Assign) { m_scanner->next(); value = parseExpression(); nodeFactory.setEndPositionFromNode(value); } return nodeFactory.createNode(_docString, variables, value); } ASTPointer Parser::parseExpressionStatement( ASTPointer const& _docString, ASTPointer const& _lookAheadIndexAccessStructure ) { ASTPointer expression = parseExpression(_lookAheadIndexAccessStructure); return ASTNodeFactory(*this, expression).createNode(_docString, expression); } ASTPointer Parser::parseExpression( ASTPointer const& _lookAheadIndexAccessStructure ) { ASTPointer expression = parseBinaryExpression(4, _lookAheadIndexAccessStructure); if (Token::isAssignmentOp(m_scanner->currentToken())) { Token::Value assignmentOperator = expectAssignmentOperator(); ASTPointer rightHandSide = parseExpression(); ASTNodeFactory nodeFactory(*this, expression); nodeFactory.setEndPositionFromNode(rightHandSide); return nodeFactory.createNode(expression, assignmentOperator, rightHandSide); } else if (m_scanner->currentToken() == Token::Value::Conditional) { m_scanner->next(); ASTPointer trueExpression = parseExpression(); expectToken(Token::Colon); ASTPointer falseExpression = parseExpression(); ASTNodeFactory nodeFactory(*this, expression); nodeFactory.setEndPositionFromNode(falseExpression); return nodeFactory.createNode(expression, trueExpression, falseExpression); } else return expression; } ASTPointer Parser::parseBinaryExpression( int _minPrecedence, ASTPointer const& _lookAheadIndexAccessStructure ) { ASTPointer expression = parseUnaryExpression(_lookAheadIndexAccessStructure); ASTNodeFactory nodeFactory(*this, expression); int precedence = Token::precedence(m_scanner->currentToken()); for (; precedence >= _minPrecedence; --precedence) while (Token::precedence(m_scanner->currentToken()) == precedence) { Token::Value op = m_scanner->currentToken(); m_scanner->next(); ASTPointer right = parseBinaryExpression(precedence + 1); nodeFactory.setEndPositionFromNode(right); expression = nodeFactory.createNode(expression, op, right); } return expression; } ASTPointer Parser::parseUnaryExpression( ASTPointer const& _lookAheadIndexAccessStructure ) { ASTNodeFactory nodeFactory = _lookAheadIndexAccessStructure ? ASTNodeFactory(*this, _lookAheadIndexAccessStructure) : ASTNodeFactory(*this); Token::Value token = m_scanner->currentToken(); if (!_lookAheadIndexAccessStructure && (Token::isUnaryOp(token) || Token::isCountOp(token))) { // prefix expression m_scanner->next(); ASTPointer subExpression = parseUnaryExpression(); nodeFactory.setEndPositionFromNode(subExpression); return nodeFactory.createNode(token, subExpression, true); } else { // potential postfix expression ASTPointer subExpression = parseLeftHandSideExpression(_lookAheadIndexAccessStructure); token = m_scanner->currentToken(); if (!Token::isCountOp(token)) return subExpression; nodeFactory.markEndPosition(); m_scanner->next(); return nodeFactory.createNode(token, subExpression, false); } } ASTPointer Parser::parseLeftHandSideExpression( ASTPointer const& _lookAheadIndexAccessStructure ) { ASTNodeFactory nodeFactory = _lookAheadIndexAccessStructure ? ASTNodeFactory(*this, _lookAheadIndexAccessStructure) : ASTNodeFactory(*this); ASTPointer expression; if (_lookAheadIndexAccessStructure) expression = _lookAheadIndexAccessStructure; else if (m_scanner->currentToken() == Token::New) { expectToken(Token::New); ASTPointer contractName(parseTypeName(false)); nodeFactory.setEndPositionFromNode(contractName); expression = nodeFactory.createNode(contractName); } else expression = parsePrimaryExpression(); while (true) { switch (m_scanner->currentToken()) { case Token::LBrack: { m_scanner->next(); ASTPointer index; if (m_scanner->currentToken() != Token::RBrack) index = parseExpression(); nodeFactory.markEndPosition(); expectToken(Token::RBrack); expression = nodeFactory.createNode(expression, index); } break; case Token::Period: { m_scanner->next(); nodeFactory.markEndPosition(); expression = nodeFactory.createNode(expression, expectIdentifierToken()); } break; case Token::LParen: { m_scanner->next(); vector> arguments; vector> names; std::tie(arguments, names) = parseFunctionCallArguments(); nodeFactory.markEndPosition(); expectToken(Token::RParen); expression = nodeFactory.createNode(expression, arguments, names); } break; default: return expression; } } } ASTPointer Parser::parsePrimaryExpression() { ASTNodeFactory nodeFactory(*this); Token::Value token = m_scanner->currentToken(); ASTPointer expression; switch (token) { case Token::TrueLiteral: case Token::FalseLiteral: nodeFactory.markEndPosition(); expression = nodeFactory.createNode(token, getLiteralAndAdvance()); break; case Token::Number: if (Token::isEtherSubdenomination(m_scanner->peekNextToken())) { ASTPointer literal = getLiteralAndAdvance(); nodeFactory.markEndPosition(); Literal::SubDenomination subdenomination = static_cast(m_scanner->currentToken()); m_scanner->next(); expression = nodeFactory.createNode(token, literal, subdenomination); break; } if (Token::isTimeSubdenomination(m_scanner->peekNextToken())) { ASTPointer literal = getLiteralAndAdvance(); nodeFactory.markEndPosition(); Literal::SubDenomination subdenomination = static_cast(m_scanner->currentToken()); m_scanner->next(); expression = nodeFactory.createNode(token, literal, subdenomination); break; } // fall-through case Token::StringLiteral: nodeFactory.markEndPosition(); expression = nodeFactory.createNode(token, getLiteralAndAdvance()); break; case Token::Identifier: nodeFactory.markEndPosition(); expression = nodeFactory.createNode(getLiteralAndAdvance()); break; case Token::LParen: case Token::LBrack: { // 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> components; 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() != oppositeToken) components.push_back(parseExpression()); else if (isArray) parserError("Expected expression (inline array elements cannot be omitted)."); else components.push_back(ASTPointer()); if (m_scanner->currentToken() == oppositeToken) break; else if (m_scanner->currentToken() == Token::Comma) m_scanner->next(); } nodeFactory.markEndPosition(); expectToken(oppositeToken); return nodeFactory.createNode(components, isArray); } default: if (Token::isElementaryTypeName(token)) { ElementaryTypeNameToken elementaryExpression(m_scanner->currentToken(), m_scanner->currentTokenInfo()); expression = nodeFactory.createNode(elementaryExpression); m_scanner->next(); } else fatalParserError(string("Expected primary expression.")); break; } return expression; } vector> Parser::parseFunctionCallListArguments() { vector> arguments; if (m_scanner->currentToken() != Token::RParen) { arguments.push_back(parseExpression()); while (m_scanner->currentToken() != Token::RParen) { expectToken(Token::Comma); arguments.push_back(parseExpression()); } } return arguments; } pair>, vector>> Parser::parseFunctionCallArguments() { pair>, vector>> ret; Token::Value token = m_scanner->currentToken(); if (token == Token::LBrace) { // call({arg1 : 1, arg2 : 2 }) expectToken(Token::LBrace); while (m_scanner->currentToken() != Token::RBrace) { ret.second.push_back(expectIdentifierToken()); expectToken(Token::Colon); ret.first.push_back(parseExpression()); if (m_scanner->currentToken() == Token::Comma) expectToken(Token::Comma); else break; } expectToken(Token::RBrace); } else ret.first = parseFunctionCallListArguments(); return ret; } Parser::LookAheadInfo Parser::peekStatementType() const { // Distinguish between variable declaration (and potentially assignment) and expression statement // (which include assignments to other expressions and pre-declared variables). // We have a variable declaration if we get a keyword that specifies a type name. // If it is an identifier or an elementary type name followed by an identifier, we also have // a variable declaration. // If we get an identifier followed by a "[" or ".", it can be both ("lib.type[9] a;" or "variable.el[9] = 7;"). // In all other cases, we have an expression statement. Token::Value token(m_scanner->currentToken()); bool mightBeTypeName = (Token::isElementaryTypeName(token) || token == Token::Identifier); if (token == Token::Mapping || token == Token::Var) return LookAheadInfo::VariableDeclarationStatement; if (mightBeTypeName) { Token::Value next = m_scanner->peekNextToken(); if (next == Token::Identifier || Token::isLocationSpecifier(next)) return LookAheadInfo::VariableDeclarationStatement; if (next == Token::LBrack || next == Token::Period) return LookAheadInfo::IndexAccessStructure; } return LookAheadInfo::ExpressionStatement; } ASTPointer Parser::typeNameIndexAccessStructure( vector> const& _path, vector, SourceLocation>> const& _indices ) { solAssert(!_path.empty(), ""); ASTNodeFactory nodeFactory(*this); SourceLocation location = _path.front()->location(); location.end = _path.back()->location().end; nodeFactory.setLocation(location); ASTPointer type; if (auto typeName = dynamic_cast(_path.front().get())) { solAssert(_path.size() == 1, ""); type = nodeFactory.createNode(typeName->typeName()); } else { vector path; for (auto const& el: _path) path.push_back(dynamic_cast(*el).name()); type = nodeFactory.createNode(path); } for (auto const& lengthExpression: _indices) { nodeFactory.setLocation(lengthExpression.second); type = nodeFactory.createNode(type, lengthExpression.first); } return type; } ASTPointer Parser::expressionFromIndexAccessStructure( vector> const& _path, vector, SourceLocation>> const& _indices ) { solAssert(!_path.empty(), ""); ASTNodeFactory nodeFactory(*this, _path.front()); ASTPointer expression(_path.front()); for (size_t i = 1; i < _path.size(); ++i) { SourceLocation location(_path.front()->location()); location.end = _path[i]->location().end; nodeFactory.setLocation(location); Identifier const& identifier = dynamic_cast(*_path[i]); expression = nodeFactory.createNode( expression, make_shared(identifier.name()) ); } for (auto const& index: _indices) { nodeFactory.setLocation(index.second); expression = nodeFactory.createNode(expression, index.first); } return expression; } void Parser::expectToken(Token::Value _value) { if (m_scanner->currentToken() != _value) fatalParserError( string("Expected token ") + string(Token::name(_value)) + string(" got '") + string(Token::name(m_scanner->currentToken())) + string("'") ); m_scanner->next(); } Token::Value Parser::expectAssignmentOperator() { Token::Value op = m_scanner->currentToken(); if (!Token::isAssignmentOp(op)) fatalParserError( string("Expected assignment operator, got '") + string(Token::name(m_scanner->currentToken())) + string("'") ); m_scanner->next(); return op; } ASTPointer Parser::expectIdentifierToken() { if (m_scanner->currentToken() != Token::Identifier) fatalParserError( string("Expected identifier, got '") + string(Token::name(m_scanner->currentToken())) + string("'") ); return getLiteralAndAdvance(); } ASTPointer Parser::getLiteralAndAdvance() { ASTPointer identifier = make_shared(m_scanner->currentLiteral()); m_scanner->next(); return identifier; } ASTPointer Parser::createEmptyParameterList() { ASTNodeFactory nodeFactory(*this); nodeFactory.setLocationEmpty(); return nodeFactory.createNode(vector>()); } void Parser::parserError(string const& _description) { auto err = make_shared(Error::Type::ParserError); *err << errinfo_sourceLocation(SourceLocation(position(), position(), sourceName())) << errinfo_comment(_description); m_errors.push_back(err); } void Parser::fatalParserError(string const& _description) { parserError(_description); BOOST_THROW_EXCEPTION(FatalError()); } } }