Lines Matching refs:RegExpTree
41 RegExpTree* atom = new(zone()) RegExpAtom(characters_->ToConstVector());
81 void RegExpBuilder::AddAtom(RegExpTree* term) {
97 void RegExpBuilder::AddAssertion(RegExpTree* assert) {
112 RegExpTree* alternative;
126 RegExpTree* RegExpBuilder::ToRegExp() {
145 RegExpTree* atom;
4133 RegExpTree* RegExpParser::ReportError(Vector<const char> message) {
4145 RegExpTree* RegExpParser::ParsePattern() {
4146 RegExpTree* result = ParseDisjunction(CHECK_FAILED);
4167 RegExpTree* RegExpParser::ParseDisjunction() {
4192 RegExpTree* body = builder->ToRegExp();
4257 RegExpTree* atom = new(zone()) RegExpCharacterClass(ranges, false);
4296 RegExpTree* atom = ParseCharacterClass(CHECK_FAILED);
4327 RegExpTree* atom = new(zone()) RegExpCharacterClass(ranges, false);
4343 RegExpTree* atom = new(zone()) RegExpBackReference(capture);
4452 max = RegExpTree::kInfinity;
4457 max = RegExpTree::kInfinity;
4589 // values. Values are truncated to RegExpTree::kInfinity if they overflow.
4601 if (min > (RegExpTree::kInfinity - next) / 10) {
4606 min = RegExpTree::kInfinity;
4619 max = RegExpTree::kInfinity;
4624 if (max > (RegExpTree::kInfinity - next) / 10) {
4628 max = RegExpTree::kInfinity;
4811 RegExpTree* RegExpParser::ParseCharacterClass() {
4876 RegExpTree* tree = parser.ParsePattern();
