Experimental regexp: Use new RegExp parser to test syntax.

regexp2000/src/parser.cc

 // 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 3802 matching lines @@
   } else {
     Advance();
     return CharacterRange::Singleton(first);
   }
 }
 
 
 RegExpTree* RegExpParser::ParseCharacterClass(bool* ok) {
   static const char* kUnterminated = "Unterminated character class";
   static const char* kIllegal = "Illegal character class";
+  static const char* kRangeOutOfOrder = "Range out of order in character class";
 
   ASSERT_EQ(current(), '[');
   Advance();
   bool is_negated = false;
   if (current() == '^') {
     is_negated = true;
     Advance();
   }
   ZoneList<CharacterRange>* ranges = new ZoneList<CharacterRange>(2);
   while (has_more() && current() != ']') {
     if (current() == '-') {
       Advance();
       ranges->Add(CharacterRange::Singleton('-'));
     } else {
       CharacterRange first = ParseClassAtom(CHECK_OK);
       if (!first.is_character_class() && current() == '-') {
         Advance();
         CharacterRange next = ParseClassAtom(CHECK_OK);
         if (next.is_character_class()) {
           return ReportError(CStrVector(kIllegal), CHECK_OK);
         }
+        if (first.from() > next.to()) {
+          ReportError(CStrVector(kRangeOutOfOrder), CHECK_OK);
+        }
         ranges->Add(CharacterRange::Range(first.from(), next.to()));
       } else {
         ranges->Add(first);
       }
     }
   }
   if (!has_more()) {
     return ReportError(CStrVector(kUnterminated), CHECK_OK);
   }
   Advance();
@@ skipping 115 matching lines @@
                        start_position,
                        is_expression);
   return result;
 }
 
 
 #undef NEW
 
 
 } }  // namespace v8::internal