matching_tags.cpp

来自「Boost provides free peer-reviewed portab」· C++ 代码 · 共 116 行

CPP

116 行

/*=============================================================================    Copyright (c) 2002-2003 Joel de Guzman    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)=============================================================================*/////////////////////////////////////////////////////////////////////////////////  HTML/XML like tag matching grammar//  Demonstrates phoenix and closures and parametric parsers//  This is discussed in the "Closures" chapter in the Spirit User's Guide.////  [ JDG 6/30/2002 ]//////////////////////////////////////////////////////////////////////////////#include <boost/spirit/include/classic_core.hpp>#include <boost/spirit/include/classic_attribute.hpp>#include <iostream>#include <string>////////////////////////////////////////////////////////////////////////////using namespace std;using namespace BOOST_SPIRIT_CLASSIC_NS;using namespace phoenix;////////////////////////////////////////////////////////////////////////////////  HTML/XML like tag matching grammar//////////////////////////////////////////////////////////////////////////////struct tags_closure : BOOST_SPIRIT_CLASSIC_NS::closure<tags_closure, string> {    member1 tag;};struct tags : public grammar<tags> {    template <typename ScannerT>    struct definition {        definition(tags const& /*self*/)        {            element = start_tag >> *element >> end_tag;            start_tag =                    '<'                >>  lexeme_d                    [                        (+alpha_p)                        [                            //  construct string from arg1 and arg2 lazily                            //  and assign to element.tag                            element.tag = construct_<string>(arg1, arg2)                        ]                    ]                >> '>';            end_tag = "</" >> f_str_p(element.tag) >> '>';        }        rule<ScannerT, tags_closure::context_t> element;        rule<ScannerT> start_tag, end_tag;        rule<ScannerT, tags_closure::context_t> const&        start() const { return element; }    };};////////////////////////////////////////////////////////////////////////////////  Main program//////////////////////////////////////////////////////////////////////////////intmain(){    cout << "/////////////////////////////////////////////////////////\n\n";    cout << "\t\tHTML/XML like tag matching parser demo \n\n";    cout << "/////////////////////////////////////////////////////////\n\n";    cout << "Type an HTML/XML like nested tag input...or [q or Q] to quit\n\n";    cout << "Example: <html><head></head><body></body></html>\n\n";    tags p;    //  Our parser    string str;    while (getline(cin, str))    {        if (str.empty() || str[0] == 'q' || str[0] == 'Q')            break;        parse_info<> info = parse(str.c_str(), p, space_p);        if (info.full)        {            cout << "-------------------------\n";            cout << "Parsing succeeded\n";            cout << "-------------------------\n";        }        else        {            cout << "-------------------------\n";            cout << "Parsing failed\n";            cout << "stopped at: \": " << info.stop << "\"\n";            cout << "-------------------------\n";        }    }    cout << "Bye... :-) \n\n";    return 0;}

matching_tags.cpp - 源码说明

本页面展示了「Boost provides free peer-reviewed portable C++ source libraries. We emphasize libraries that work」中的 matching_tags.cpp 源码文件，采用 C++ 编程语言编写，共 116 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与libraries相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C

搜索代码Ctrl + F

全屏模式F11

增大字号Ctrl + =

减小字号Ctrl + -

显示快捷键?