ere_expression.h

/***************************************************************************
 *   Copyright (C) 2006 by Radko Mihal                                     *
 *   rmihal@pobox.sk                                                       *
 *                                                                         *
 *   This program is free software; you can redistribute it and/or modify  *
 *   it under the terms of the GNU General Public License as published by  *
 *   the Free Software Foundation; either version 2 of the License, or     *
 *   (at your option) any later version.                                   *
 *                                                                         *
 *   This program is distributed in the hope that it will be useful,       *
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of        *
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the         *
 *   GNU General Public License for more details.                          *
 *                                                                         *
 *   You should have received a copy of the GNU General Public License     *
 *   along with this program; if not, write to the                         *
 *   Free Software Foundation, Inc.,                                       *
 *   51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.              *
 ***************************************************************************/
#ifndef EXTENDED_REGULAR_EXPRESSIONERE_EXPRESSION_H
#define EXTENDED_REGULAR_EXPRESSIONERE_EXPRESSION_H

namespace extended_regular_expression {

template< typename E > class extended_reg_exp;

template<typename E>
class ere_expression : public ere_base<E>
{
typedef typename grammar_to_parser::basic_parser<E>::parser_list 
                                                                                                                                parser_list;

        class subexpression : public ere_base<E>
        {
                grammar_to_parser::basic_terminal<E,'('>                                m_left_paren;
                grammar_to_parser::basic_choice<E,extended_reg_exp<E> > m_extened_regexp;
                grammar_to_parser::basic_terminal<E,')'>                                m_right_paren;
        public:
                subexpression() : ere_base<E>() {};
                ~subexpression() {};
                
                unsigned long recognize( const E* buf, 
                                                                const unsigned long buf_length,
                                                                const unsigned long buf_offset,
                                                                bool try_positions = true );
                void assign_matches( matches::match_key key, 
                                                        unsigned long& branch_pos, 
                                                        matches& m );
                
                void push_parsers( parser_list& l );
        };
        
        class ere_expression_no_dup : public ere_expression<E>
        {
        public:
                                        
                void push_parsers( parser_list& l )
                {
                        l.push_back( &m_one_elem );
                        l.push_back( &m_left_anchor );
                        l.push_back( &m_right_anchor );
                        l.push_back( &m_subexpression );
                }       
        };
        
        class ere_expression_and_dupl : public ere_base<E>
        {
                grammar_to_parser::basic_choice<E,ere_expression_no_dup >       
                                                                                                                                m_ere;
                grammar_to_parser::basic_choice<E,ere_dups<E> >                 m_dup;
                
                matches                                                                                                 m_matches;
                
                
                unsigned long divide_and_recognize( const E* buf, 
                                                                                        const unsigned long buf_length,
                                                                                        const unsigned long buf_offset,
                                                                                        unsigned long rep,
                                                                                        bool assign_matches );
        public: 
                ere_expression_and_dupl() : ere_base<E>() {};
                ~ere_expression_and_dupl() {};
                
                unsigned long recognize( const E* buf, 
                                                                const unsigned long buf_length, 
                                                                const unsigned long buf_offset,
                                                                bool try_positions = true );
                void assign_matches( matches::match_key key, 
                                                        unsigned long& branch_pos, 
                                                        matches& m );
                void push_parsers( parser_list& l );
                bool is_lazy() { return m_dup.is_parsed() && m_dup->is_lazy(); }
                
        };
        
        grammar_to_parser::basic_choice<E,one_char_or_coll_elem_ere<E> >
                                                                                                                                m_one_elem;
        grammar_to_parser::basic_terminal<E,'^'>                                        m_left_anchor;
        grammar_to_parser::basic_terminal<E,'$'>                                        m_right_anchor;
        grammar_to_parser::basic_non_terminal<E,subexpression>
                                                                                                                                m_subexpression;
        grammar_to_parser::basic_non_terminal<E,ere_expression_and_dupl>
                                                                                                                                m_ere_expr_and_dup;
public:
        
    ere_expression() : 
                ere_base<E>(),
                m_subexpression(),
                m_ere_expr_and_dup()
        {};
        ~ere_expression() {};

        bool is_right_anchor() { return m_right_anchor.is_parsed(); }
        bool is_left_anchor() { return m_left_anchor.is_parsed(); }
        bool is_subexpression() { return m_subexpression.is_parsed(); }
        bool is_lazy()
        { 
                return m_ere_expr_and_dup.is_parsed() && m_ere_expr_and_dup->is_lazy(); 
        }
        
        unsigned long recognize( const E* buf, 
                                                        const unsigned long buf_length, 
                                                        const unsigned long buf_offset,
                                                        bool try_positions = true );
        void assign_matches( matches::match_key key, 
                                                unsigned long& branch_pos, 
                                                matches& m );
                                
        void push_parsers( parser_list& l );
        
};

};

#endif

---