FM / nonterminal

/usr/include/boost/spirit/home/karma/nonterminal/

/usr/include/boost/spirit/home/karma/nonterminal

Name	Size	Mode	Actions
detail/	-	0755	rm
debug_handler.hpp	4313	0644	edit dl rm
debug_handler_state.hpp	567	0644	edit dl rm
grammar.hpp	4989	0644	edit dl rm
nonterminal_fwd.hpp	905	0644	edit dl rm
rule.hpp	15734	0644	edit dl rm
simple_trace.hpp	4649	0644	edit dl rm

Edit: /usr/include/boost/spirit/home/karma/nonterminal/grammar.hpp (4989B)

#if !defined(BOOST_SPIRIT_KARMA_GRAMMAR_MAR_05_2007_0542PM)
#define BOOST_SPIRIT_KARMA_GRAMMAR_MAR_05_2007_0542PM

#if defined(_MSC_VER)
#pragma once
#endif

#include <boost/spirit/home/support/unused.hpp>
#include <boost/spirit/home/support/info.hpp>
#include <boost/spirit/home/support/assert_msg.hpp>
#include <boost/spirit/home/karma/domain.hpp>
#include <boost/spirit/home/karma/nonterminal/rule.hpp>
#include <boost/spirit/home/karma/nonterminal/nonterminal_fwd.hpp>
#include <boost/spirit/home/karma/reference.hpp>
#include <boost/noncopyable.hpp>
#include <boost/proto/extends.hpp>
#include <boost/proto/traits.hpp>
#include <boost/type_traits/is_same.hpp>

namespace boost { namespace spirit { namespace karma
{
    template <
        typename OutputIterator, typename T1, typename T2, typename T3
      , typename T4>
    struct grammar
      : proto::extends<
            typename proto::terminal<
                reference<rule<OutputIterator, T1, T2, T3, T4> const>
            >::type
          , grammar<OutputIterator, T1, T2, T3, T4>
        >
      , generator<grammar<OutputIterator, T1, T2, T3, T4> >
      , noncopyable
    {
        typedef OutputIterator iterator_type;
        typedef rule<OutputIterator, T1, T2, T3, T4> start_type;
        typedef typename start_type::properties properties;
        typedef typename start_type::sig_type sig_type;
        typedef typename start_type::locals_type locals_type;
        typedef typename start_type::delimiter_type delimiter_type;
        typedef typename start_type::encoding_type encoding_type;
        typedef grammar<OutputIterator, T1, T2, T3, T4> base_type;
        typedef reference<start_type const> reference_;
        typedef typename proto::terminal<reference_>::type terminal;

static size_t const params_size = start_type::params_size;

template <typename Context, typename Unused>
        struct attribute
        {
            typedef typename start_type::attr_type type;
        };

// the output iterator is always wrapped by karma
        typedef detail::output_iterator<OutputIterator, properties> 
            output_iterator;

grammar(start_type const& start
              , std::string const& name_ = "unnamed-grammar")
          : proto::extends<terminal, base_type>(terminal::make(reference_(start)))
          , name_(name_)
        {}

// This constructor is used to catch if the start rule is not 
        // compatible with the grammar. 
        template <typename Iterator_, typename T1_, typename T2_, typename T3_,
            typename T4_>
        grammar(rule<Iterator_, T1_, T2_, T3_, T4_> const&
              , std::string const& = "unnamed-grammar")
        {
            // If you see the assertion below failing then the start rule 
            // passed to the constructor of the grammar is not compatible with 
            // the grammar (i.e. it uses different template parameters).
            BOOST_SPIRIT_ASSERT_MSG(
                (is_same<start_type, rule<Iterator_, T1_, T2_, T3_, T4_> >::value)
              , incompatible_start_rule, (rule<Iterator_, T1_, T2_, T3_, T4_>));
        }

std::string name() const
        {
            return name_;
        }

void name(std::string const& str)
        {
            name_ = str;
        }

template <typename Context, typename Delimiter, typename Attribute>
        bool generate(output_iterator& sink, Context& context
          , Delimiter const& delim, Attribute const& attr) const
        {
            return this->proto_base().child0.generate(
                sink, context, delim, attr);
        }

template <typename Context>
        info what(Context&) const
        {
            return info(name_);
        }

// bring in the operator() overloads
        start_type const& get_parameterized_subject() const
        { return this->proto_base().child0.ref.get(); }
        typedef start_type parameterized_subject_type;
        #include <boost/spirit/home/karma/nonterminal/detail/fcall.hpp>

std::string name_;
    };
}}}

namespace boost { namespace spirit { namespace traits
{
    ///////////////////////////////////////////////////////////////////////////
    template <
        typename IteratorA, typename IteratorB, typename Attribute
      , typename Context, typename T1, typename T2, typename T3, typename T4>
    struct handles_container<
            karma::grammar<IteratorA, T1, T2, T3, T4>, Attribute, Context
          , IteratorB>
      : detail::nonterminal_handles_container< 
            typename attribute_of<
                karma::grammar<IteratorA, T1, T2, T3, T4>
              , Context, IteratorB
          >::type, Attribute>
    {};
}}}

#endif

// Copyright (c) 2001-2011 Joel de Guzman // Copyright (c) 2001-2011 Hartmut Kaiser // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) #if !defined(BOOST_SPIRIT_KARMA_GRAMMAR_MAR_05_2007_0542PM) #define BOOST_SPIRIT_KARMA_GRAMMAR_MAR_05_2007_0542PM #if defined(_MSC_VER) #pragma once #endif #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace spirit { namespace karma { template < typename OutputIterator, typename T1, typename T2, typename T3 , typename T4> struct grammar : proto::extends< typename proto::terminal< reference const> >::type , grammar > , generator > , noncopyable { typedef OutputIterator iterator_type; typedef rule start_type; typedef typename start_type::properties properties; typedef typename start_type::sig_type sig_type; typedef typename start_type::locals_type locals_type; typedef typename start_type::delimiter_type delimiter_type; typedef typename start_type::encoding_type encoding_type; typedef grammar base_type; typedef reference reference_; typedef typename proto::terminal::type terminal; static size_t const params_size = start_type::params_size; template struct attribute { typedef typename start_type::attr_type type; }; // the output iterator is always wrapped by karma typedef detail::output_iterator output_iterator; grammar(start_type const& start , std::string const& name_ = "unnamed-grammar") : proto::extends(terminal::make(reference_(start))) , name_(name_) {} // This constructor is used to catch if the start rule is not // compatible with the grammar. template grammar(rule const& , std::string const& = "unnamed-grammar") { // If you see the assertion below failing then the start rule // passed to the constructor of the grammar is not compatible with // the grammar (i.e. it uses different template parameters). BOOST_SPIRIT_ASSERT_MSG( (is_same >::value) , incompatible_start_rule, (rule)); } std::string name() const { return name_; } void name(std::string const& str) { name_ = str; } template bool generate(output_iterator& sink, Context& context , Delimiter const& delim, Attribute const& attr) const { return this->proto_base().child0.generate( sink, context, delim, attr); } template info what(Context&) const { return info(name_); } // bring in the operator() overloads start_type const& get_parameterized_subject() const { return this->proto_base().child0.ref.get(); } typedef start_type parameterized_subject_type; #include std::string name_; }; }}} namespace boost { namespace spirit { namespace traits { /////////////////////////////////////////////////////////////////////////// template < typename IteratorA, typename IteratorB, typename Attribute , typename Context, typename T1, typename T2, typename T3, typename T4> struct handles_container< karma::grammar, Attribute, Context , IteratorB> : detail::nonterminal_handles_container< typename attribute_of< karma::grammar , Context, IteratorB >::type, Attribute> {}; }}} #endif