你会用<regex>实现一个轻量级的XML解析器吗？

#include <iostream>
#include <regex>
#include <string>

struct XMLNode {
    std::string tag;
    std::string content;
    std::vector<std::pair<std::string, std::string>> attributes;
    std::vector<XMLNode> children;
};

XMLNode parseXML(const std::string& xml) {
    XMLNode root;
    std::regex tagRegex("<(\\w+)(.*?)>(.*?)</\\1>");
    std::regex attrRegex("(\\w+)=\"(.*?)\"");
    std::smatch match;

    std::string::const_iterator searchStart(xml.cbegin());
    while (std::regex_search(searchStart, xml.cend(), match, tagRegex)) {
        XMLNode node;
        node.tag = match[1].str();
        node.content = match[3].str();

        std::string attributesStr = match[2].str();
        std::string::const_iterator attrSearchStart(attributesStr.cbegin());
        while (std::regex_search(attrSearchStart, attributesStr.cend(), match, attrRegex)) {
            node.attributes.emplace_back(match[1].str(), match[2].str());
            attrSearchStart = match.suffix().first;
        }

        root.children.push_back(node);
        searchStart = match.suffix().first;
    }

    return root;
}

int main() {
    std::string xml = "<root><person name=\"John\">Hello, World!</person></root>";
    XMLNode root = parseXML(xml);

    std::cout << "Root tag: " << root.tag << std::endl;
    std::cout << "Root content: " << root.content << std::endl;

    for (const auto& child : root.children) {
        std::cout << "Child tag: " << child.tag << std::endl;
        std::cout << "Child content: " << child.content << std::endl;

        for (const auto& attribute : child.attributes) {
            std::cout << "Attribute: " << attribute.first << " = " << attribute.second << std::endl;
        }
    }

    return 0;
}