Lines Matching refs:RegExpTree
107 RegExpTree* atom = new(zone()) RegExpAtom(characters_->ToConstVector());
147 void RegExpBuilder::AddAtom(RegExpTree* term) {
163 void RegExpBuilder::AddAssertion(RegExpTree* assert) {
178 RegExpTree* alternative;
192 RegExpTree* RegExpBuilder::ToRegExp() {
211 RegExpTree* atom;
5052 RegExpTree* RegExpParser::ReportError(Vector<const char> message) {
5064 RegExpTree* RegExpParser::ParsePattern() {
5065 RegExpTree* result = ParseDisjunction(CHECK_FAILED);
5086 RegExpTree* RegExpParser::ParseDisjunction() {
5111 RegExpTree* body = builder->ToRegExp();
5176 RegExpTree* atom = new(zone()) RegExpCharacterClass(ranges, false);
5215 RegExpTree* atom = ParseCharacterClass(CHECK_FAILED);
5246 RegExpTree* atom = new(zone()) RegExpCharacterClass(ranges, false);
5262 RegExpTree* atom = new(zone()) RegExpBackReference(capture);
5371 max = RegExpTree::kInfinity;
5376 max = RegExpTree::kInfinity;
5508 // values. Values are truncated to RegExpTree::kInfinity if they overflow.
5520 if (min > (RegExpTree::kInfinity - next) / 10) {
5525 min = RegExpTree::kInfinity;
5538 max = RegExpTree::kInfinity;
5543 if (max > (RegExpTree::kInfinity - next) / 10) {
5547 max = RegExpTree::kInfinity;
5730 RegExpTree* RegExpParser::ParseCharacterClass() {
5893 RegExpTree* tree = parser.ParsePattern();
