ere_base.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_BASE_H
#define EXTENDED_REGULAR_EXPRESSIONERE_BASE_H

namespace extended_regular_expression {

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

protected:
        unsigned long   m_rec_size;
        unsigned long   m_rec_pos;
        bool                    m_is_rec;
public:
    ere_base() : m_is_rec(false) , m_rec_pos(0), m_rec_size(0) {};
        
        bool is_recognized()
        {
                return m_is_rec;
        }
        
        void unset()
        {
                m_is_rec = false;
        }
        
        void set( const unsigned long pos, const unsigned long size )
        {
                m_is_rec = true;
                m_rec_pos = pos;
                m_rec_size = size;
        }
        
        unsigned long recognized_size() 
        {
                return m_rec_size;
        }

        unsigned long recognized_position() 
        {
                return m_rec_pos;
        }
                
        const match& get_match()
        {
                return m_match( m_rec_pos, m_rec_size );
        }
        
        virtual void assign_matches( matches::match_key parent_address, 
                                                                unsigned long& branch_pos, 
                                                                matches& m ) = 0;
        
        virtual unsigned long recognize( const E* buf, 
                                                                const unsigned long buf_length,
                                                                const unsigned long buf_offset,
                                                                bool try_positions = true ) = 0;
        
        virtual void push_parsers( parser_list& l ) = 0;
        
        std::string to_str( const unsigned long i )
        {
                std::stringstream ss;
                ss << i;
                return ss.str();
        }
        
};

};

#endif

---