CN109901873A - Software function reconstructing method and device based on syntax tree - Google Patents
Software function reconstructing method and device based on syntax tree Download PDFInfo
- Publication number
- CN109901873A CN109901873A CN201910143455.1A CN201910143455A CN109901873A CN 109901873 A CN109901873 A CN 109901873A CN 201910143455 A CN201910143455 A CN 201910143455A CN 109901873 A CN109901873 A CN 109901873A
- Authority
- CN
- China
- Prior art keywords
- node
- syntax tree
- predetermined format
- software function
- tree
- 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.)
- Granted
Links
Landscapes
- Devices For Executing Special Programs (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a kind of software function reconstructing method and device based on syntax tree, wherein this method comprises: user data to be converted to the syntax tree of predetermined format；Software function scheduling is carried out according to the syntax tree of the predetermined format.The present invention realizes the change to software function execution track by way of the syntax tree of predetermined format and according to predetermined format syntax tree dispatcher software function, arbitrary, flexible reconstruct can be carried out to software function, the existing function point of existing software can be given full play to, realize bigger software efficiency, the flexibility for improving software function integrity after distribution reduces the technical difficulty of software function recombination.
Description
Technical field
The present invention relates to computer software technical fields, in particular to the software function reconstruct side based on syntax tree
Method and device.
Background technique
Traditional software is after distribution, it is necessary to which scheduled functional flow diagram carries out when according to software design.And it actually executes
Process depends on the data of environment and input, and therefore, it is difficult to break through the functional sequence being pre-designed.Such as following pseudo code description
Process:
If x > 1
Function A is so executed, function C is then executed
Otherwise function B is executed, function C is then executed
By the control of input variable x, the above process will likely execute A DEG C of function → function C or function B → function C, shape
At two kinds of possible execution tracks.But if executing the track function A → function B, under the original flow definition of software, benefit
It is inputted, be cannot achieve with common variable.
In traditional software technology, software after publication is to realize free, the flexible recombination of function, it is necessary to carry out two
Secondary exploitation.The API (application programming interfaces) provided by the software, is compiled by the professional user with programming ability
Journey.According to API type, the programming languages such as c, c# can be used, the scripting languages such as VBA, Python also can be used, but all make existing
The technical threshold for having software function to manipulate and recombinate is excessively high, and software function reconstructs very difficult, it is difficult to implement.
Summary of the invention
The object of the present invention is to provide a kind of software function reconstructing method and device based on syntax tree, with solve by
Excessively high in the technical threshold that existing software function is operated and recombinated, software function realizes the high problem of free, flexible recombination difficulty.
In order to solve the above technical problems, the present invention adopts the following technical scheme that:
A kind of software function reconstructing method based on syntax tree, comprising:
User data is converted to the syntax tree of predetermined format；
Software function scheduling is carried out according to the syntax tree of the predetermined format.
Software function reconstructing method above-mentioned based on syntax tree, the syntax tree of the predetermined format are tree shaped data knot
Structure；Each node in the syntax tree of predetermined format is a functional entrance for needing the software of recombination function；The node packet
Root node, intermediate node and leaf node are included, the leaf node is the initial inlet point of the predetermined format syntax tree function；Institute
State the equal enabled node number of each node in the syntax tree of predetermined format, nodename, node content or father node number or same
Etc. the attribute of meanings and function be described.
Software function reconstructing method above-mentioned based on syntax tree, the data mode of the user data include type-category
Property, the data record of database, tree shaped data table, natural language and domain language.
Software function reconstructing method above-mentioned based on syntax tree, the grammer that user data is converted to predetermined format
The conversion regime of tree includes direct conversion regime, indirect conversion mode and intra-office conversion regime.
Software function reconstructing method above-mentioned based on syntax tree, the data mode are type-attribute and database
The syntax tree that the user data of data record is converted to predetermined format is the direct conversion regime；The data mode is class
The syntax tree that type-attribute user data is converted to predetermined format includes the attribute numbered according to node serial number and father node, is pressed
Level links different nodes, forms the syntax tree of predetermined format, and according to nodename and node content attribute, carrying scheduling is soft
Information required for part function；The data mode is that the user data of the data record of database is converted to the language of predetermined format
Method tree includes linking different instances according to the field of number and father node number by level, forming the syntax tree of predetermined format, root
According to the field of nodename and node content, information required for dispatcher software function is carried.
Software function reconstructing method above-mentioned based on syntax tree, the data mode are natural language and domain language
The syntax tree that user data is converted to predetermined format is the indirect conversion mode；The data mode is domain language
The syntax tree that the user data of (Domain-Specifi Language) is converted to predetermined format includes being parsed by domain language
One section of domain language is parsed into the syntax tree of predetermined format by unit；The data mode is that the user data of natural language turns
The syntax tree for being changed to predetermined format includes that one section of natural language text is resolved to predetermined format by natural language processing unit
Syntax tree；The data mode be tree shaped data table user data be converted to predetermined format syntax tree be the intra-office turn
Change mode；It includes according to node name that the data mode, which is converted to the syntax tree of predetermined format for the user data of tree shaped data table,
Claim the field with node content, directly information required for carrying dispatcher software function.
Software function reconstructing method above-mentioned based on syntax tree, it is described that software function is carried out according to the syntax tree of predetermined format
It can dispatch and include the following steps:
Step S01: the leaf node of the predetermined format syntax tree lowest level leftmost side is obtained；
Step S02: acquired node is executed；(be performed acquired node can be obtained in step S01 it is predetermined
The leaf node of the format syntax tree lowest level leftmost side, is also possible to the leaf node obtained in step S04)
Step S03: judge whether the node being performed in the step S02 is root node；
In the case where the judgment result is yes, the finishing scheduling of software function is carried out according to the syntax tree of predetermined format；
If the determination result is NO, S04 is thened follow the steps；
Step S04: judge whether the brotgher of node for being performed node in the step S02 is performed and finish；
In the case where the judgment result is yes, then the father node that node is performed in step S02 is taken；
The brotgher of node that node is performed in judging the step S02 is not carried out in the case where finish, then is executed
Step S05；
Step S05: the brotgher of node adjacent on the right side of node with being performed in the step S02 is searched, the brother is obtained
Then the leaf node of the lowermost layer leftmost side in node branch executes step S02.
Software function reconstructing method above-mentioned based on syntax tree executes acquired node described in the step S02
Include the following steps: step S021: obtaining the content of the nodename and all child nodes in predetermined format syntax tree；Step
S022: the corresponding software function entrance of query node title；Step S023: software function entrance is called.
A kind of software function reconstruct device based on syntax tree, comprising: converting unit, it is pre- for being converted to user data
The syntax tree for the formula that fixes；Scheduling unit, for carrying out software function scheduling according to the syntax tree of the predetermined format.
Software function above-mentioned based on syntax tree reconstructs device, and the converting unit includes: direct conversion module, is used for
The attribute or field numbered according to node serial number and father node form the syntax tree of predetermined format, according in nodename and node
Information required for attribute or field the carrying dispatcher software function of appearance；Indirect conversion module, for being parsed by domain language
Unit by one section of domain language be parsed into the syntax tree of predetermined format and/or be used for by natural language processing unit by one section from
Right language text resolves to the syntax tree of predetermined format；Intra-office conversion module, for the word according to nodename and node content
Information required for section carrying dispatcher software function；
The scheduling unit includes: the first acquisition module, for obtaining the predetermined format syntax tree lowest level leftmost side
Leaf node；Execution module, for executing acquired node；First judgment module, whether the node for judging to be performed
For root node；Second judgment module is finished for judging whether the brotgher of node for being performed node is performed；Second obtains mould
Block, for obtaining the father node for being currently performed node；Third obtains module, is performed adjacent brother on the right side of node for obtaining
The leaf node of the lowermost layer leftmost side in node branch；
The execution module includes: the 4th acquisition module, for obtaining nodename and institute in predetermined format syntax tree
There is the content of child node；Enquiry module is used for the corresponding software function entrance of query node title；Calling module, for calling
Software function entrance.
A kind of processor, the processor is for running program, wherein following operation is executed when described program is run:
User data is converted to the syntax tree of predetermined format；
Software function scheduling is carried out according to the syntax tree of the predetermined format.
Compared with prior art, the present invention is by the syntax tree of predetermined format and according to predetermined format syntax tree dispatcher software
The mode of function realizes the change to software function execution track, and arbitrary, flexible reconstruct can be carried out to software function,
The existing function point of existing software can be given full play to, bigger software efficiency is realized, improves software function weight after distribution
The flexibility of group reduces the technical difficulty of software function recombination.
(1) of the invention breaches limitation of the function of software after distribution by former design cycle from principle.So that i.e.
It execute the functional sequence not being pre-designed can also under the driving of tree-shaped syntactic structure, form any, flexible function and hold
Row track.
(2) threshold of software function recombination is reduced.So that user need not use quadratic programming exploitation to be just able to achieve function
Recombination, and only relying on offer can organize to can be realized for the user data of tree data structure.
(3) ability to express complete by the syntax tree of predetermined format, it is successively suitable not only to form required software function point
The track that sequence executes, is also able to achieve conditional branching, circulation, recurrence, these traditional linear variables input uncontrollable function
Track.
The present invention is versatile, can realize in the software product that different language, different frameworks are worked out.
Detailed description of the invention
The drawings described herein are used to provide a further understanding of the present invention, constitutes part of this application, this hair
Bright illustrative embodiments and their description are used to explain the present invention, and are not constituted improper limitations of the present invention, in the accompanying drawings:
Fig. 1 is a kind of structural schematic diagram of embodiment of the invention；
Fig. 2 is the logical model figure of the syntax tree of the predetermined format of an embodiment of the present invention；
Fig. 3 is a kind of instance model figure of predetermined format syntax tree of the invention；
Fig. 4 is the syntax tree that user data is converted into predetermined format that the embodiment of the present invention uses intra-office conversion regime
Transformation model figure；
Fig. 5 is the software function scheduling flow figure of an embodiment of the present invention；
Fig. 6 is the execution flow chart of individual node in an embodiment of the present invention predetermined format syntax tree；
Fig. 7 is the practical execution precedence diagram of each node in an embodiment of the present invention predetermined format syntax tree；
Fig. 8 is the software function reconstruct device of an embodiment of the present invention.
The present invention is further illustrated with reference to the accompanying drawings and detailed description.
Specific embodiment
It should be noted that description and claims of this specification and term " first " in above-mentioned attached drawing, "
Two " etc. be to be used to distinguish similar objects, without being used to describe a particular order or precedence order.It should be understood that using in this way
Data be interchangeable under appropriate circumstances, so as to the embodiment of the present invention described herein.Furthermore term " includes " and " tool
Have " and their any deformation, it is intended that covering non-exclusive includes such as to contain the mistake of a series of steps or units
Journey, method, system, product or equipment those of are not necessarily limited to be clearly listed step or unit, but may include unclear
Other step or units that ground is listed or intrinsic for these process, methods, product or equipment.
The embodiment of the present invention 1: a kind of software function reconstructing method based on syntax tree includes: as shown in Figure 1
User data is converted to the syntax tree of predetermined format；Each node in the syntax tree of the predetermined format is
Need a functional entrance of the software of recombination function；
Software function scheduling is carried out according to the syntax tree of the predetermined format.
User data is converted to the syntax tree of predetermined format, each section in predetermined format syntax tree by the above method
Point can be used as a functional entrance for needing recombination function software, so as to be carried out according to the syntax tree of the predetermined format
The scheduling of software function solves the skill for being operated and being recombinated due to existing software function to change the execution track of software function
Art threshold is excessively high, and software function, which is realized, freely, flexibly recombinates the high problem of difficulty.
In order to reduce the difficulty of software function scheduling, the syntax tree of predetermined format is tree data structure in the present embodiment；
Fig. 2 is the logical model of the syntax tree of the present embodiment predetermined format, as shown in Fig. 2, the tree data structure shape
Node in formula syntax tree includes root node, intermediate node and leaf node, and the leaf node is the tree data structure
Initial inlet point；In the syntax tree of the predetermined format each node can be used node serial number, nodename, node content or
Father node number or equivalent meanings and functional attributes are described.
The syntax tree of predetermined format is used for drive software function, the predetermined format for drive software function in the present embodiment
Syntax tree include unique root node, n intermediate node (n is natural number), child node.Root node and intermediate node include
There is at least one child node (the lower section node connected by connecting line), wherein non-root node (intermediate node or child node) has
Unique father node (the top node connected by connecting line)；All nodes for possessing common parent are " brother's section mutually
Point ", the node positioned at lowermost layer are known as " leaf node ", and leaf node does not have child node.For any one node, itself
And directly or all lower section nodes for being indirectly connected with are known as one " branch ".The leaf node of lowermost layer is the predetermined format
The starting functional entrance point of syntax tree.
A functional entrance of recombination function software is needed since each node in the syntax tree of predetermined format represents,
Therefore with connection relationship predetermined format syntax tree in fact, specify each function point of dispatcher software sequence and mutually
Dependence.
Tree data structure is the logical construction form of expression of predetermined format syntax tree, in realizations for, can use such as
The physical structure of table 1 is as follows:
Table 1
The physical structure provided in table 1 is typical type-attribute data structures, in object-oriented software and database
In implement it is very easy.By " father node number " attribute, any one non-root node can be saved with its unique father
Point is mapped.If the attribute of " father node number " is sky, which is root node.
In order to adapt to the demand of different software function remodeling, the flexibility of existing software function reconstruct, user data are improved
Data mode include type-attribute, the data record of database, tree shaped data table, natural language and domain language；By user
The conversion regime that data are converted to the syntax tree of predetermined format includes direct conversion regime, indirect conversion mode and intra-office conversion side
Formula.
Wherein, data mode is that the user data of the data record of type-attribute and database is converted to predetermined format
Syntax tree is direct conversion regime, according to the attribute that node serial number and father node are numbered, links different instances by level, is formed pre-
The syntax tree for the formula that fixes carries information required for dispatcher software function according to the attribute of nodename and node content；Data
Form includes being saved according to node serial number and father for the syntax tree that the user data of the data record of database is converted to predetermined format
The field of point number, different nodes is linked by level, forms the syntax tree of predetermined format, according to nodename and node content
Field, carry dispatcher software function required for information.
Wherein, data mode is that be converted to the syntax tree of predetermined format be institute for the user data of natural language and domain language
State indirect conversion mode；Data mode is that the user data of domain language is converted to the syntax tree of predetermined format including passing through field
One section of domain language is parsed into the syntax tree of predetermined format by language resolution unit；Data mode is the number of users of natural language
It include being resolved to one section of natural language text predetermined by natural language processing unit according to the syntax tree for being converted to predetermined format
The syntax tree of format；
Wherein, data mode be tree shaped data table user data be converted to predetermined format syntax tree be the intra-office turn
Mode is changed, including the field according to nodename and node content, directly information required for carrying dispatcher software function.
Illustrate the mistake for the syntax tree that user data is converted to predetermined format using direct conversion regime below with reference to table 2
Journey, as shown in table 2, user are filled up a form according to software function reconfiguration requirement, to define a syntax tree.Using directly conversion
Mode needs user's self-defining father node to number, comparatively laborious.
Table 2
User data is converted to the mistake of the syntax tree of predetermined format using indirect conversion mode by 3 explanations with reference to the accompanying drawing
Journey.Text with natural language " 3 minutes after the third time window or 2019-05-01 8:00 of resource A: Execution plan " is
Example, it is " the third time window or 2019-05-01 of resource A that user, which inputs natural language into natural language processing unit,
3 minutes after 8:00: Execution plan " text form syntax tree number as shown in Figure 3 after natural language processing cell processing
According to structure." 1. " " 2. " " 3. " " 4. " " 5. " " 6. " " 7. " " 8. " are node serial number, " Execution plan " "or" " constraint " in Fig. 3
" constraint " " resource " " time window " " time point " " time span " be nodename, " resource A ", " third time window ",
" 2019-05-01 8:00 " "+3 minutes " is node content.
Compared with direct conversion regime, indirect conversion mode, intra-office conversion regime more intuitive can obtain pre- fix
The syntax tree of formula, as shown in figure 4, Fig. 4, which is the present embodiment, is converted into predetermined format for user data using intra-office conversion regime
Syntax tree transformation model figure, the connection relationship between node and each node in user's direct editing tree shaped data table saves
It has gone user voluntarily to specify the complicated processes of father node number, user data easily more can be converted into predetermined format
Syntax tree.
Further, include the following steps: as shown in figure 5, carrying out software function scheduling according to the syntax tree of predetermined format
Step S01: the leaf node of the predetermined format syntax tree lowest level leftmost side is obtained；
Step S02: acquired node is executed；
Step S03: judge whether the node being performed in the step S02 is root node；
In the case where the judgment result is yes, the finishing scheduling of software function is carried out according to the syntax tree of predetermined format；
If the determination result is NO, S04 is thened follow the steps；
Step S04: judge whether the brotgher of node for being performed node in the step S02 is performed and finish；
In the case where the judgment result is yes, then the father node that node is performed in step S02 is taken；
The brotgher of node that node is performed in judging the step S02 is not carried out in the case where finish, then is executed
Step S05；
Step S05: the brotgher of node adjacent on the right side of node with being performed in the step S02 is searched, the brother is obtained
Then the leaf node of the lowermost layer leftmost side in node branch executes step S02.
Further, include the following steps: as shown in fig. 6, executing acquired node described in step S02
Step S021: the content of the nodename and all child nodes in predetermined format syntax tree is obtained；
Step S022: the corresponding software function entrance of query node title；The title of node has corresponded to required reconstruction software
Functional entrance, using the reflection technology of software generic, the nodename can be passed through by doing a simple naming convention
(string format) calls directly the function of software.For example nodename is that " constraint " is added according to agreement in the front
" func " character string, so that it may according to the function of " func constraint " positioning to software.
Step S023: software function entrance, write-back result are called.Using the content of all child nodes as the parameter of the function
These parameters are formed a list by value.In the way of software function name and parameter list, the letter is called using reflection technology
Number, and the parameter list organized is transmitted to it.
In the present embodiment, the execution sequence of individual node is as shown in fig. 7, circle number in Fig. 7 in the syntax tree of predetermined format
1. word executes sequence to 8. representing the practical of each node in predetermined format syntax tree.
The embodiment of the present invention 2: a kind of software function reconstruct device based on syntax tree, as shown in Figure 8, comprising: conversion
Unit 1, for user data to be converted to the syntax tree of predetermined format；Scheduling unit 2, for the language according to the predetermined format
Method tree carries out software function scheduling.Further, shown converting unit 1 includes: direct conversion module 101, for according to node
The attribute or field of number and father node number form the syntax tree of predetermined format, according to the attribute of nodename and node content
Or information required for field carrying dispatcher software function；Indirect conversion module 102, will for passing through domain language resolution unit
One section of domain language is parsed into the syntax tree of predetermined format and/or for passing through natural language processing unit for one section of natural language
Text resolution is the syntax tree of predetermined format；Intra-office conversion module 103, for being held according to the field of nodename and node content
Carry information required for dispatcher software function；Further, the scheduling unit 2 includes: the first acquisition module 201, for obtaining
Take the leaf node of the predetermined format syntax tree lowest level leftmost side；Execution module 202, for executing acquired node；The
One judges 203 pieces of mould, for judging whether the node being performed is root node；Second judgment module 204 is performed for judging
Whether the brotgher of node of node, which is performed, finishes；Second obtains module 205, for obtaining the father node for being currently performed node；
Third obtains module 206, for obtaining the leaf node for being performed the lowermost layer leftmost side in adjacent brotgher of node branch on the right side of node；
Further, the execution module 202 includes: the 4th acquisition module 2022, for obtaining the node in predetermined format syntax tree
The content of title and all child nodes；Enquiry module 2023 is used for the corresponding software function entrance of query node title；Call mould
Block 2024, for calling software function entrance.
The embodiment of the present invention 3: a kind of processor, the processor is for running program, wherein when described program is run
It executes following operation: user data is converted to the syntax tree of predetermined format；It is carried out according to the syntax tree of the predetermined format soft
The scheduling of part function.
Claims (10)
1. a kind of software function reconstructing method based on syntax tree characterized by comprising
User data is converted to the syntax tree of predetermined format；
Software function scheduling is carried out according to the syntax tree of the predetermined format.
2. the software function reconstructing method according to claim 1 based on syntax tree, which is characterized in that the predetermined format
Syntax tree be tree data structure；
Each node in the syntax tree of the predetermined format is a functional entrance for needing the software of recombination function；
The node includes root node, intermediate node and leaf node, and the leaf node is the predetermined format syntax tree function
Initial inlet point；
The equal enabled node number of each node, nodename, node content or father node are compiled in the syntax tree of the predetermined format
Number or the attribute of equivalent meanings and function be described.
3. the software function reconstructing method according to claim 1 based on syntax tree, which is characterized in that the user data
Data mode include type-attribute, the data record of database, tree shaped data table, natural language and domain language；By user
The conversion regime that data are converted to the syntax tree of predetermined format includes direct conversion regime, indirect conversion mode and intra-office conversion side
Formula.
4. the software function reconstructing method according to claim 3 based on syntax tree, which is characterized in that the data mode
For the user data of the data record of type-attribute and database, to be converted to the syntax tree of predetermined format be the direct conversion side
Formula；
The data mode be type-attribute user data be converted to predetermined format syntax tree include according to node serial number and
The attribute of father node number, different nodes is linked by level, the syntax tree of predetermined format is formed, according to nodename and node
Contents attribute carries information required for dispatcher software function；
It includes according to section that the data mode, which is converted to the syntax tree of predetermined format for the user data of the data record of database,
The field of point number and father node number links different instances by level, the syntax tree of predetermined format is formed, according to nodename
With the field of node content, information required for dispatcher software function is carried.
5. the software function reconstructing method according to claim 3 based on syntax tree, which is characterized in that the data mode
For the user data of natural language and domain language, to be converted to the syntax tree of predetermined format be the indirect conversion mode；
The data mode is that the user data of domain language is converted to the syntax tree of predetermined format including by domain language solution
Unit is analysed, one section of domain language is parsed into the syntax tree of predetermined format；
The data mode is that the user data of natural language is converted to the syntax tree of predetermined format including by natural language
Unit is managed, one section of natural language text is resolved to the syntax tree of predetermined format；
The data mode is that be converted to the syntax tree of predetermined format be the intra-office conversion side to the user data of tree shaped data table
Formula；
It includes according to nodename that the data mode, which is converted to the syntax tree of predetermined format for the user data of tree shaped data table,
With the field of node content, directly information required for carrying dispatcher software function.
6. according to claim 1 to method described in any claim in 5, which is characterized in that the grammer according to predetermined format
Tree carries out software function scheduling and includes the following steps:
Step S01: the leaf node of the predetermined format syntax tree lowest level leftmost side is obtained；
Step S02: acquired node is executed；
Step S03: judge whether the node being performed in the step S02 is root node；
In the case where the judgment result is yes, the finishing scheduling of software function is carried out according to the syntax tree of predetermined format；
If the determination result is NO, S04 is thened follow the steps；
Step S04: judge whether the brotgher of node for being performed node in the step S02 is performed and finish；
In the case where the judgment result is yes, then the father node that node is performed in step S02 is taken；
The brotgher of node that node is performed in judging the step S02 is not carried out in the case where finish, and is thened follow the steps
S05；
Step S05: the brotgher of node adjacent on the right side of node with being performed in the step S02 is searched, the brotgher of node is obtained
Then the leaf node of the lowermost layer leftmost side in branch executes step S02.
7. the software function reconstructing method according to claim 6 based on syntax tree, which is characterized in that institute in step S02
The node acquired in executing is stated to include the following steps:
Step S021: the content of the nodename and all child nodes in predetermined format syntax tree is obtained；
Step S022: the corresponding software function entrance of query node title；
Step S023: software function entrance is called.
8. a kind of software function based on syntax tree reconstructs device characterized by comprising
Converting unit (1), for user data to be converted to the syntax tree of predetermined format；
Scheduling unit (2), for carrying out software function scheduling according to the syntax tree of the predetermined format.
9. device according to claim 8, which is characterized in that the converting unit includes:
Direct conversion module (101), for forming predetermined format according to the attribute or field of node serial number and father node number
Syntax tree, information required for carrying dispatcher software function according to the attribute or field of nodename and node content；
Indirect conversion module (102), for one section of domain language to be parsed into predetermined format by domain language resolution unit
Syntax tree and/or syntax tree for one section of natural language text to be resolved to predetermined format by natural language processing unit；
Intra-office conversion module (103), required for carrying dispatcher software function according to the field of nodename and node content
Information；
The scheduling unit includes:
First obtains module (201), for obtaining the leaf node of the predetermined format syntax tree lowest level leftmost side；
Execution module (202), for executing acquired node；
First judgment module (203), for judging whether the node being performed is root node；
Second judgment module (204) is finished for judging whether the brotgher of node for being performed node is performed；
Second obtains module (205), for obtaining the father node for being currently performed node；
Third obtains module (206), is performed on the right side of node the lowermost layer leftmost side in adjacent brotgher of node branch for obtaining
Leaf node；
The execution module (202) includes:
4th obtains module (2022), for obtaining the content of nodename and all child nodes in predetermined format syntax tree；
Enquiry module (2023) is used for the corresponding software function entrance of query node title；
Calling module (2024), for calling software function entrance.
10. a kind of processor, which is characterized in that the processor is for running program, wherein executed when described program is run with
Lower operation:
User data is converted to the syntax tree of predetermined format；
Software function scheduling is carried out according to the syntax tree of the predetermined 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 true CN109901873A (en) | 2019-06-18 |
| CN109901873B 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) |
Cited By (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 (5)
| 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 |
| US20180088937A1 (en) * | 2016-09-29 | 2018-03-29 | 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 (5)
| 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 |
| US20180088937A1 (en) * | 2016-09-29 | 2018-03-29 | Microsoft Technology Licensing, Llc | Code refactoring mechanism for asynchronous code optimization using topological sorting |
Cited By (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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109901873B (en) | 2022-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102033748B (en) | Method for generating data processing flow codes | |
| CN104598635B (en) | A kind of complex documents automatic generation method based on XML descriptions | |
| CN103235743B (en) | A kind of based on decomposing and the multiple goal test assignment dispatching method of optimum solution follow-up strategy | |
| CN101464799A (en) | MPI parallel programming system based on visual modeling and automatic skeleton code generation method | |
| CN106682343A (en) | Method for formally verifying adjacent matrixes on basis of diagrams | |
| CN101841515A (en) | Target variable protocol data unit codec code automatic generation implementation method | |
| CN109683946A (en) | A kind of user comment recommended method based on Code Clones technology | |
| CN109189393A (en) | Method for processing business and device | |
| CN106250134A (en) | The code automatic generation method of unicity language | |
| CN109901873A (en) | Software function reconstructing method and device based on syntax tree | |
| CN109656943A (en) | Shield the data service method of Query in Heterogeneous Databases complexity | |
| O'Brien et al. | SEEK: Accomplishing enterprise information integration across heterogeneous sources. | |
| CN110109658A (en) | A kind of ROS code generator and code generating method based on formalized model | |
| CN103700019A (en) | Food quality analysis method | |
| CN106874442A (en) | Named by data name and realize data from the method and device for carrying characteristic information | |
| Roepstorff | Industrial development in Indonesia: Performance and prospects | |
| CN102314371A (en) | Coding method, decoding method and coding/decoding device based on extensible markup language (XML) | |
| CN110069243A (en) | A kind of java program threads optimization method | |
| McDaid et al. | Zoea--Composable Inductive Programming Without Limits | |
| CN111739132B (en) | Whole body bone movement effect modification method based on local controller | |
| CN112199287B (en) | Cross-project software defect prediction method based on enhanced hybrid expert model | |
| CN109814855A (en) | A kind of API recommended method based on object classification and adaptive subgraph match | |
| Srinivasan et al. | Enhancing object-oriented programming comprehension using optimized sequence diagram | |
| CN103761105B (en) | A kind of Petri network automatic generation method of OWL-S complex processes | |
| CN113946568A (en) | Data management system and method |
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 |