55 lines
1.9 KiB
C++
55 lines
1.9 KiB
C++
#include "novelparser.h"
|
|
|
|
#include <syntax_novel.h>
|
|
#include <ast_novel.h>
|
|
#include <parse_novel.h>
|
|
#include <QTime>
|
|
#include <QDebug>
|
|
|
|
using namespace example_novel;
|
|
|
|
NovelParser::NovelParser()
|
|
{
|
|
this->syntax_defines = example_novel::NovalSyntax::getParseTree();
|
|
checker_list << std::make_shared<example_novel::FragmentExistsCheck>();
|
|
checker_list << std::make_shared<example_novel::FragmentGraphCheck>();
|
|
|
|
analyzer_ref = std::make_shared<lib_parse::Analyzer>(checker_list);
|
|
}
|
|
|
|
QString NovelParser::version() const
|
|
{
|
|
return "1.0.0";
|
|
}
|
|
|
|
std::shared_ptr<const ast_gen::ElementAccess> NovelParser::parse(const QFileInfoList source_list) const {
|
|
QList<std::shared_ptr<const ast_basic::Expression>> forst_root;
|
|
auto lex_reader = NovalSyntax::getLexReader();
|
|
auto context = std::make_shared<ast_gen::GlobalElement>(u8"小说");
|
|
|
|
auto time_stamp = QTime::currentTime();
|
|
for (auto& file : source_list) {
|
|
auto tokens = lex_reader->tokensWithin(file.canonicalFilePath());
|
|
auto exprs_result = this->syntax_defines->parse(context, tokens);
|
|
forst_root.append(std::get<0>(exprs_result));
|
|
}
|
|
auto current_stamp = QTime::currentTime();
|
|
qDebug() << QString(u8"词法解析+语法解析消耗时间：%1 ms。").arg(time_stamp.msecsTo(current_stamp));
|
|
|
|
time_stamp = QTime::currentTime();
|
|
QList<std::shared_ptr<ast_gen::SyntaxElement>> docs_node;
|
|
for (auto &it : forst_root) {
|
|
auto xitem = std::dynamic_pointer_cast<const ast_gen::SyntaxElement>(it);
|
|
docs_node.append(std::const_pointer_cast<ast_gen::SyntaxElement>(xitem));
|
|
context->addChild(docs_node.last());
|
|
}
|
|
|
|
auto x_root = NovalSyntax::tidy(context, docs_node);
|
|
auto novel_accesstree = std::make_shared<ast_gen::ElementAccess>(x_root);
|
|
current_stamp = QTime::currentTime();
|
|
qDebug() << QString(u8"程序结构重建消耗时间：%1 ms。").arg(time_stamp.msecsTo(current_stamp));
|
|
|
|
return analyzer_ref->validCheckWith(novel_accesstree);
|
|
}
|
|
|