/*============================================================================= Copyright (c) 2002-2003 Hartmut Kaiser http://spirit.sourceforge.net/ Use, modification and distribution is subject to 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) =============================================================================*/ #ifndef BOOST_SPIRIT_CONFIX_IPP #define BOOST_SPIRIT_CONFIX_IPP /////////////////////////////////////////////////////////////////////////////// #include #include /////////////////////////////////////////////////////////////////////////////// namespace boost { namespace spirit { /////////////////////////////////////////////////////////////////////////////// // // Types to distinguish nested and non-nested confix parsers // /////////////////////////////////////////////////////////////////////////////// struct is_nested {}; struct non_nested {}; /////////////////////////////////////////////////////////////////////////////// // // Types to distinguish between confix parsers, which are implicitly lexems // and without this behaviour // /////////////////////////////////////////////////////////////////////////////// struct is_lexeme {}; struct non_lexeme {}; /////////////////////////////////////////////////////////////////////////////// // // confix_parser_type class implementation // /////////////////////////////////////////////////////////////////////////////// namespace impl { /////////////////////////////////////////////////////////////////////////// // implicitly insert a lexeme_d into the parsing process template struct select_confix_parse_lexeme; template <> struct select_confix_parse_lexeme { template static typename parser_result::type parse(ParserT const& p, ScannerT const& scan) { typedef typename parser_result::type result_t; return contiguous_parser_parse(p, scan, scan); } }; template <> struct select_confix_parse_lexeme { template static typename parser_result::type parse(ParserT const& p, ScannerT const& scan) { return p.parse(scan); } }; /////////////////////////////////////////////////////////////////////////// // parse confix sequences with refactoring template struct select_confix_parse_refactor; template <> struct select_confix_parse_refactor { template < typename LexemeT, typename ParserT, typename ScannerT, typename OpenT, typename ExprT, typename CloseT > static typename parser_result::type parse( LexemeT const &, ParserT const& this_, ScannerT const& scan, OpenT const& open, ExprT const& expr, CloseT const& close) { typedef refactor_action_gen > refactor_t; const refactor_t refactor_body_d = refactor_t(refactor_unary_d); return select_confix_parse_lexeme::parse(( open >> (this_ | refactor_body_d[expr - close]) >> close ), scan); } }; template <> struct select_confix_parse_refactor { template < typename LexemeT, typename ParserT, typename ScannerT, typename OpenT, typename ExprT, typename CloseT > static typename parser_result::type parse( LexemeT const &, ParserT const& /*this_*/, ScannerT const& scan, OpenT const& open, ExprT const& expr, CloseT const& close) { typedef refactor_action_gen > refactor_t; const refactor_t refactor_body_d = refactor_t(refactor_unary_d); return select_confix_parse_lexeme::parse(( open >> refactor_body_d[expr - close] >> close ), scan); } }; /////////////////////////////////////////////////////////////////////////// // parse confix sequences without refactoring template struct select_confix_parse_no_refactor; template <> struct select_confix_parse_no_refactor { template < typename LexemeT, typename ParserT, typename ScannerT, typename OpenT, typename ExprT, typename CloseT > static typename parser_result::type parse( LexemeT const &, ParserT const& this_, ScannerT const& scan, OpenT const& open, ExprT const& expr, CloseT const& close) { return select_confix_parse_lexeme::parse(( open >> (this_ | (expr - close)) >> close ), scan); } }; template <> struct select_confix_parse_no_refactor { template < typename LexemeT, typename ParserT, typename ScannerT, typename OpenT, typename ExprT, typename CloseT > static typename parser_result::type parse( LexemeT const &, ParserT const & /*this_*/, ScannerT const& scan, OpenT const& open, ExprT const& expr, CloseT const& close) { return select_confix_parse_lexeme::parse(( open >> (expr - close) >> close ), scan); } }; // the refactoring is handled by the refactoring parsers, so here there // is no need to pay attention to these issues. template struct confix_parser_type { template < typename NestedT, typename LexemeT, typename ParserT, typename ScannerT, typename OpenT, typename ExprT, typename CloseT > static typename parser_result::type parse( NestedT const &, LexemeT const &lexeme, ParserT const& this_, ScannerT const& scan, OpenT const& open, ExprT const& expr, CloseT const& close) { return select_confix_parse_refactor:: parse(lexeme, this_, scan, open, expr, close); } }; template <> struct confix_parser_type { template < typename NestedT, typename LexemeT, typename ParserT, typename ScannerT, typename OpenT, typename ExprT, typename CloseT > static typename parser_result::type parse( NestedT const &, LexemeT const &lexeme, ParserT const& this_, ScannerT const& scan, OpenT const& open, ExprT const& expr, CloseT const& close) { return select_confix_parse_no_refactor:: parse(lexeme, this_, scan, open, expr, close); } }; } // namespace impl /////////////////////////////////////////////////////////////////////////////// }} // namespace boost::spirit #endif