2004-09-24 Paolo Bonzini <bonzini@gnu.org>

	* parser.c (cp_parser_expression_stack): Clarify why it is
	an array of NUM_PREC_VALUES elements.
	(cp_parser_binary_expression): Clarify why we do not need to
	handle stack overflow.

git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@88042 138bc75d-0d04-0410-961f-82ee72b054a4

diff --git a/gcc/cp/ChangeLog b/gcc/cp/ChangeLog
index 80c2b79..dee8d5a 100644 (file)
--- a/gcc/cp/ChangeLog
+++ b/gcc/cp/ChangeLog
@@ -1,3 +1,10 @@
+2004-09-24  Paolo Bonzini  <bonzini@gnu.org>
+
+       * parser.c (cp_parser_expression_stack): Clarify why it is
+       an array of NUM_PREC_VALUES elements.
+       (cp_parser_binary_expression): Clarify why we do not need to
+       handle stack overflow.
+
 2004-09-24  Nathan Sidwell  <nathan@codesourcery.com>
 
        PR c++/16889

diff --git a/gcc/cp/parser.c b/gcc/cp/parser.c
index 49d0237..89a9601 100644 (file)
--- a/gcc/cp/parser.c
+++ b/gcc/cp/parser.c
@@ -1106,6 +1106,9 @@ typedef struct cp_parser_expression_stack_entry
   int prec;
 } cp_parser_expression_stack_entry;
 
+/* The stack for storing partial expressions.  We only need NUM_PREC_VALUES
+   entries because precedence levels on the stack are monotonically
+   increasing.  */
 typedef struct cp_parser_expression_stack_entry
   cp_parser_expression_stack[NUM_PREC_VALUES];
 
@@ -5356,7 +5359,9 @@ cp_parser_binary_expression (cp_parser* parser)
       if (lookahead_prec > new_prec)
         {
           /* ... and prepare to parse the RHS of the new, higher priority
-             expression.  */
+             expression.  Since precedence levels on the stack are
+            monotonically increasing, we do not have to care about
+            stack overflows.  */
           sp->prec = prec;
           sp->tree_type = tree_type;
           sp->lhs = lhs;