CN109901873B - Software function reconstruction method and device based on syntax tree - Google Patents
Software function reconstruction method and device based on syntax tree Download PDFInfo
- Publication number
- CN109901873B CN109901873B CN201910143455.1A CN201910143455A CN109901873B CN 109901873 B CN109901873 B CN 109901873B CN 201910143455 A CN201910143455 A CN 201910143455A CN 109901873 B CN109901873 B CN 109901873B
- Authority
- CN
- China
- Prior art keywords
- node
- syntax tree
- software
- tree
- preset format
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Landscapes
- Devices For Executing Special Programs (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a software function reconstruction method and a device based on a syntax tree, wherein the method comprises the following steps: converting the user data into a syntax tree of a predetermined format; and scheduling software functions according to the syntax tree with the preset format. The invention realizes the change of the execution track of the software function by the grammar tree with the preset format and the mode of scheduling the software function according to the grammar tree with the preset format, can carry out random and flexible reconstruction on the software function, can fully play the prior function points of the prior software, realizes greater software efficiency, improves the flexibility of the function recombination of the software after release, and reduces the technical difficulty of the software function recombination.
Description
Technical Field
The invention relates to the technical field of computer software, in particular to a software function reconstruction method and device based on a syntax tree.
Background
After release, the conventional software must be executed according to a function flow chart predetermined in software design. The actual execution flow depends on the environment and the input data, so that the pre-designed functional flow is difficult to break through. Such as the procedures described in the following pseudo-code:
if x >1
Then function a is performed and then function C is performed
Otherwise, perform function B and then perform function C
Under the control of the input variable x, the process will likely execute the function a ℃ → function C or function B → function C, forming two possible execution trajectories. However, if the trajectory of function a → function B is to be executed, it cannot be realized by using the ordinary variable input under the original flow definition of software.
In the conventional software technology, secondary development is necessary for the released software to realize free and flexible recombination of functions. I.e. programmed by a professional user with programming capabilities, through an API (application program interface) provided by the software. According to the type of the API, programming languages such as c and c # can be used, and scripting languages such as VBA and Python can also be used, but the technical threshold of the conventional software function manipulation and recombination is too high, the difficulty of software function reconstruction is high, and the software function reconstruction is difficult to implement.
Disclosure of Invention
The invention aims to provide a software function reconstruction method and device based on a syntax tree, and aims to solve the problems that the difficulty in realizing free and flexible software functions is high due to the fact that the technical threshold of operation and recombination of the existing software functions is too high.
In order to solve the technical problems, the invention adopts the following technical scheme:
a software function reconstruction method based on a syntax tree comprises the following steps:
converting the user data into a syntax tree of a predetermined format;
and scheduling software functions according to the syntax tree with the preset format.
In the foregoing software function reconfiguration method based on a syntax tree, the syntax tree in the predetermined format is a tree-like data structure; each node in the syntax tree with the preset format is a function inlet of software with functions needing to be reconstructed; the nodes comprise a root node, an intermediate node and a leaf node, and the leaf node is a starting entry point of the predetermined format syntax tree function; each node in the syntax tree with the preset format can be described by a node number, a node name, a node content or a father node number or attributes with equivalent meanings and functions.
In the software function reconstruction method based on the syntax tree, the data form of the user data includes type-attribute, data record of a database, a tree data table, a natural language and a domain language.
In the foregoing software function reconfiguration method based on the syntax tree, the conversion modes for converting the user data into the syntax tree with the predetermined format include a direct conversion mode, an indirect conversion mode, and a local conversion mode.
In the software function reconstruction method based on the syntax tree, the user data recorded in the form of type-attribute data and database data is converted into the syntax tree in a predetermined format as the direct conversion mode; the user data in the data form of type-attribute is converted into the syntax tree in the preset format, the syntax tree in the preset format is formed by linking different nodes according to the attributes of the node number and the father node number and bearing the information required by the function of the scheduling software according to the node name and the node content attribute; the user data of the data record of the data form of the database is converted into the syntax tree of the preset format, the syntax tree of the preset format is formed by linking different instances according to the fields of the serial number and the father node serial number and is loaded with information required by the function of the scheduling software according to the fields of the node name and the node content.
In the software function reconstruction method based on the syntax tree, the user data in the data form of natural language and domain language is converted into the syntax tree in a predetermined format as the indirect conversion mode; converting user data in a data form of a Domain-specific Language (Domain-specific Language) into a grammar tree in a preset format, wherein a section of Domain Language is parsed into the grammar tree in the preset format by a Domain Language parsing unit; converting the user data in the form of natural language into a grammar tree in a preset format comprises analyzing a section of natural language text into the grammar tree in the preset format through a natural language processing unit; converting the user data in the form of tree data table into a syntax tree in a preset format as the intra-office conversion mode; the syntax tree for converting the user data in the form of the tree data table into the predetermined format comprises fields according to the node names and the node contents, and directly bears the information required by the function of the scheduling software.
In the foregoing method for reconstructing software functions based on syntax trees, the scheduling software functions according to syntax trees in a predetermined format includes the following steps:
step S01, acquiring the leaf node at the leftmost side of the lowest layer of the syntax tree with the preset format;
step S02, executing the acquired node; (the node obtained by the execution may be the leftmost leaf node of the lowest layer of the syntax tree of the predetermined format obtained in the step S01 or the leaf node obtained in the step S04.)
Step S03, judging whether the executed node in the step S02 is a root node;
under the condition that the judgment result is yes, scheduling of the software function is finished according to the syntax tree in the preset format;
if the determination result is no, step S04 is executed;
step S04, judging whether the brother node of the executed node in the step S02 is executed completely;
if the determination result is yes, the parent node of the executed node in step S02 is taken;
if it is determined that none of the sibling nodes of the executed node is completely executed in step S02, executing step S05;
step S05, search the sibling nodes adjacent to the right side of the executed node in step S02, obtain the leaf node at the lowest level and the leftmost node on the sibling node branch, and then execute step S02.
In the foregoing software function reconstructing method based on syntax tree, the node obtained by executing in step S02 includes the following steps: s021, acquiring node names and contents of all child nodes in a preset format syntax tree; s022, inquiring a software function entry corresponding to the node name; step S023, calling a software function entry.
A syntax tree based software functionality reconstruction apparatus comprising: a conversion unit for converting the user data into a syntax tree of a predetermined format; and the scheduling unit is used for performing software function scheduling according to the syntax tree with the preset format.
The aforementioned syntax tree-based software function reconstruction device, the conversion unit includes: the direct conversion module is used for forming a syntax tree in a preset format according to the node number and the attribute or field of the father node number, and bearing information required by the function of the scheduling software according to the node name and the attribute or field of the node content; the indirect conversion module is used for analyzing a section of field language into a grammar tree with a preset format through the field language analyzing unit and/or used for analyzing a section of natural language text into the grammar tree with the preset format through the natural language processing unit; the local conversion module is used for bearing information required by the function of the scheduling software according to the node name and the field of the node content;
the scheduling unit includes: a first obtaining module, configured to obtain a leftmost leaf node of a lowest layer of the syntax tree in the predetermined format; an execution module for executing the acquired node; the first judgment module is used for judging whether the executed node is a root node or not; the second judgment module is used for judging whether the brother node of the executed node is executed completely; the second acquisition module is used for acquiring a father node of the currently executed node; a third obtaining module, configured to obtain a leaf node at the lowest layer and the leftmost node on an adjacent sibling node branch on the right side of the executed node;
the execution module comprises: the fourth acquisition module is used for acquiring the node names and the contents of all the child nodes in the preset format syntax tree; the query module is used for querying the software function entrance corresponding to the node name; and the calling module is used for calling the software function inlet.
A processor for running a program, wherein the program when run performs the following:
converting the user data into a syntax tree of a predetermined format;
and scheduling software functions according to the syntax tree with the preset format.
Compared with the prior art, the method realizes the change of the execution track of the software function through the syntax tree with the preset format and the mode of scheduling the software function according to the syntax tree with the preset format, can carry out random and flexible reconstruction on the software function, can fully play the existing functional points of the existing software, realizes higher software efficiency, improves the flexibility of the functional recombination of the software after release, and reduces the technical difficulty of the functional recombination of the software.
The invention (1) breaks through the limitation that the function of the software after release is limited by the original design flow in principle. The method can be executed under the drive of the tree-shaped grammar structure even if the function flow is not designed in advance, and an arbitrary and flexible function execution track is formed.
(2) The threshold of software function recombination is reduced. The user can realize function recombination without using secondary programming development and can realize the function recombination only by providing user data which can be organized into a tree-shaped data structure.
(3) By means of the complete expression capability of the grammar tree in the preset format, not only can the tracks of the sequential execution of the required software function points be formed, but also the conditional branching, circulation and recursion can be realized, and the traditional function tracks which cannot be controlled by linear variable input can be realized.
The invention has strong universality and can be realized in software products compiled in different languages and different architectures.
Drawings
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the invention and together with the description serve to explain the invention without limiting the invention, and in which:
FIG. 1 is a schematic structural diagram of an embodiment of the present invention;
FIG. 2 is a diagram of a logical model of a syntax tree in a predetermined format according to one embodiment of the present invention;
FIG. 3 is a diagram of an exemplary model of a syntax tree of a predetermined format according to the present invention;
fig. 4 is a diagram of a conversion model for converting user data into a syntax tree of a predetermined format by using an intra-office conversion scheme according to an embodiment of the present invention;
FIG. 5 is a flow diagram of software function scheduling according to one embodiment of the present invention;
FIG. 6 is a flow chart illustrating the execution of a single node in a predetermined format syntax tree in accordance with one embodiment of the present invention;
FIG. 7 is a diagram of an actual execution sequence of nodes in a predetermined format syntax tree in accordance with an embodiment of the present invention;
fig. 8 is a software function reconfiguration device according to an embodiment of the present invention.
The invention is further described with reference to the following figures and detailed description.
Detailed Description
It should be noted that the terms "first," "second," and the like in the description and claims of the present invention and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged under appropriate circumstances in order to facilitate the description of the embodiments of the invention herein. Furthermore, the terms "comprises," "comprising," and any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
Example 1 of the invention: a method for reconstructing software functions based on syntax trees, as shown in fig. 1, comprises:
converting the user data into a syntax tree of a predetermined format; each node in the syntax tree with the preset format is a function inlet of software with functions needing to be reconstructed;
and scheduling software functions according to the syntax tree with the preset format.
By the method, the user data is converted into the grammar tree with the preset format, and each node in the grammar tree with the preset format can be used as a function inlet of the function software to be reconstructed, so that the software function can be scheduled according to the grammar tree with the preset format to change the execution track of the software function, and the problems that the software function is free to realize and flexible to reconstruct due to overhigh technical threshold of the operation and recombination of the conventional software function are solved.
In order to reduce the difficulty of software function scheduling, the syntax tree in the predetermined format in this embodiment is a tree-like data structure;
FIG. 2 is a logical model of a syntax tree in a predetermined format according to the present embodiment, as shown in FIG. 2, nodes in the syntax tree in the form of a tree data structure include a root node, an intermediate node, and a leaf node, where the leaf node is a starting entry point of the tree data structure; each node in the syntax tree with the preset format can be described by adopting a node number, a node name, a node content or a father node number or equivalent meanings and functional attributes.
The syntax tree of the predetermined format in this embodiment is used for driving the software function, and the syntax tree of the predetermined format for driving the software function includes a unique root node, n intermediate nodes (n is a natural number), and child nodes. The root node and the middle node comprise at least one child node (a lower node connected through a connecting line), wherein the non-root nodes (the middle node or the child nodes) all have a unique father node (an upper node connected through the connecting line); all nodes that have a common parent are "siblings" of each other, the nodes at the lowest level are called "leaf nodes", and the leaf nodes have no children. For any one node, itself and all the lower nodes connected directly or indirectly to it are called a "branch". The leaf nodes of the lowest level are the starting function entry points of the syntax tree of the predetermined format.
Since each node in the syntax tree of the predetermined format represents a function entry of the functional software to be reconstructed, the syntax tree of the predetermined format having a connection relationship actually specifies the order and the interdependence relationship of the function points of the scheduling software.
The tree data structure is a logical structure representation of a syntax tree of a predetermined format, and for implementation, a physical structure as shown in table 1 can be adopted, as follows:
TABLE 1
The physical structure given in table 1 is a typical type-attribute data structure and is very simple to implement in object-oriented software and databases. Any one non-root node can be associated with its unique parent node by the "parent node number" attribute. If the attribute of the "father node number" is empty, the node is the root node.
In order to meet the requirements of different software function reconstruction and improve the flexibility of the existing software function reconstruction, the data form of user data comprises type-attribute, data record of a database, a tree data table, a natural language and a field language; the conversion method of converting the user data into the syntax tree of the predetermined format includes a direct conversion method, an indirect conversion method, and an intra-office conversion method.
The user data in the data form of type-attribute and data record of the database is converted into a syntax tree in a preset format, the syntax tree in the preset format is formed by linking different instances according to the attribute of the node number and the father node number and the hierarchy, and the information required by the function of the scheduling software is borne according to the attribute of the node name and the node content; the user data of the data record with the data form of the database is converted into the grammar tree with the preset format, the grammar tree with the preset format is formed by linking different nodes according to the fields of the node number and the father node number and bears the information required by the function of the scheduling software according to the fields of the node name and the node content.
Converting user data in a natural language and a domain language into a syntax tree in a preset format as the indirect conversion mode; converting user data in a data form of a domain language into a grammar tree in a preset format, wherein a section of the domain language is parsed into the grammar tree in the preset format by a domain language parsing unit; converting user data in a natural language into a grammar tree in a preset format comprises analyzing a section of natural language text into the grammar tree in the preset format through a natural language processing unit;
the conversion of user data in the form of tree data table into syntax tree in preset format is the intra-office conversion mode, and includes directly bearing information required by the function of the scheduling software according to the node name and the field of the node content.
The following describes a process of converting user data into a syntax tree in a predetermined format by using a direct conversion method, and as shown in table 2, a user fills in a form according to a software function reconstruction requirement, thereby defining a syntax tree. The direct conversion mode requires the user to define the father node number by himself, which is complicated.
TABLE 2
The process of converting user data into a syntax tree of a predetermined format by indirect conversion is described below with reference to fig. 3. In natural language "third time window of resource a or 3 minutes after 2019-05-018: 00: taking the text of execution plan as an example, the user inputs a text of natural language "resource a in the third time window or 3 minutes after 2019-05-018: 00: the text of the execution plan is processed by the natural language processing unit to form a syntax tree data structure as shown in fig. 3. In fig. 3, "1." "2." "3." "4." "5." "6." "7." "8." is a node number, "execution plan" "or" "constraint" "resource" "time window" "time point" "time length" is a node name, "resource a," "third time window," "2019-05-018: 00" "+ 3 minutes" is a node content.
Compared with a direct conversion mode and an indirect conversion mode, the intra-office conversion mode can more intuitively obtain the syntax tree in the predetermined format, as shown in fig. 4, fig. 4 is a conversion model diagram of the syntax tree in the predetermined format for converting the user data by the intra-office conversion mode in the embodiment, and a user directly edits nodes in a tree-shaped data table and the connection relationship among the nodes, so that a complicated process that the user specifies the father node number by himself is omitted, and the user data can be more conveniently converted into the syntax tree in the predetermined format.
Further, as shown in fig. 5, the software function scheduling according to the syntax tree of the predetermined format includes the following steps:
step S01, acquiring the leaf node at the leftmost side of the lowest layer of the syntax tree with the preset format;
step S02, executing the acquired node;
step S03, judging whether the executed node in the step S02 is a root node;
under the condition that the judgment result is yes, scheduling of the software function is finished according to the syntax tree in the preset format;
if the determination result is no, step S04 is executed;
step S04, judging whether the brother node of the executed node in the step S02 is executed completely;
if the determination result is yes, the parent node of the executed node in step S02 is taken;
if it is determined that none of the sibling nodes of the executed node is completely executed in step S02, executing step S05;
step S05, search the sibling nodes adjacent to the right side of the executed node in step S02, obtain the leaf node at the lowest level and the leftmost node on the sibling node branch, and then execute step S02.
Further, as shown in fig. 6, the node obtained by executing the step S02 includes the following steps:
s021, acquiring node names and contents of all child nodes in a preset format syntax tree;
step S022, inquiring a software function inlet corresponding to the node name; the name of the node corresponds to a function entry of software to be reconstructed, and functions of the software can be directly called through the node name (in a character string format) by making a simple naming convention and utilizing a general reflection technology of the software. For example, the node name is "constraint", and by adding a "func" character string in front of the node name, the function located to the software can be located according to the "func constraint".
Step S023, calling the software function entry and writing back the result. The contents of all child nodes are used as parameter values of the function, and the parameters are combined into a list. The function is called using reflection techniques in the form of a software function name and a parameter list, and an organized parameter list is passed to it.
In this embodiment, the execution sequence of the individual nodes in the syntax tree of the predetermined format is shown in fig. 7, and circled numbers (r) to (b) in fig. 7 represent the actual execution sequence of the nodes in the syntax tree of the predetermined format.
Example 2 of the invention: a syntax tree based software function reconstruction apparatus, as shown in fig. 8, comprising: a conversion unit 1 for converting user data into a syntax tree of a predetermined format; and the scheduling unit 2 is used for performing software function scheduling according to the syntax tree with the preset format. Further, the conversion unit 1 shown comprises: a direct conversion module 101, configured to form a syntax tree in a predetermined format according to the node number and the attribute or field of the parent node number, and carry information required by a scheduling software function according to the node name and the attribute or field of the node content; the indirect conversion module 102 is used for parsing a section of domain language into a grammar tree with a preset format through the domain language parsing unit and/or used for parsing a section of natural language text into a grammar tree with a preset format through the natural language processing unit; the local conversion module 103 is used for bearing information required by the function of the scheduling software according to the node name and the field of the node content; further, the scheduling unit 2 includes: a first obtaining module 201, configured to obtain a leftmost leaf node of a lowest layer of the syntax tree in the predetermined format; an execution module 202, configured to execute the acquired node; a first judging module 203, configured to judge whether an executed node is a root node; a second determining module 204, configured to determine whether a sibling node of the executed node is executed; a second obtaining module 205, configured to obtain a parent node of a currently executed node; a third obtaining module 206, configured to obtain a leaf node at the lowest layer and the leftmost node on a branch of an adjacent sibling node on the right side of the executed node; further, the executing module 202 includes: a fourth obtaining module 2022, configured to obtain node names and contents of all child nodes in the syntax tree with the predetermined format; the query module 2023 is configured to query the software function entry corresponding to the node name; a calling module 2024, configured to call the software function entry.
Example 3 of the invention: a processor for running a program, wherein the program when run performs the following: converting the user data into a syntax tree of a predetermined format; and scheduling software functions according to the syntax tree with the preset format.
Claims (6)
1. A software function reconstruction method based on a syntax tree is characterized by comprising the following steps:
converting the user data into a syntax tree of a predetermined format;
performing software function scheduling according to the syntax tree with the preset format;
the data form of the user data comprises type-attribute, data record of a database, a tree data table, a natural language and a field language; the conversion mode for converting the user data into the grammar tree with the preset format comprises a direct conversion mode, an indirect conversion mode and an intra-office conversion mode;
converting the user data of the data record in the form of type-attribute and database into a syntax tree in a preset format as the direct conversion mode; the user data in the data form of type-attribute is converted into the syntax tree in the preset format, the syntax tree in the preset format is formed by linking different nodes according to the attributes of the node number and the father node number and bearing the information required by the function of the scheduling software according to the node name and the node content attribute;
the user data of the data record of the database in the data form is converted into the syntax tree with a preset format, the syntax tree with the preset format is formed by hierarchically linking different instances according to the fields of the node number and the father node number, and the information required by the function of the scheduling software is borne according to the fields of the node name and the node content;
converting the user data in the data form of natural language and domain language into a syntax tree in a preset format as the indirect conversion mode;
converting user data in a data form of a domain language into a grammar tree in a preset format, wherein a section of domain language is parsed into the grammar tree in the preset format by a domain language parsing unit;
converting the user data in the form of natural language into a grammar tree in a preset format comprises analyzing a section of natural language text into the grammar tree in the preset format through a natural language processing unit;
converting the user data in the data form of the tree data table into a syntax tree in a preset format to be the intra-office conversion mode;
the syntax tree for converting the user data in the form of the tree data table into the predetermined format comprises fields according to the node names and the node contents, and directly bears the information required by the function of the scheduling software.
2. The syntax tree-based software function reconfiguration method according to claim 1, wherein said syntax tree of predetermined format is a tree-like data structure;
each node in the syntax tree with the preset format is a function inlet of software with functions needing to be reconstructed;
the nodes comprise a root node, an intermediate node and a leaf node, and the leaf node is a starting entry point of the predetermined format syntax tree function;
each node in the syntax tree with the preset format can be described by a node number, a node name, a node content or a father node number or attributes with equivalent meanings and functions.
3. Method according to any of claims 1 to 2, wherein said software function scheduling according to a syntax tree of a predetermined format comprises the steps of:
step S01, acquiring the leaf node at the leftmost side of the lowest layer of the syntax tree with the preset format;
step S02, executing the acquired node;
step S03, judging whether the executed node in the step S02 is a root node;
under the condition that the judgment result is yes, scheduling of the software function is finished according to the syntax tree in the preset format;
if the determination result is no, step S04 is executed;
step S04, judging whether the brother node of the executed node in the step S02 is executed completely;
if the determination result is yes, the parent node of the executed node in step S02 is taken;
if it is determined that none of the sibling nodes of the executed node is completely executed in step S02, executing step S05;
step S05, search the sibling nodes adjacent to the right side of the executed node in step S02, obtain the leaf node at the lowest level and the leftmost node on the sibling node branch, and then execute step S02.
4. The syntax tree-based software function reconstruction method according to claim 3, wherein the executing the obtained nodes in step S02 comprises the steps of:
s021, acquiring node names and contents of all child nodes in a preset format syntax tree;
step S022, inquiring a software function inlet corresponding to the node name;
step S023, calling a software function entry.
5. A syntax tree based software function reconstruction apparatus, comprising:
a conversion unit (1) for converting user data into a syntax tree of a predetermined format;
a scheduling unit (2) for performing software function scheduling according to the syntax tree of the predetermined format;
the conversion unit includes:
the direct conversion module (101) is used for forming a syntax tree with a preset format according to the node number and the attribute or field of the father node number, and carrying information required by the software scheduling function according to the node name and the attribute or field of the node content;
an indirect conversion module (102) for parsing a section of domain language into a syntax tree of a predetermined format by a domain language parsing unit and/or for parsing a section of natural language text into a syntax tree of a predetermined format by a natural language processing unit;
the local conversion module (103) is used for bearing information required by the function of the scheduling software according to the node name and the field of the node content;
the scheduling unit includes:
a first obtaining module (201) for obtaining a leaf node at the leftmost side of the lowest layer of the syntax tree in the predetermined format;
an execution module (202) for executing the acquired node;
a first judging module (203) for judging whether the executed node is a root node;
a second judging module (204) for judging whether the execution of the brother node of the executed node is finished;
a second obtaining module (205) for obtaining a parent node of the currently executed node;
a third obtaining module (206) for obtaining the leaf node at the lowest layer and the leftmost node on the adjacent brother node branch at the right side of the executed node;
the execution module (202) comprises:
a fourth obtaining module (2022) for obtaining node names and contents of all child nodes in the predetermined format syntax tree;
the query module (2023) is used for querying the software function entry corresponding to the node name;
and the calling module (2024) is used for calling the software function entrance.
6. A processor for executing the program for the syntax tree based software functionality reconstruction method according to any one of claims 1 to 4, wherein the program when executed performs the following operations:
converting the user data into a syntax tree of a predetermined format;
and scheduling software functions according to the syntax tree with the preset format.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910143455.1A CN109901873B (en) | 2019-02-26 | 2019-02-26 | Software function reconstruction method and device based on syntax tree |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910143455.1A CN109901873B (en) | 2019-02-26 | 2019-02-26 | Software function reconstruction method and device based on syntax tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109901873A CN109901873A (en) | 2019-06-18 |
| CN109901873B true CN109901873B (en) | 2022-05-10 |
Family
ID=66945652
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910143455.1A Active CN109901873B (en) | 2019-02-26 | 2019-02-26 | Software function reconstruction method and device based on syntax tree |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109901873B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110659063A (en) * | 2019-08-08 | 2020-01-07 | 平安科技（深圳）有限公司 | Software project reconstruction method and device, computer device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103593182A (en) * | 2013-10-27 | 2014-02-19 | 沈阳建筑大学 | Method for reconfiguring software by using clustering mode |
| CN103645986A (en) * | 2013-11-29 | 2014-03-19 | 北京广利核系统工程有限公司 | Generation method and reconstruction method of visualization syntax tree of compiler |
| CN105867906A (en) * | 2016-03-22 | 2016-08-17 | 东南大学 | Software evolution-oriented code replaceability assessment method |
| CN106844380A (en) * | 2015-12-04 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of database operation method, information processing method and related device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10157055B2 (en) * | 2016-09-29 | 2018-12-18 | Microsoft Technology Licensing, Llc | Code refactoring mechanism for asynchronous code optimization using topological sorting |
-
2019
- 2019-02-26 CN CN201910143455.1A patent/CN109901873B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103593182A (en) * | 2013-10-27 | 2014-02-19 | 沈阳建筑大学 | Method for reconfiguring software by using clustering mode |
| CN103645986A (en) * | 2013-11-29 | 2014-03-19 | 北京广利核系统工程有限公司 | Generation method and reconstruction method of visualization syntax tree of compiler |
| CN106844380A (en) * | 2015-12-04 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of database operation method, information processing method and related device |
| CN105867906A (en) * | 2016-03-22 | 2016-08-17 | 东南大学 | Software evolution-oriented code replaceability assessment method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109901873A (en) | 2019-06-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102033748A (en) | Method for generating data processing flow codes | |
| Fahrner et al. | A survey of database design transformations based on the entity-relationship model | |
| CN106934062A (en) | A kind of realization method and system of inquiry elasticsearch | |
| CN101777004B (en) | Method and system for realizing BPEL sub-process multiplexing based on template in service-oriented environment | |
| EP0593341A1 (en) | Query optimisation help method of a relational database management system and resulting syntactic analysis method | |
| WO1996017312A1 (en) | End user query facility | |
| CN111104106A (en) | Visual development method, system and medium for integrating business process and communication message | |
| CN111309757A (en) | SQL interpreter and optimization method of HBase | |
| CN107133027A (en) | A kind of syntax tree stratification method for expressing | |
| WO2023065629A1 (en) | Dialogue management method and system, and terminal and storage medium | |
| CN110059085A (en) | A kind of parsing of JSON data and modeling method of web oriented 2.0 | |
| CN109901873B (en) | Software function reconstruction method and device based on syntax tree | |
| Bosch et al. | XSLT transformation generating OWL ontologies automatically based on XML Schemas | |
| CN111666372B (en) | Method, device, electronic equipment and readable storage medium for analyzing query word query | |
| CN106250134A (en) | The code automatic generation method of unicity language | |
| CN109992271B (en) | Layered architecture recognition method based on code vocabulary and structure dependence | |
| CN113535177A (en) | Form generation method, device and equipment | |
| CN106508009B (en) | A kind of processor-oriented high-level language source program flow process map generalization method | |
| CN106649219B (en) | A kind of telecommunication satellite design document automatic generation method | |
| CN110806973A (en) | Automatic generation method and device of interface message | |
| CN115756449A (en) | Page multiplexing method and device, storage medium and electronic equipment | |
| CN110120945A (en) | A kind of method of data structured encapsulation | |
| CN115469860A (en) | Method and system for automatically generating demand-to-software field model based on instruction set | |
| CN108509187A (en) | A kind of method and system of automatic generating software platform MIB function codes | |
| CN115292347A (en) | Active SQL algorithm performance checking device and method based on rules |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |