Compile warning-clean again

Author: hsutter

source/cppfront.cpp

@@ -871,7 +871,7 @@ class cppfront
     class current_functions_
     {
         std::vector<function_info> list = { {} };
-        const int MaxNestedFunctions = 100;         // see the next comment and the assertion:
+        const size_t MaxNestedFunctions = 100;      // see the next comment and the assertion:
     public:
         current_functions_() {
             list.reserve(MaxNestedFunctions);       // (1) for pointer stability / lifetime safety

source/lex.h

@@ -1224,7 +1224,7 @@ auto lex_line(
                 //G     decimal-literal ''' digit [uU][lL][lL]
                 //G
                 //G floating-point-literal:
-                //G     digit { ' | digit }* (. digit { ' | digit }*)? ([eE][-+]?digit { ' | digit }*) [fFlL]
+                //G     digit { ' | digit }* . digit ({ ' | digit }*)? ([eE][-+]?digit { ' | digit }*) [fFlL]
                 //G
                 //G TODO full grammar & refactor to utility functions with their
                 //G      own unit test rather than inline everything here
@@ -1247,7 +1247,7 @@ auto lex_line(
                         // and be error checked. Best would be to slurp all
                         // [a-zA-Z] and then validate against a list of
                         // allowed suffixes. Ideally handle the C++23 size
-                        // suffixes aswell.
+                        // suffixes as well.
                         if (peek(j) == 'u' || peek(j) == 'U') { ++j; }
                         if (peek(j) == 'l' || peek(j) == 'L') { ++j; }
                         if (peek(j) == 'l' || peek(j) == 'L') { ++j; }

source/parse.h

@@ -102,7 +102,7 @@ auto is_assignment_operator(lexeme l)
 //
 
 //-----------------------------------------------------------------------
-//  try_emit
+//  try_visit
 //
 //  Helper to visit whatever is in a variant where each
 //  alternative is a smart pointer
@@ -4667,12 +4667,12 @@ class parser
 
             //  So we can create the typeid_id_node and its unqualified_id_node
 
-            auto id = std::make_unique<unqualified_id_node>();
-            id->identifier = &generated_tokens_->back();
+            auto gen_id = std::make_unique<unqualified_id_node>();
+            gen_id->identifier = &generated_tokens_->back();
 
             auto type = std::make_unique<type_id_node>();
             type->pos = start;
-            type->id = std::move(id);
+            type->id = std::move(gen_id);
 
             n->type = std::move(type);
             assert (n->is_object());