| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 1394 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1405 virtual RegExpLookahead* AsLookahead(); | 1405 virtual RegExpLookahead* AsLookahead(); |
| 1406 virtual bool IsLookahead(); | 1406 virtual bool IsLookahead(); |
| 1407 RegExpTree* body() { return body_; } | 1407 RegExpTree* body() { return body_; } |
| 1408 bool is_positive() { return is_positive_; } | 1408 bool is_positive() { return is_positive_; } |
| 1409 private: | 1409 private: |
| 1410 RegExpTree* body_; | 1410 RegExpTree* body_; |
| 1411 bool is_positive_; | 1411 bool is_positive_; |
| 1412 }; | 1412 }; |
| 1413 | 1413 |
| 1414 | 1414 |
| 1415 class RegExpBackreference: public RegExpTree { | 1415 class RegExpBackReference: public RegExpTree { |
| 1416 public: | 1416 public: |
| 1417 explicit RegExpBackreference(RegExpCapture* capture) | 1417 explicit RegExpBackReference(RegExpCapture* capture) |
| 1418 : capture_(capture) { } | 1418 : capture_(capture) { } |
| 1419 virtual void* Accept(RegExpVisitor* visitor, void* data); | 1419 virtual void* Accept(RegExpVisitor* visitor, void* data); |
| 1420 virtual RegExpNode* ToNode(RegExpCompiler* compiler, | 1420 virtual RegExpNode* ToNode(RegExpCompiler* compiler, |
| 1421 RegExpNode* on_success, | 1421 RegExpNode* on_success, |
| 1422 RegExpNode* on_failure); | 1422 RegExpNode* on_failure); |
| 1423 virtual RegExpBackreference* AsBackreference(); | 1423 virtual RegExpBackReference* AsBackReference(); |
| 1424 virtual bool IsBackreference(); | 1424 virtual bool IsBackReference(); |
| 1425 int index() { return capture_->index(); } | 1425 int index() { return capture_->index(); } |
| 1426 RegExpCapture* capture() { return capture_; } | 1426 RegExpCapture* capture() { return capture_; } |
| 1427 private: | 1427 private: |
| 1428 RegExpCapture* capture_; | 1428 RegExpCapture* capture_; |
| 1429 }; | 1429 }; |
| 1430 | 1430 |
| 1431 | 1431 |
| 1432 class RegExpEmpty: public RegExpTree { | 1432 class RegExpEmpty: public RegExpTree { |
| 1433 public: | 1433 public: |
| 1434 RegExpEmpty() { } | 1434 RegExpEmpty() { } |
| (...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1492 #undef DEF_VISIT | 1492 #undef DEF_VISIT |
| 1493 | 1493 |
| 1494 private: | 1494 private: |
| 1495 bool stack_overflow_; | 1495 bool stack_overflow_; |
| 1496 }; | 1496 }; |
| 1497 | 1497 |
| 1498 | 1498 |
| 1499 } } // namespace v8::internal | 1499 } } // namespace v8::internal |
| 1500 | 1500 |
| 1501 #endif // V8_AST_H_ | 1501 #endif // V8_AST_H_ |
| OLD | NEW |