Commit 4852bef2 authored by lrn@chromium.org's avatar lrn@chromium.org

Issue 246 - wait until regexp is parsed to detect whether it's simple.

git-svn-id: http://v8.googlecode.com/svn/branches/bleeding_edge@1412 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent 6ef7ef65
...@@ -3606,7 +3606,7 @@ RegExpParser::RegExpParser(FlatStringReader* in, ...@@ -3606,7 +3606,7 @@ RegExpParser::RegExpParser(FlatStringReader* in,
next_pos_(0), next_pos_(0),
in_(in), in_(in),
error_(error), error_(error),
simple_(true), simple_(false),
contains_anchor_(false), contains_anchor_(false),
captures_(NULL), captures_(NULL),
is_scanned_for_captures_(false), is_scanned_for_captures_(false),
...@@ -3676,6 +3676,11 @@ RegExpTree* RegExpParser::ParsePattern() { ...@@ -3676,6 +3676,11 @@ RegExpTree* RegExpParser::ParsePattern() {
if (has_more()) { if (has_more()) {
ReportError(CStrVector("Unmatched ')'") CHECK_FAILED); ReportError(CStrVector("Unmatched ')'") CHECK_FAILED);
} }
// If the result of parsing is a literal string atom, and it has the
// same length as the input, then the atom is identical to the input.
if (result->IsAtom() && result->AsAtom()->length() == in()->length()) {
simple_ = true;
}
return result; return result;
} }
...@@ -3875,7 +3880,6 @@ RegExpTree* RegExpParser::ParseDisjunction() { ...@@ -3875,7 +3880,6 @@ RegExpTree* RegExpParser::ParseDisjunction() {
Advance(2); Advance(2);
break; break;
} }
simple_ = false;
break; break;
case '{': { case '{': {
int dummy; int dummy;
...@@ -3932,7 +3936,6 @@ RegExpTree* RegExpParser::ParseDisjunction() { ...@@ -3932,7 +3936,6 @@ RegExpTree* RegExpParser::ParseDisjunction() {
is_greedy = false; is_greedy = false;
Advance(); Advance();
} }
simple_ = false; // Adding quantifier might *remove* look-ahead.
builder.AddQuantifierToAtom(min, max, is_greedy); builder.AddQuantifierToAtom(min, max, is_greedy);
} }
} }
......
// Copyright 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
// with the distribution.
// * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
// See: http://code.google.com/p/v8/issues/detail?id=246
assertTrue(/(?:text)/.test("text"));
assertEquals(["text"], /(?:text)/.exec("text"));
\ No newline at end of file
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment