| 1 | /* |
| 2 | * Copyright (c) 2015, Intel Corporation |
| 3 | * |
| 4 | * Redistribution and use in source and binary forms, with or without |
| 5 | * modification, are permitted provided that the following conditions are met: |
| 6 | * |
| 7 | * * Redistributions of source code must retain the above copyright notice, |
| 8 | * this list of conditions and the following disclaimer. |
| 9 | * * Redistributions in binary form must reproduce the above copyright |
| 10 | * notice, this list of conditions and the following disclaimer in the |
| 11 | * documentation and/or other materials provided with the distribution. |
| 12 | * * Neither the name of Intel Corporation nor the names of its contributors |
| 13 | * may be used to endorse or promote products derived from this software |
| 14 | * without specific prior written permission. |
| 15 | * |
| 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 26 | * POSSIBILITY OF SUCH DAMAGE. |
| 27 | */ |
| 28 | |
| 29 | /** \file |
| 30 | * \brief Alternations (foo|bar|baz). |
| 31 | */ |
| 32 | |
| 33 | #ifndef COMPONENT_ALTERNATION_H |
| 34 | #define COMPONENT_ALTERNATION_H |
| 35 | |
| 36 | #include "Component.h" |
| 37 | #include "position.h" |
| 38 | |
| 39 | #include <memory> |
| 40 | |
| 41 | namespace ue2 { |
| 42 | |
| 43 | class PositionInfo; |
| 44 | |
| 45 | class ComponentAlternation : public Component { |
| 46 | friend class DumpVisitor; |
| 47 | friend class SimplifyVisitor; |
| 48 | public: |
| 49 | ComponentAlternation(); |
| 50 | ~ComponentAlternation() override; |
| 51 | ComponentAlternation *clone() const override; |
| 52 | Component *accept(ComponentVisitor &v) override; |
| 53 | void accept(ConstComponentVisitor &v) const override; |
| 54 | |
| 55 | size_t numBranches() const { return children.size(); } |
| 56 | |
| 57 | void append(std::unique_ptr<Component> component); |
| 58 | |
| 59 | std::vector<PositionInfo> first() const override; |
| 60 | std::vector<PositionInfo> last() const override; |
| 61 | bool empty(void) const override; |
| 62 | bool vacuous_everywhere() const override; |
| 63 | void notePositions(GlushkovBuildState &bs) override; |
| 64 | void buildFollowSet(GlushkovBuildState &bs, |
| 65 | const std::vector<PositionInfo> &lastPos) override; |
| 66 | bool checkEmbeddedStartAnchor(bool at_start) const override; |
| 67 | bool checkEmbeddedEndAnchor(bool at_end) const override; |
| 68 | |
| 69 | void optimise(bool connected_to_sds) override; |
| 70 | |
| 71 | private: |
| 72 | std::vector<std::unique_ptr<Component>> children; |
| 73 | |
| 74 | ComponentAlternation(const ComponentAlternation &other); |
| 75 | }; |
| 76 | |
| 77 | } // namespace ue2 |
| 78 | |
| 79 | #endif |
| 80 | |