1 // class template regex -*- C++ -*-
3 // Copyright (C) 2010 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 3, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
26 * @file bits/regex_nfa.tcc
35 inline std::ostream& _State::
36 _M_print(std::ostream& ostr) const
40 case _S_opcode_alternative:
41 ostr << "alt next=" << _M_next << " alt=" << _M_alt;
43 case _S_opcode_subexpr_begin:
44 ostr << "subexpr begin next=" << _M_next << " index=" << _M_subexpr;
46 case _S_opcode_subexpr_end:
47 ostr << "subexpr end next=" << _M_next << " index=" << _M_subexpr;
50 ostr << "match next=" << _M_next;
52 case _S_opcode_accept:
53 ostr << "accept next=" << _M_next;
56 ostr << "unknown next=" << _M_next;
62 // Prints graphviz dot commands for state.
63 inline std::ostream& _State::
64 _M_dot(std::ostream& __ostr, _StateIdT __id) const
68 case _S_opcode_alternative:
69 __ostr << __id << " [label=\"" << __id << "\\nALT\"];\n"
70 << __id << " -> " << _M_next
71 << " [label=\"epsilon\", tailport=\"s\"];\n"
72 << __id << " -> " << _M_alt
73 << " [label=\"epsilon\", tailport=\"n\"];\n";
75 case _S_opcode_subexpr_begin:
76 __ostr << __id << " [label=\"" << __id << "\\nSBEGIN "
77 << _M_subexpr << "\"];\n"
78 << __id << " -> " << _M_next << " [label=\"epsilon\"];\n";
80 case _S_opcode_subexpr_end:
81 __ostr << __id << " [label=\"" << __id << "\\nSEND "
82 << _M_subexpr << "\"];\n"
83 << __id << " -> " << _M_next << " [label=\"epsilon\"];\n";
86 __ostr << __id << " [label=\"" << __id << "\\nMATCH\"];\n"
87 << __id << " -> " << _M_next << " [label=\"<match>\"];\n";
89 case _S_opcode_accept:
90 __ostr << __id << " [label=\"" << __id << "\\nACC\"];\n" ;
93 __ostr << __id << " [label=\"" << __id << "\\nUNK\"];\n"
94 << __id << " -> " << _M_next << " [label=\"?\"];\n";
100 inline std::ostream& _Nfa::
101 _M_dot(std::ostream& __ostr) const
103 __ostr << "digraph _Nfa {\n"
105 for (unsigned int __i = 0; __i < this->size(); ++__i)
106 { this->at(__i)._M_dot(__ostr, __i); }
112 inline _StateSeq& _StateSeq::
113 operator=(const _StateSeq& __rhs)
115 _M_start = __rhs._M_start;
116 _M_end1 = __rhs._M_end1;
117 _M_end2 = __rhs._M_end2;
121 inline void _StateSeq::
122 _M_push_back(_StateIdT __id)
124 if (_M_end1 != _S_invalid_state_id)
125 _M_nfa[_M_end1]._M_next = __id;
129 inline void _StateSeq::
130 _M_append(_StateIdT __id)
132 if (_M_end2 != _S_invalid_state_id)
134 if (_M_end2 == _M_end1)
135 _M_nfa[_M_end2]._M_alt = __id;
137 _M_nfa[_M_end2]._M_next = __id;
138 _M_end2 = _S_invalid_state_id;
140 if (_M_end1 != _S_invalid_state_id)
141 _M_nfa[_M_end1]._M_next = __id;
145 inline void _StateSeq::
146 _M_append(_StateSeq& __rhs)
148 if (_M_end2 != _S_invalid_state_id)
150 if (_M_end2 == _M_end1)
151 _M_nfa[_M_end2]._M_alt = __rhs._M_start;
153 _M_nfa[_M_end2]._M_next = __rhs._M_start;
154 _M_end2 = _S_invalid_state_id;
156 if (__rhs._M_end2 != _S_invalid_state_id)
157 _M_end2 = __rhs._M_end2;
158 if (_M_end1 != _S_invalid_state_id)
159 _M_nfa[_M_end1]._M_next = __rhs._M_start;
160 _M_end1 = __rhs._M_end1;
163 // @todo implement this function.
164 inline _StateIdT _StateSeq::
168 } // namespace __regex