Backreferences

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 1175 matching lines @@
 
 #define FOR_EACH_REG_EXP_NODE_TYPE(VISIT)                            \
   VISIT(Disjunction)                                                 \
   VISIT(Alternative)                                                 \
   VISIT(Assertion)                                                   \
   VISIT(CharacterClass)                                              \
   VISIT(Atom)                                                        \
   VISIT(Quantifier)                                                  \
   VISIT(Capture)                                                     \
   VISIT(Lookahead)                                                   \
+  VISIT(Backreference)                                               \
   VISIT(Empty)
 
 
 class RegExpVisitor;
 template <typename Char> class RegExpNode;
 #define FORWARD_DECLARE(Name) class RegExp##Name;
 FOR_EACH_REG_EXP_NODE_TYPE(FORWARD_DECLARE)
 #undef FORWARD_DECLARE
 
 
@@ skipping 127 matching lines @@
 
 
 class RegExpCapture: public RegExpTree {
  public:
   explicit RegExpCapture(RegExpTree* body)
     : body_(body) { }
   virtual void* Accept(RegExpVisitor* visitor, void* data);
   RegExpTree* body() { return body_; }
  private:
   RegExpTree* body_;
 };

[Lasse Reichstein, 2008/10/28 10:09:52]

Now we have back-references with an index, the capture should hold the matching
index, so we can pair captures and back-references.

 
 
 class RegExpLookahead: public RegExpTree {
  public:
   RegExpLookahead(RegExpTree* body, bool is_positive)
     : body_(body),
       is_positive_(is_positive) { }
   virtual void* Accept(RegExpVisitor* visitor, void* data);
   RegExpTree* body() { return body_; }
   bool is_positive() { return is_positive_; }
  private:
   RegExpTree* body_;
   bool is_positive_;
 };
 
 
+class RegExpBackreference: public RegExpTree {
+ public:
+  explicit RegExpBackreference(int index) : index_(index) { }
+  virtual void* Accept(RegExpVisitor* visitor, void* data);
+  int index() { return index_; }
+ private:
+  int index_;
+};
+
+
 class RegExpEmpty: public RegExpTree {
  public:
   RegExpEmpty() { }
   virtual void* Accept(RegExpVisitor* visitor, void* data);
   static RegExpEmpty* GetInstance() { return &kInstance; }
  private:
   static RegExpEmpty kInstance;
 };
 
 
@@ skipping 45 matching lines @@
 #undef DEF_VISIT
 
  private:
   bool stack_overflow_;
 };
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_AST_H_