xml_parser.h

Go to the documentation of this file.

// Common Text Transformation Library
// Copyright (C) 1997-2006 by Igor Kholodov. 
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library 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
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the
// Free Software Foundation, Inc.,
// 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
//
// mailto:cttl@users.sourceforge.net
// http://sourceforge.net/projects/cttl/

// xml_parser.h

#ifndef _XML_PARSER_H_INCLUDED_
#define _XML_PARSER_H_INCLUDED_

template< typename UniverseT >
struct parser {

    typedef UniverseT universe_T;

    typedef typename UniverseT::strict_edge_T strict_universe_T;

    typedef typename UniverseT::node_T node_T;

    typedef typename UniverseT::char_T char_T;

    std::vector< std::string > vect_xml_names;

    std::map< std::string, size_t > map_xml_names;

    // A pair has to be be assembled to represent a dictionary:
    std::pair< std::vector< std::string >*, std::map< std::string, size_t >* > xml_name_dictionary;

    std::vector< std::string > vect_xml_text;

    std::stack< size_t > xml_offset_stack;

    std::vector< int > vect_xml_tree;

    parser()
        :
        xml_name_dictionary( &vect_xml_names, &map_xml_names ),
        vect_xml_tree( 1 )
    {
    }

public:
    void error_show( universe_T& universe_, char_T const* message_ )
    {
#ifndef SUPPRESS_VERBOSE_ERRORS
        size_t offset_from_ = offset_stack_guard< universe_T >::offset( universe_, xml_offset_stack.top() );
        size_t offset_to_ = universe_.first.offset();

        if ( offset_from_ < offset_to_ )
            std::cout
                << "..."
                << universe_.parent().container().text_absolute_substring( offset_from_, std::min( offset_to_, offset_from_ + 50 ) )
                << "..."
                ;

        std::cout
            << std::endl
            << "*** Error: "
#ifdef DISPOSE_CONSUMED_DATA
            << '@'
            << offset_from_
            << '-'
            << offset_to_
#else
            << "line "
            << universe_.first.line()
#endif // DISPOSE_CONSUMED_DATA
           << '\t'
            << message_
            << std::endl
            ;
#endif // SUPPRESS_VERBOSE_ERRORS
    }

    size_t error_parser_failed( universe_T& universe_ )
    {
        error_show(
            universe_,
            "error_parser_failed"
            );
        return universe_T::string_T::npos;
    }

    size_t error_bad_pi( universe_T& universe_ )
    {
        error_show(
            universe_,
            "missing PI name"
            );
        return universe_T::string_T::npos;
    }

    size_t error_missing_close_element( universe_T& universe_ )
    {
        error_show(
            universe_,
            "error_missing_close_element"
            );
        return universe_T::string_T::npos;
    }

    size_t error_missing_pi_close( universe_T& universe_ )
    {
        error_show(
            universe_,
            "error_missing_pi_close"
            );
        return universe_T::string_T::npos;
    }

    size_t error_missing_comment_close( universe_T& universe_ )
    {
        error_show(
            universe_,
            "error_missing_comment_close"
            );
        return universe_T::string_T::npos;
    }

    size_t error_bad_attr_format( universe_T& universe_ )
    {
        error_show(
            universe_,
            "error_bad_attr_format"
            );
        return universe_T::string_T::npos;
    }
    
};  // struct parser


#endif //_XML_PARSER_H_INCLUDED_

---