一种信息查询方法、装置、设备及计算机可读存储介质
By reconstructing the syntax structure tree of programming statements, the problem of difficulty in extracting information under multiple nesting and multiple aliases is solved, realizing automated information query and accurate identification.
CN114780534BActive Publication Date: 2026-07-17SANGFOR TECH INC
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- SANGFOR TECH INC
- Filing Date
- 2022-03-02
- Publication Date
- 2026-07-17
AI Technical Summary
Technical Problem
Existing technologies cannot accurately identify multi-level nested and multi-aliased programming statements, making information difficult to extract and requiring manual intervention.
Method used
By acquiring the programming statement to be parsed, parsing it into a first syntax structure tree, determining the basic data structure, and reconstructing the first syntax structure tree based on these structures to form a second syntax structure tree, the program statement can be accurately identified and queried.
Benefits of technology
The information can be obtained without human intervention, improving readability and accuracy, and simplifying the information retrieval process.
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN114780534B_ABST
Abstract
本申请实施例公开了一种信息查询方法，该方法包括：获取待解析编程语句；其中，待解析编程语句是采用目标编程语言生成的；对待解析编程语句进行解析，确定第一语法结构树；其中，第一语法结构树中的各个节点表示语法结构树中的语法结构；基于目标编程语言对应的编程语句，确定基础数据结构；基于基础数据结构，对第一语法结构树进行重构得到第二语法结构树；其中，第二语法结构树包括第一语法结构树中的数据结构；接收语句查询请求，基于所述查询请求从所述第二语法树中进行语句查询。本申请实施例还公开了一种信息查询装置、设备及计算机可读存储介质。
Need to check novelty before this filing date? Find Prior Art