tools/gn: add "gn help grammar" with formal grammar

tools/gn/parser.h

 // Copyright (c) 2013 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #ifndef TOOLS_GN_PARSER_H_
 #define TOOLS_GN_PARSER_H_
 
 #include <map>
 #include <vector>
 
 #include "base/basictypes.h"
 #include "base/gtest_prod_util.h"
 #include "base/memory/scoped_ptr.h"
 #include "tools/gn/err.h"
 #include "tools/gn/parse_tree.h"
 
 class Parser;
 typedef scoped_ptr<ParseNode> (Parser::*PrefixFunc)(Token token);
 typedef scoped_ptr<ParseNode> (Parser::*InfixFunc)(scoped_ptr<ParseNode> left,
                                                    Token token);
 
+extern const char kSyntax_Help[];
+
 struct ParserHelper {
   PrefixFunc prefix;
   InfixFunc infix;
   int precedence;
 };
 
 // Parses a series of tokens. The resulting AST will refer to the tokens passed
 // to the input, so the tokens an the file data they refer to must outlive your
 // use of the ParseNode.
 class Parser {
@@ skipping 25 matching lines @@
   scoped_ptr<ParseNode> BlockComment(Token token);
 
   // |InfixFunc|s used in parsing expressions.
   scoped_ptr<ParseNode> BinaryOperator(scoped_ptr<ParseNode> left, Token token);
   scoped_ptr<ParseNode> IdentifierOrCall(scoped_ptr<ParseNode> left,
                                          Token token);
   scoped_ptr<ParseNode> Assignment(scoped_ptr<ParseNode> left, Token token);
   scoped_ptr<ParseNode> Subscript(scoped_ptr<ParseNode> left, Token token);
   scoped_ptr<ParseNode> DotOperator(scoped_ptr<ParseNode> left, Token token);
 
-  // Helper to parse a comma separated list, optionally allowing trailing
-  // commas (allowed in [] lists, not in function calls).
+  // Helper to parse a comma separated list.
   scoped_ptr<ListNode> ParseList(Token start_token,
-                                 Token::Type stop_before,
-                                 bool allow_trailing_comma);
+                                 Token::Type stop_before);
 
   scoped_ptr<ParseNode> ParseFile();
   scoped_ptr<ParseNode> ParseStatement();
   scoped_ptr<BlockNode> ParseBlock();
   scoped_ptr<ParseNode> ParseCondition();
 
   // Generates a pre- and post-order traversal of the tree.
   void TraverseOrder(const ParseNode* root,
                      std::vector<const ParseNode*>* pre,
                      std::vector<const ParseNode*>* post);
@@ skipping 35 matching lines @@
   FRIEND_TEST_ALL_PREFIXES(Parser, Expression);
   FRIEND_TEST_ALL_PREFIXES(Parser, FunctionCall);
   FRIEND_TEST_ALL_PREFIXES(Parser, List);
   FRIEND_TEST_ALL_PREFIXES(Parser, ParenExpression);
   FRIEND_TEST_ALL_PREFIXES(Parser, UnaryOp);
 
   DISALLOW_COPY_AND_ASSIGN(Parser);
 };
 
 #endif  // TOOLS_GN_PARSER_H_