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;
4812 RegExpTree* RegExpParser::ReportError(Vector<const char> message) {
4824 RegExpTree* RegExpParser::ParsePattern() {
4825 RegExpTree* result = ParseDisjunction(CHECK_FAILED);
4846 RegExpTree* RegExpParser::ParseDisjunction() {
4871 RegExpTree* body = builder->ToRegExp();
4936 RegExpTree* atom = new(zone()) RegExpCharacterClass(ranges, false);
4975 RegExpTree* atom = ParseCharacterClass(CHECK_FAILED);
5006 RegExpTree* atom = new(zone()) RegExpCharacterClass(ranges, false);
5022 RegExpTree* atom = new(zone()) RegExpBackReference(capture);
5131 max = RegExpTree::kInfinity;
5136 max = RegExpTree::kInfinity;
5268 // values. Values are truncated to RegExpTree::kInfinity if they overflow.
5280 if (min > (RegExpTree::kInfinity - next) / 10) {
5285 min = RegExpTree::kInfinity;
5298 max = RegExpTree::kInfinity;
5303 if (max > (RegExpTree::kInfinity - next) / 10) {
5307 max = RegExpTree::kInfinity;
5490 RegExpTree* RegExpParser::ParseCharacterClass() {
5646 RegExpTree* tree = parser.ParsePattern();
