Experimental: Fixed bug in RegExp Parser. Added feature counting in parser.

regexp2000/src/ast.h

 // Copyright 2006-2008 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 1280 matching lines @@
     : min_(min),
       max_(max),
       is_greedy_(is_greedy),
       body_(body) { }
   virtual void* Accept(RegExpVisitor* visitor, void* data);
   virtual RegExpQuantifier* AsQuantifier();
   int min() { return min_; }
   int max() { return max_; }
   bool is_greedy() { return is_greedy_; }
   RegExpTree* body() { return body_; }
-  // We just use a very large integer value as infinity because 1^31
+  // We just use a very large integer value as infinity because 2^30
   // is infinite in practice.
-  static const int kInfinity = (1 << 31);
+  static const int kInfinity = (1 << 30);
  private:
   int min_;
   int max_;
   bool is_greedy_;
   RegExpTree* body_;
 };
 
 
 class RegExpCapture: public RegExpTree {
  public:
-  explicit RegExpCapture(RegExpTree* body)
-    : body_(body) { }
+  explicit RegExpCapture(RegExpTree* body, int index)
+    : body_(body), index_(index) { }
   virtual void* Accept(RegExpVisitor* visitor, void* data);
   virtual RegExpCapture* AsCapture();
   RegExpTree* body() { return body_; }
+  int index() { return index_; }
  private:
   RegExpTree* body_;
+  int index_;
 };
 
 
 class RegExpLookahead: public RegExpTree {
  public:
   RegExpLookahead(RegExpTree* body, bool is_positive)
     : body_(body),
       is_positive_(is_positive) { }
   virtual void* Accept(RegExpVisitor* visitor, void* data);
   virtual RegExpLookahead* AsLookahead();
@@ skipping 75 matching lines @@
 #undef DEF_VISIT
 
  private:
   bool stack_overflow_;
 };
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_AST_H_