ere_dups.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_DUPS_H
#define EXTENDED_REGULAR_EXPRESSIONERE_DUPS_H

namespace extended_regular_expression {

template< typename E >
class ere_dups
{
typedef typename grammar_to_parser::basic_parser<E>::parser_list 
                                                                                                                                parser_list;
        
        unsigned long m_rep;
        class dup_and_dup_branch
        {
                grammar_to_parser::basic_choice<E,ere_dupl_symbol<E> > 
                                                                                                                m_dup;
                grammar_to_parser::basic_choice<E,ere_dups<E> > m_dups;
                
        public:
                void push_parsers( parser_list& l )
                {
                        l.push_back( &m_dup );
                        l.push_back( &m_dups );
                }
                
                unsigned long get_max()
                {
                        double max = m_dup->get_max();
                        if( max == INT_MAX )
                                return INT_MAX;
                        
                        double max_from_branch = m_dups->get_max();
                        if( max_from_branch == INT_MAX )
                                return INT_MAX;
                        
                        max = max * max_from_branch;
                        if( max >= INT_MAX )
                                return INT_MAX;
                        
                        return (unsigned long)max;
                }
                
                bool is_lazy()
                {
                        return (m_dup.is_parsed() && m_dup->is_lazy()) ||
                                        (m_dups.is_parsed() && m_dups->is_lazy());
                }
                
                unsigned long get_min()
                {
                        return m_dup->get_min() * m_dups->get_min();
                }
        };
                
        grammar_to_parser::basic_non_terminal<E, dup_and_dup_branch >
                                                                                                                m_dup_and_dups;
        grammar_to_parser::basic_choice<E,ere_dupl_symbol<E> > 
                                                                                                                m_dup;

public:
        
        bool is_lazy()
        {
                return (m_dup_and_dups.is_parsed() && m_dup_and_dups->is_lazy()) ||
                                (m_dup.is_parsed() && m_dup->is_lazy());
        }
        
        void push_parsers( parser_list& l )
        {
                l.push_back( &m_dup_and_dups );
                l.push_back( &m_dup );
        }
        
        void set_recognized_dup( unsigned long rec_dup )
        {
                m_rep = rec_dup;
        }
        
        unsigned long get_recognized_dup()
        {
                return m_rep;
        }
        
        unsigned long get_max()
        {
                if( m_dup_and_dups.is_parsed() )
                        return m_dup_and_dups->get_max();
                else
                        return m_dup->get_max();
        }
        
        unsigned long get_min()
        {
                if( m_dup_and_dups.is_parsed() )
                        return m_dup_and_dups->get_min();
                else
                        return m_dup->get_min();
        }
        
        ere_dups() : m_rep(0) {};       
        ~ere_dups() {};
};

};

#endif

---