CN115543339A

CN115543339A - Code conversion method and device, computer equipment and storage medium

Info

Publication number: CN115543339A
Application number: CN202211247567.XA
Authority: CN
Inventors: 万光平
Original assignee: Ping An Life Insurance Company of China Ltd
Current assignee: Ping An Life Insurance Company of China Ltd
Priority date: 2022-10-12
Filing date: 2022-10-12
Publication date: 2022-12-30

Abstract

The embodiment of the application provides a code conversion method and device, computer equipment and a storage medium, and belongs to the technical field of artificial intelligence. The method comprises the following steps: acquiring an original code; wherein the original code comprises: original function statements and original non-function statements; acquiring original grammar information according to the original function name of the original function statement; carrying out difference comparison on the original grammar information and preset target grammar information to obtain grammar information to be converted; acquiring function information of the original function statement according to the grammar information to be converted; screening target function statements from a preset candidate function mapping relation according to the function information; and splicing the target function statement and the original non-function statement to obtain a target code. The embodiment of the application can improve the code conversion efficiency.

Description

Code conversion method and device, computer equipment and storage medium

Technical Field

The present application relates to the field of artificial intelligence technologies, and in particular, to a code conversion method and apparatus, a computer device, and a storage medium.

Background

When testing data, the code of the first data platform needs to be converted into the code suitable for the second data platform. In the related art, the code of the first data platform is manually converted into the code conforming to the syntax of the second data platform. However, the amount of data stored in the first data platform is huge, a lot of time is consumed for performing code conversion manually, and the efficiency of code conversion is affected.

Disclosure of Invention

The embodiments of the present application mainly aim to provide a transcoding method and apparatus, a computer device, and a storage medium, which aim to improve transcoding efficiency.

To achieve the above object, a first aspect of an embodiment of the present application provides a transcoding method, including:

acquiring an original code; wherein the original code comprises: original function statements and original non-function statements;

acquiring original grammar information according to the original function name of the original function statement;

carrying out difference comparison on the original grammar information and preset target grammar information to obtain grammar information to be converted;

acquiring function information of the original function statement according to the grammar information to be converted;

screening target function statements from a preset candidate function mapping relation according to the function information;

and splicing the target function statement and the original non-function statement to obtain a target code.

In some embodiments, the function information comprises: function category and function information; the screening of the target function statement from the preset candidate function mapping relation according to the function information comprises:

screening out a mapping relation from the candidate function mapping relation to a target function according to the function type; wherein the target function mapping relationship comprises at least one candidate function statement;

and screening the target function statement from the candidate function statement according to the function information.

In some embodiments, said screening out said target function statement from said candidate function statements according to said function information comprises:

screening out selected function statements from the candidate function statements according to the function information;

performing priority judgment on the selected function statement according to a preset priority judgment rule to obtain a function level;

and screening the target function statement from the selected function statement according to the function level.

In some embodiments, before the screening out the target function statement from the preset candidate function mapping relation according to the function information, the method further includes:

constructing the candidate function mapping relation specifically includes:

acquiring candidate function information of the candidate function statement;

and constructing a mapping relation between the original function statement and the candidate function statement according to the function information and the candidate function information to obtain the candidate function mapping relation.

In some embodiments, after the splicing processing is performed on the target function statement and the original non-function statement to obtain the target code, the method further includes:

constructing a code mapping relation, which specifically comprises the following steps:

acquiring the creation information of the target code; wherein the creation information includes: creating time information, conversion user information, table creation identification information, and code creation identification information;

and constructing a mapping relation between the original code and the target code according to the creation information to obtain the code mapping relation.

In some embodiments, after the constructing a mapping relationship between the original code and the target code according to the creation information to obtain the code mapping relationship, the method further includes:

searching for a test code in the code mapping relationship specifically comprises:

receiving a code query request;

analyzing the code query request to obtain query statement structure information;

and performing code query on the target code in the code mapping relation according to the query statement structure information to obtain the test code, and displaying the test code.

In some embodiments, the query statement structure information comprises: inquiring time interval information, inquiring user information, table inquiring identification information and code inquiring identification information; the code query of the target code in the code mapping relation according to the query statement structural body to obtain the test code, and the display of the test code includes:

screening out candidate code mapping relations from the code mapping relations according to the query time interval information and the creation time information;

screening out a selected code mapping relation from the candidate code mapping relation according to the query user information and the conversion user information;

screening out a target code mapping relation from the selected code mapping relation according to the table query identification information and the table creation identification information;

screening the test codes from the target codes in the target code mapping relation according to the code query identification information and the code creation identification information, and displaying the test codes.

To achieve the above object, a second aspect of an embodiment of the present application proposes a transcoding apparatus, including:

the code acquisition module is used for acquiring an original code; wherein the original code comprises: original function statements and original non-function statements;

the grammar acquisition module is used for acquiring original grammar information according to the original function name of the original function statement;

the difference comparison module is used for carrying out difference comparison on the original grammar information and preset target grammar information to obtain grammar information to be converted;

the function acquisition module is used for acquiring the function information of the original function statement according to the grammar information to be converted;

the screening module is used for screening target function sentences from a preset candidate function mapping relation according to the function information;

and the splicing module is used for splicing the target function statement and the original non-function statement to obtain a target code.

In order to achieve the above object, a third aspect of the embodiments of the present application proposes a computer device, which includes a memory and a processor, where the memory stores a computer program, and the processor implements the method of the first aspect when executing the computer program.

To achieve the above object, a fourth aspect of the embodiments of the present application proposes a computer-readable storage medium storing a computer program, which when executed by a processor implements the method of the first aspect.

The code conversion method and device, the computer device and the storage medium provided by the application are characterized in that a code conversion end is arranged between a code storage end and a data test end, an original code is obtained through the code conversion end, original grammar information of an original function statement in the original code is obtained, the original grammar information and target grammar information are subjected to difference comparison to obtain grammar information to be converted, then function information of the original function statement is obtained according to the grammar information to be converted, the target function statement is screened out from a preset candidate function mapping relation according to the function information, so that an original non-function statement and the target function statement in the original code are spliced into the target code, and the code conversion efficiency is improved.

Drawings

Fig. 1 is a system architecture diagram of a transcoding method provided in an embodiment of the present application;

FIG. 2 is a flowchart of a transcoding method provided by an embodiment of the present application;

FIG. 3 is a flow chart of a transcoding method provided by another embodiment of the present application;

fig. 4 is a flowchart of step S205 in fig. 2;

FIG. 5 is a flowchart of step S402 in FIG. 4;

FIG. 6 is a flow chart of a transcoding method provided by another embodiment of the present application;

FIG. 7 is a flowchart of a transcoding method provided by another embodiment of the present application;

fig. 8 is a flowchart of step S703 in fig. 7;

fig. 9 is a schematic structural diagram of a transcoding device provided in an embodiment of the present application;

fig. 10 is a hardware structure diagram of a computer device provided in an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

It should be noted that although functional blocks are partitioned in a schematic diagram of an apparatus and a logical order is shown in a flowchart, in some cases, the steps shown or described may be performed in a different order than the partitioning of blocks in the apparatus or the order in the flowchart. The terms first, second and the like in the description and in the claims, and the drawings described above, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.

Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of the present application only and is not intended to be limiting of the application.

First, several terms referred to in the present application are resolved:

artificial Intelligence (AI): is a new technical science for researching and developing theories, methods, technologies and application systems for simulating, extending and expanding human intelligence; artificial intelligence is a branch of computer science that attempts to understand the essence of intelligence and produces a new intelligent machine that can react in a manner similar to human intelligence, and research in this field includes robotics, language recognition, image recognition, natural language processing, and expert systems, among others. The artificial intelligence can simulate the information process of human consciousness and thinking. Artificial intelligence is also a theory, method, technique and application system that uses a digital computer or a machine controlled by a digital computer to simulate, extend and expand human intelligence, perceive the environment, acquire knowledge and use the knowledge to obtain the best results.

Oracle database: the Oracle database is a database management system and has the characteristic characteristics of complete data management function, complete relational products, distributed processing function, data warehouse operation realization by using Oracle and the like. The Oracle database is a universal database system, and has complete data management functions.

Grammar rules: grammar rules are rules of a formalized language of abstract composition and aggregation relationships in the language, may include composition and aggregation rules, and may be used to express semantic relationships. Combination rules: the units of the language structure are combined in a linear order. Aggregation rule: rules between units with some kind of same role that can be interchanged at a certain position of the language structure.

Structured Query Language (SQL): SQL is a language for manipulating databases, including creating databases, deleting databases, querying records, modifying records, adding fields, and the like. SQL, while a language standardized by ANSI, has many different implementation versions. SQL may also be used to store, retrieve, and modify data stored in relational databases.

With the development of the big data era, the original codes stored in the original database often need to be converted before being executed on another data test platform, but the data test platform calls the codes stored in the original database and then converts the codes each time, and the codes are manually converted and then tested by the data test platform, so that a large amount of time is consumed in the conversion process, the code conversion efficiency is low, and the test efficiency of the data test platform is further influenced.

Based on this, embodiments of the present application provide a code conversion method and apparatus, a computer device, and a storage medium, where a code conversion end is disposed between a code storage end and a data test end, an original code is obtained through the code conversion end, original syntax information of an original function statement in the original code is obtained, difference comparison is performed between the original syntax information and target syntax information to obtain syntax information to be converted, function information of the original function statement is obtained according to the syntax information to be converted, a target function statement is screened out from a preset candidate function mapping relation according to the function information, so that an original non-function statement and a target function statement in the original code are spliced into a target code, so as to improve code conversion efficiency, convert the original code into a target code that meets syntax rules of the data test end, so that the data test end can directly call the target code to perform data test, thereby improving data test efficiency.

The code conversion method and apparatus, the computer device, and the storage medium provided in the embodiments of the present application are specifically described with reference to the following embodiments, and first, the code conversion method in the embodiments of the present application is described.

The embodiment of the application can acquire and process related data based on an artificial intelligence technology. Among them, artificial Intelligence (AI) is a theory, method, technique and application system that simulates, extends and expands human Intelligence using a digital computer or a machine controlled by a digital computer, senses the environment, acquires knowledge and uses the knowledge to obtain the best result.

The artificial intelligence base technologies generally include technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, big data processing technologies, operation/interaction systems, mechatronics, and the like. The artificial intelligence software technology mainly comprises a computer vision technology, a robot technology, a biological recognition technology, a voice processing technology, a natural language processing technology, machine learning/deep learning and the like.

The embodiment of the application provides a code conversion method, and relates to the technical field of artificial intelligence. The code conversion method provided by the embodiment of the application can be applied to a terminal, a server side and software running in the terminal or the server side. In some embodiments, the terminal may be a smartphone, tablet, laptop, desktop computer, or the like; the server side can be configured as an independent physical server, can also be configured as a server cluster or a distributed system formed by a plurality of physical servers, and can also be configured as a cloud server for providing basic cloud computing services such as cloud service, a cloud database, cloud computing, cloud functions, cloud storage, network service, cloud communication, middleware service, domain name service, security service, CDN (content distribution network) and big data and artificial intelligence platforms; the software may be an application or the like that implements a transcoding method, but is not limited to the above form.

The application is operational with numerous general purpose or special purpose computing system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet-type devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer computing devices, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like. The application may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The application may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

In each embodiment of the present application, when data related to the user identity or characteristic, such as user information, user behavior data, user history data, and user location information, is processed, permission or consent of the user is obtained, and the data collection, use, and processing comply with relevant laws and regulations and standards of relevant countries and regions. In addition, when the embodiment of the present application needs to acquire sensitive personal information of a user, individual permission or individual consent of the user is obtained through a pop-up window or a jump to a confirmation page, and after the individual permission or individual consent of the user is definitely obtained, necessary user-related data for enabling the embodiment of the present application to operate normally is acquired.

Fig. 1 is an architecture diagram of a transcoding system to which a transcoding method provided in an embodiment of the present application is applied, where the transcoding system includes: the device comprises a code storage end, a code conversion end and a data test end, wherein the code conversion end is connected between the code storage end and the data test end. The code conversion end is built through python and connected with the code storage end through a jdbc interface.

The code storage end is in communication connection with the code conversion end and used for storing the codes, and in the embodiment, an Oracle database is arranged on the code storage end so as to store the original codes through the Oracle database.

The code conversion end is in communication connection with the code storage end and the data test end, acquires an original code from the code storage end and then acquires target grammatical information of the data test end, so that the original grammatical information and the target grammatical information of an original function statement in the original code are subjected to difference comparison to obtain grammatical information to be converted, namely the original grammatical information and the target grammatical information are different, a target function statement is screened out from a preset candidate function mapping relation according to the function information of the original function statement, the grammatical information of the target function statement conforms to the target grammatical information, and the target function statement and the original non-function statement are spliced into the target code. Therefore, the code conversion end converts the original code of the code storage end into the target code in advance, and the data test end can directly acquire the target code from the code conversion end to execute the target code, so that the code conversion efficiency is improved, and the data test efficiency is further improved.

And the data testing end is in communication connection with the code conversion end, acquires the target code from the code conversion end, and directly executes the target code to perform data testing, so that the data testing efficiency is improved.

Fig. 2 is an alternative flowchart of a transcoding method provided in an embodiment of the present application, and the method in fig. 2 may include, but is not limited to, steps S201 to S206.

Step S201, acquiring an original code; wherein the source code comprises: original function statements and original non-function statements;

step S202, acquiring original grammar information according to an original function name of an original function statement;

step S203, comparing the original grammar information with preset target grammar information to obtain grammar information to be converted;

step S204, acquiring function information of an original function statement according to the grammar information to be converted;

s205, screening out target function statements from a preset candidate function mapping relation according to function information;

and step S206, splicing the target function statement and the original non-function statement to obtain a target code.

In steps S201 to S206 illustrated in the embodiment of the present application, the original code is obtained, and the original code includes: and if the original grammatical information is different from the target grammatical information, performing difference comparison according to the original grammatical information and the target grammatical information to obtain grammatical information to be converted, and acquiring function information of the original function statement according to the grammatical information to be converted. Because the preset candidate mapping relation comprises the target function statement matched with the function information, the target function statement is screened out from the preset candidate mapping relation according to the function information, and finally the target function statement and the original non-function statement are spliced to obtain the target code. Therefore, by judging that the original grammar information is different from the target grammar information, the target function statement is screened out from the candidate mapping relation according to the function information, and the target function statement and the original non-function statement are spliced to obtain the target code, so that the automatic code conversion is realized, the target code conforming to the target grammar information is generated, the efficiency of code conversion operation is improved, and the target code is conveniently and directly executed under the test environment corresponding to the target grammar information.

In step S201 of some embodiments, the original code may be directly obtained from a database of the code storage end, or the original code stored in the code storage end in real time may be obtained in real time, and the obtaining of the original code is not limited thereto. The original code includes: the system comprises an original function statement and an original non-function statement, wherein an original code consists of the original function statement and the original non-function statement. When the target grammar information is different from the original grammar information, the original function statement cannot be executed at a data test end corresponding to the target grammar information, so that an original code cannot be directly executed, but the original non-function statement is unchanged at the data test end. In this embodiment, the database of the code storage end is an Oracle database, and because the code time of the Oracle database storage is long, the Oracle database storage is difficult to apply to some data testing ends, so that the original codes in the Oracle database need to be converted to obtain the target codes according with the syntax of the data testing end, so that the data testing end can be directly used, and the efficiency of the data testing end in performing data testing is improved.

It should be noted that, the original code obtained includes at least one original functional statement and at least one original non-functional statement, and each original functional statement and one original non-functional statement are matched to form an original code segment. Therefore, when the original code is converted, each original code segment is mainly replaced or reserved to obtain the target code.

In step S202 of some embodiments, the original syntax information matching the original function name is obtained by obtaining the original function name of the original function statement and obtaining the original syntax information according to the original function name. The original grammar information is an original grammar rule, and whether the original function statement needs to be converted or not is judged according to the original grammar rule.

It should be noted that, if the original code includes at least one original function statement, the original syntax information of each original function statement is obtained, so as to determine whether each original function statement needs to be converted according to the original syntax information and the target syntax information.

In step S203 of some embodiments, if the original syntax information is different from the target syntax information, the original syntax information and the target syntax information are subjected to difference comparison to obtain syntax information to be converted. And acquiring the target grammatical information corresponding to the original function name at the data test end. And comparing each piece of original grammar information with the matched target grammar information, and if the original grammar information is consistent with the target grammar information, indicating that the original function statement does not need to be converted. And if the original grammar information is different from the target grammar information, performing difference comparison on the original grammar information and the target grammar information to obtain grammar information to be converted, wherein the grammar information to be converted represents an original function name of an original function statement so as to know which original function statements in the original code need to be converted according to the grammar information to be converted.

In step S204 of some embodiments, since the syntax information to be converted represents which original function statement in the original code needs to be converted, the function information of the corresponding original function statement is obtained according to the syntax information to be converted. The function information is used for representing the category and the function of the original function statement so as to obtain the matched target function statement according to the function information.

In some embodiments, before step S205, the transcoding method further comprises:

and constructing a candidate function mapping relation.

It should be noted that, before the target function statement is screened out from the candidate function mapping relationship according to the function information, a candidate function mapping relationship needs to be constructed first, that is, a mapping relationship between the original function statement and the candidate function statement is constructed, and the candidate function statement in the candidate function mapping relationship conforms to the target syntax information, so as to screen out the target function statement conforming to the target syntax information from the candidate function mapping relationship according to the function information.

Referring to fig. 3, the candidate function mapping relationship is constructed, which specifically includes, but is not limited to, steps S301 to S302:

step S301, acquiring candidate function information of a candidate function statement;

step S302, according to the function information and the candidate function information, a mapping relation between the original function statement and the candidate function statement is constructed, and a candidate function mapping relation is obtained.

In step S301 of some embodiments, the candidate function statements are function statements conforming to the target syntax information, and the candidate function information of the candidate function statements is obtained, that is, the candidate function information of each candidate function statement conforming to the target syntax information is obtained, so as to construct a mapping relationship between the candidate function statements having the same function and the original function statements, so as to screen out the target function statements from the candidate function statements.

In step S302 of some embodiments, a mapping relationship between the original function statement and the candidate function statement is constructed according to the function information and the candidate function information, that is, a mapping relationship is constructed between the original function statement and the candidate function statement with the function information and the candidate function information consistent to obtain a candidate function mapping relationship.

It should be noted that, if the function information is a, the candidate function information is also a, the original function statement corresponding to the function information a is Q, and the candidate function statement corresponding to the candidate function information a is T, a mapping relationship between Q and T is constructed, and the mapping relationship is written into the candidate function mapping relationship.

In steps S301 to S302 illustrated in this embodiment, candidate function information of each candidate function is obtained, and mapping relationships between original function statements and candidate function statements corresponding to the function information and the candidate function information are constructed to obtain candidate function mapping relationships. Therefore, the target function statement corresponding to the original function statement is extracted from the candidate function mapping relation by constructing the candidate function mapping relation between the original function statement and the candidate function statement, so as to obtain the target function statement according with the target grammar information.

Referring to fig. 4, in some embodiments, the function information includes: function category and function information; step S205 may include, but is not limited to including, step S401 to step S402:

step S401, screening out a mapping relation from a candidate function mapping relation to a target function according to a function type; wherein the target function mapping relation comprises at least one candidate function statement;

step S402, screening out target function statements from the candidate function statements according to the function information.

In step S401 of some embodiments, at least two candidate function mappings are set, and candidate function statements of the same function category are stored in the same candidate function mapping, so as to implement classified storage of the candidate function statements. Therefore, when searching for candidate function statements, the target function mapping relation is screened out from the candidate function mapping relation according to the function type, that is, the target function mapping relation matched with the function type is obtained.

It should be noted that the function category includes at least one of the following: judging type, calculating type, operating type, converting type, time type and comparing type. And setting category labels on the candidate function mapping relation so as to find the matched category labels according to the function categories, and calling the corresponding candidate function mapping relation according to the category labels to obtain a target mapping relation.

In step S402 of some embodiments, since the objective function mapping relationship includes at least one candidate function statement, the objective function statement is screened out from the candidate function statement according to the function information to obtain the objective function statement conforming to the objective syntax information.

It should be noted that, if the original function statement is "iib" and the function information of the original function statement is field splicing function, but field splicing cannot be performed using "iib" at the data testing end, the target function statement is screened out as the concat function according to the function information, that is, the target function statement at the data testing end can be used. Therefore, the target function statement can be obtained by screening the candidate function statement according to the function information, so that the test efficiency of the data test end can be improved.

In steps S401 to S402 illustrated in this embodiment, a matching target function mapping relationship is screened out from the candidate function mapping relationships according to the function type, and the target function mapping relationship includes at least one candidate function statement, and then a target function statement is screened out from the candidate function statement according to the function information, so as to obtain a target function statement that meets the target syntax information. Therefore, by screening out the target function statements which accord with the target grammatical information, the target codes are obtained by splicing the target function statements and the original non-function statements, and the target codes can be directly executed at the data test end, so that the efficiency of data test at the data test end is improved.

Referring to fig. 5, in some embodiments, step S402 may include, but is not limited to, step S501 to step S503:

step S501, screening out selected function statements from candidate function statements according to function information;

step S502, performing priority judgment on the selected function statement according to a preset priority judgment rule to obtain a function level;

step S503, screening out the target function statement from the selected function statement according to the function level.

In step S501 of some embodiments, selected function statements are filtered out of the candidate function statements according to the function information, and at least one selected function statement is filtered out. For example, if the function information is a, three selected function statements are selected from the candidate function statements, and the three selected function statements are x, y, and z, respectively. However, only one target function statement is needed, and the target function statement meeting the requirement needs to be screened from the three selected function statements.

In step S502 of some embodiments, if there are at least two selected function statements, the function level is obtained by performing priority determination on the selected function statements according to a preset priority determination rule. The preset priority decision rule may perform priority division on the candidate function statements in advance, or may obtain statement information of the selected function statement after the selected function statement is screened out, and perform priority decision according to the preset priority decision rule and the statement information to obtain a function level. Therefore, the selected function statements can be divided according to the function levels, so that the selected function statements with the function levels meeting the requirements can be obtained according to the function levels. For example, the sentence information includes: and finding a matched score from the scoring relation table according to the sentence generation time and the sentence occupation space of the selected function, calculating to obtain the score of the selected function sentence according to the score and a preset weight, and dividing the function level according to the score.

In step S503 of some embodiments, by calculating a function grade of each function selection statement, a target function statement is screened out from the selection function statements according to the function grade. In this embodiment, the selected function statement with the highest function level is obtained as the target function statement, so that the target function statement is easy to screen.

Specifically, if the selected function statement is x, y, z, the function level of the selected function statement x is two, the function level of the selected function statement y is three, and the function level of the selected function statement z is one, and the function level is proportional to the priority of the selected function statement, the selected function statement y is determined as the target function level. Therefore, the operation of screening the target function statement from the selected function statement through the function level is simple.

In steps S501 to S503 illustrated in this embodiment, selected function statements are screened out from candidate function statements according to function information, if at least two selected function statements are screened out, statement generation time and statement occupation space of the selected function statements are obtained, priority determination is performed according to a preset priority determination rule, statement generation time and statement occupation space to obtain a function level of each selected function statement, and the selected function statement with the highest function level is obtained as a target function statement. Therefore, the target function statement is screened from the selected function statements according to the function level, and the target function statement is easier to obtain.

In step S206 of some embodiments, after the target function statement is screened out, the target function statement and the original non-function statement are spliced to obtain the target statement. Specifically, if the original code includes at least two original function statements, the original non-function statements to be replaced with the target function statements are screened, the target function statements and the corresponding original non-function statements are spliced into target code segments, the corresponding original code segments in the original code are replaced with the target code segments, and the original code segments not required to be replaced by the original function statements are reserved to obtain the target code. Therefore, by converting the original code into the target code which accords with the target grammatical information, the data test end only needs to directly acquire the target code when needing to test and execute the target code to realize the data test so as to improve the efficiency of the data test.

For example, if the original code is subjected to date size comparison by the original function statement "date", and the original code is "proc _ date > = date '2021-12-31' and proc_date < -2022-12-31 '", but the original syntax information and the target syntax information of the original function statement are different, the original syntax information and the target syntax information are subjected to difference calculation to obtain syntax information to be converted. Acquiring function information of an original function statement according to grammar information to be converted, and then screening out an object function statement as "unix _ timestamp" from a candidate function according to the function information, splicing the object function statement and the original non-function statement to obtain an object code, wherein the object code is "proc _ date > = unix _ timestamp (' 2021-12-31 00).

Referring to fig. 6, in some embodiments, after step S206, the transcoding method may further include: and constructing a code mapping relation.

It should be noted that, in order to facilitate the data testing end to obtain the target code, the original code is converted into the target code, and then a code mapping relationship is constructed, so that the data testing end directly screens out the target code from the code mapping relationship, and directly executes the target code to implement the data test, thereby improving the data testing efficiency.

Constructing the code mapping relationship may include, but is not limited to, including step S601 to step S602:

step S601, acquiring creation information of a target code; wherein the creating information includes: creating time information, conversion user information, table creation identification information, and code creation identification information;

step S602, the mapping relation between the original code and the target code is constructed according to the creation information, and the code mapping relation is obtained.

In step S601 of some embodiments, when the object code is uploaded by multiple users, the creation time information, the conversion user information, the table creation identification information, and the code creation identification information of the object code are obtained, so as to construct a code mapping relationship by classifying the object code according to the creation time information, the conversion user information, the table creation identification information, and the code creation identification information.

In step S602 in some embodiments, a code mapping relationship is obtained by constructing a mapping relationship between an original code and a target code according to creation information, so as to directly read and display the target code from the code mapping relationship, and a data test end does not need to convert the code first when performing a data test, but directly extracts the target code from the code mapping relationship, so as to execute the target code to implement the data test, thereby improving data test efficiency.

In steps S601 to S602 illustrated in this embodiment, the creating information of the target code is obtained, so as to construct the mapping relationship between the original code and the target code according to the creating information to obtain the code mapping relationship, therefore, the target code can be directly read from the code mapping relationship according to the creating information, and the data testing end only needs to read and display the target code from the code mapping relationship when performing data testing, and does not need to convert the original code into the target code, thereby improving the data testing efficiency.

Referring to fig. 7, in some embodiments, after step S602, the transcoding method further includes:

and searching the test code in the code mapping relation.

It should be noted that after the code mapping relationship is constructed, if the data testing end needs to obtain the test code, the test code is searched in the code mapping relationship, and the test code is sent to the data testing end, so that the data testing end directly executes the test code to implement the data test, and code conversion is not needed during the data test, so as to improve the data testing efficiency.

Finding the test code in the code mapping relationship may include, but is not limited to, steps S701 to S703:

step S701, receiving a code query request;

step S702, analyzing the code query request to obtain query statement structure information;

and step S703, performing code query on the target code in the code mapping relation according to the query statement structure information to obtain a test code, and displaying the test code.

In step S701 of some embodiments, since the original code is converted into the target code and then the code mapping relationship is constructed, when the data testing end needs to perform the data test, the code converting end receives a code query request from the data testing end, so as to perform the code query according to the code query request.

In step S702 of some embodiments, the query statement structure information is constructed by parsing the code query request, that is, performing content parsing and source parsing on the code query request, so that the test code can be found from the code mapping relationship more quickly and accurately according to the query statement structure information.

In step S703 of some embodiments, the target code in the code mapping relationship is searched according to the query statement structure information, so as to find out the target code that meets the query statement structure information from the code mapping relationship as the test code, and the test code is directly displayed after the test code is obtained. Meanwhile, the test code is sent to the data test end, the data test end directly reads the test code to execute the test code to perform data test, code conversion is not needed to be performed firstly during the data test, the time of the data test is saved, and the data test efficiency is improved.

It should be noted that, if the data testing end needs to compare two date sizes, the code conversion end finds out that the test code is "proc _ date > = unix _ timestamp (' 2021-12-31 00).

In the steps S701 to S703 shown in the embodiment, a code query request sent by the data testing end is obtained, then source analysis and content analysis are performed on the code query request to obtain query statement structure information, then code search is performed from a target code in a code mapping relationship according to the query statement structure information to obtain a test code, and the test code is displayed and sent to the data testing end. Therefore, when the data test end needs to perform data test, the data test can be realized by directly executing the test code without code conversion, so that the test time is saved, and the data test efficiency is improved.

Referring to fig. 8, in some embodiments, the query statement structure information includes: inquiring time interval information, inquiring user information, table inquiring identification information and code inquiring identification information; step S703 may include, but is not limited to, including steps S801 to S804:

step S801, screening out candidate code mapping relations from the code mapping relations according to the query time interval information and the creation time information;

step S802, screening out a selected code mapping relation from the candidate code mapping relation according to the query user information and the conversion user information;

step S803, screening out a target code mapping relation from the selected code mapping relation according to the table query identification information and the table creation identification information;

and step S804, screening out the test codes from the target codes in the target code mapping relation according to the code query identification information and the code creation identification information, and displaying the test codes.

In step S801 of some embodiments, since the code mapping relationship is a mapping relationship that constructs the original code and the target code according to the creation information, creation information is set on each code mapping relationship, and the creation information includes: creating time information, converting user information, table creation identification information, and code creation identification information; when a code is queried, a candidate code mapping relation needs to be screened out from the code mapping relation according to the query time interval information and the creation time information, that is, the code mapping relation of a query time interval corresponding to the creation time information and the creation time corresponding to the query time interval information is obtained to obtain the candidate mapping relation. Because the code mapping relation is stored in a large quantity, the code mapping relation which the creation time information accords with needs to be searched according to the query time interval information to obtain the candidate code mapping relation, and target codes do not need to be searched by each code mapping relation, so that the time for searching the target codes is saved.

In step S802 of some embodiments, since multiple candidate code mapping relationships exist, that is, multiple candidate code mapping relationships may exist in the same time interval, the selected code mapping relationship needs to be further screened from the candidate code mapping relationships according to the query user information and the conversion user information, that is, the selected code mapping relationship is obtained by obtaining the candidate code mapping relationship matching the query user information and the conversion user information. So as to further reduce the searching range of the test code and save the searching time of the test code.

For example, if 20 candidate code mapping relationships are obtained by screening, and the conversion user information of 4 candidate code mapping relationships is P1 user, the conversion user information of 6 candidate code mapping relationships is P2 user, the conversion user information of 5 candidate code mapping relationships is P3 user, the conversion user information of 3 candidate code mapping relationships is P4 user, and the conversion user information of 2 candidate code mapping relationships is P5 user. And if the inquired user information is a P3 user, acquiring 5 candidate code mapping relations as the selected code mapping relation.

In step S803 of some embodiments, if the same user creates multiple code mapping relationships in the same time interval, the target code mapping relationship needs to be screened from the selected code mapping relationship according to the table query identification information and the table creation identification information. Because the table creation identification information is the only identification information, the selected code mapping relation matched with the table creation identification information is obtained according to the query identification information and is used as the target code mapping relation, and the target code is searched in only one target code mapping relation, so that the time for searching the test code is saved, and the efficiency for searching the test code is improved.

In step S804 of some embodiments, since the object code mapping relationship includes at least one object code, and each object code is provided with code creation identification information, the object code matched with the code creation identification information is obtained according to the code query information and is used as the test code, so that the test code is quickly and efficiently searched.

In steps S801 to S804 illustrated in this embodiment, a candidate code mapping relationship is obtained by obtaining a code mapping relationship to which creation time information conforms according to a query time interval, a selected code mapping relationship is obtained by obtaining a candidate code mapping relationship to which conversion user information and query user information are matched, a target code mapping relationship is obtained by obtaining a selected code mapping relationship to which table creation identification information and table query identification information are consistent, and a target code to which the code creation identification information and the code query identification information are matched is found from the target code mapping relationship and is used as a test code. Therefore, the target code mapping relation is screened step by step, and then the target code matched with the code creating identification information and the code query identification information is screened from the target code mapping relation to be used as the test code, so that the target code searching time is saved, and the target code searching efficiency is improved.

According to the method and the device for converting the grammar information, the original code of the code storage end is obtained, the original function name of the original function statement is obtained through the original code comprising the original function statement and the original non-function statement, the original grammar information is obtained according to the original function name, and if the original grammar information is different from the target grammar information, the original grammar information and the target grammar information are subjected to difference comparison to obtain the grammar information to be converted. And acquiring the function information of the corresponding original function statement according to the grammar information to be converted, wherein the grammar information to be converted represents which original function statement in the original code needs to be converted. The function information includes: function category and function information; and screening a target function mapping relation from the candidate function mapping relation according to the function type, wherein the target function mapping relation comprises at least one candidate function statement, screening a selected function statement from the candidate function statement according to the function information, carrying out priority judgment on the selected function statement according to a preset priority judgment rule to obtain a function level, and obtaining the selected function statement with the highest function level as the target function statement so as to enable the target function statement to be easy to screen. And finally, splicing the target function statement and the original non-function statement to obtain the target statement. And after the original code is converted into the target code, the mapping relation between the original code and the target code is constructed according to the creation information to obtain a code mapping relation. When the data test end needs to perform data test, receiving a code query request from the data test end, and performing content analysis and source analysis on the code query request to construct query statement structure information, wherein the query statement structure information comprises: inquiring time interval information, inquiring user information, table inquiring identification information and code inquiring identification information. Obtaining a code mapping relation which is accorded with the creation time information according to the query time interval to obtain a candidate code mapping relation, obtaining a selected code mapping relation according to the candidate code mapping relation which is matched with the obtained conversion user information and the query user information, obtaining a target code mapping relation of the selected code mapping relation which is consistent with the table creation identification information and the table query identification information, and finally finding out a target code which is matched with the code creation identification information and the code query identification information from the target code mapping relation to be used as a test code. Therefore, the original code is converted into the target code before the data test is carried out on the data test end, the target code can be executed on the data test end, the test code is directly found out from the code mapping relation when the data test end carries out the data test, the data test end can directly execute the test code to realize the data test, the original code is not required to be converted into the target code firstly when the data test is carried out, the code conversion time is saved, and the data test efficiency is improved.

Referring to fig. 9, an embodiment of the present application further provides a transcoding apparatus, which can implement the transcoding method, where the apparatus includes:

a code obtaining module 901, configured to obtain an original code; wherein the original code comprises: original function statements and original non-function statements;

a syntax obtaining module 902, configured to obtain original syntax information according to an original function name of an original function statement;

a difference comparison module 903, configured to perform difference comparison on the original syntax information and preset target syntax information to obtain syntax information to be converted;

a function obtaining module 904, configured to obtain function information of an original function statement according to syntax information to be converted;

the screening module 905 is configured to screen out a target function statement from a preset candidate function mapping relationship according to the function information;

and the splicing module 906 is configured to splice the target function statement and the original non-function statement to obtain a target code.

The specific implementation of the code conversion apparatus is substantially the same as the specific implementation of the code conversion method, and is not described herein again.

The embodiment of the application also provides computer equipment, the computer equipment comprises a memory and a processor, the memory stores computer programs, and the processor realizes the code conversion method when executing the computer programs. The computer equipment can be any intelligent terminal including a tablet computer, a vehicle-mounted computer and the like.

Referring to fig. 10, fig. 10 illustrates a hardware structure of a computer apparatus according to another embodiment, the computer apparatus includes:

the processor 1001 may be implemented by a general-purpose CPU (central processing unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits, and is configured to execute a relevant program to implement the technical solution provided in the embodiment of the present application;

the memory 1002 may be implemented in the form of a Read Only Memory (ROM), a static storage device, a dynamic storage device, or a Random Access Memory (RAM). The memory 1002 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present disclosure is implemented by software or firmware, the relevant program codes are stored in the memory 1002 and called by the processor 1001 to execute the code conversion method according to the embodiments of the present disclosure;

an input/output interface 1003 for realizing information input and output;

the communication interface 1004 is used for realizing communication interaction between the device and other devices, and can realize communication in a wired manner (for example, USB, network cable, etc.) or in a wireless manner (for example, mobile network, WIFI, bluetooth, etc.);

a bus 1005 that transfers information between various components of the device, such as the processor 1001, memory 1002, input/output interface 1003, and communication interface 1004;

wherein the processor 1001, the memory 1002, the input/output interface 1003 and the communication interface 1004 realize communication connections with each other inside the apparatus through a bus 1005.

An embodiment of the present application further provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the code conversion method.

The memory, which is a non-transitory computer readable storage medium, may be used to store non-transitory software programs as well as non-transitory computer executable programs. Further, the memory may include high speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, the memory optionally includes memory located remotely from the processor, and these remote memories may be connected to the processor through a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

According to the code conversion method and device, the computer equipment and the storage medium, the original grammar information and the target grammar information are subjected to difference comparison to obtain the grammar information to be converted, then the function information of the original function statement is obtained according to the grammar information to be converted, the target function statement is screened out from the candidate mapping relation according to the function information, the target function statement and the original non-function statement are spliced to obtain the target code, automatic code conversion is achieved, the target code which accords with the target grammar information is generated, the efficiency of code conversion operation is improved, and then the data test can be executed by directly using the converted target code, so that the data test efficiency is improved.

The embodiments described in the embodiments of the present application are for more clearly illustrating the technical solutions of the embodiments of the present application, and do not constitute limitations on the technical solutions provided in the embodiments of the present application, and it is obvious to those skilled in the art that the technical solutions provided in the embodiments of the present application are also applicable to similar technical problems with the evolution of technologies and the emergence of new application scenarios.

It will be appreciated by those skilled in the art that the embodiments shown in the figures are not intended to limit the embodiments of the present application and may include more or fewer steps than those shown, or some of the steps may be combined, or different steps may be included.

The above-described embodiments of the apparatus are merely illustrative, wherein the units illustrated as separate components may or may not be physically separate, i.e. may be located in one place, or may also be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

One of ordinary skill in the art will appreciate that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof.

The terms "first," "second," "third," "fourth," and the like in the description of the application and the above-described figures, if any, 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 is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations 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.

It should be understood that in the present application, "at least one" means one or more, "a plurality" means two or more. "and/or" for describing an association relationship of associated objects, indicating that there may be three relationships, e.g., "a and/or B" may indicate: only A, only B and both A and B are present, wherein A and B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of single item(s) or plural items. For example, at least one (one) of a, b, or c, may represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", wherein a, b, c may be single or plural.

In the several embodiments provided in the present application, it should be understood that the disclosed apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the above-described division of units is only one type of division of logical functions, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit may be implemented in the form of hardware, or may also be implemented in the form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a separate product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present application, which are essential or part of the technical solutions contributing to the prior art, or all or part of the technical solutions, may be embodied in the form of a software product stored in a storage medium, which includes multiple instructions for enabling a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods of the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing programs, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.

The preferred embodiments of the present application have been described above with reference to the accompanying drawings, and the scope of the claims of the embodiments of the present application is not limited thereby. Any modifications, equivalents, and improvements that may occur to those skilled in the art without departing from the scope and spirit of the embodiments of the present application are intended to be within the scope of the claims of the embodiments of the present application.

Claims

1. A method of transcoding, the method comprising:

acquiring original grammar information according to an original function name of the original function statement;

performing difference comparison on the original grammar information and preset target grammar information to obtain grammar information to be converted;

2. The method of claim 1, wherein the function information comprises: function category and function information; the screening of the target function statement from the preset candidate function mapping relation according to the function information comprises:

3. The method of claim 2, wherein the screening the target function statement from the candidate function statement according to the function information comprises:

4. The method according to claim 2, wherein before the screening out the target function statement from the preset candidate function mapping relation according to the function information, the method further comprises:

constructing the candidate function mapping relation specifically includes:

acquiring candidate function information of the candidate function statement;

5. The method according to any one of claims 1 to 4, wherein after the splicing the target function statement and the original non-function statement to obtain a target code, the method further comprises:

acquiring creation information of the target code; wherein the creation information includes: creating time information, converting user information, table creation identification information, and code creation identification information;

6. The method of claim 5, wherein after the constructing the mapping relationship between the original code and the target code according to the creation information to obtain the code mapping relationship, the method further comprises:

receiving a code query request;

7. The method of claim 6, wherein the query statement structure information comprises: inquiring time interval information, inquiring user information, table inquiring identification information and code inquiring identification information; the code query of the target code in the code mapping relation according to the query statement structural body to obtain the test code, and the display of the test code includes:

8. A transcoding apparatus, characterized in that the apparatus comprises:

the grammar obtaining module is used for obtaining original grammar information according to the original function name of the original function statement;

a function obtaining module, configured to obtain function information of the original function statement according to the syntax information to be converted;

the screening module is used for screening out target function statements from a preset candidate function mapping relation according to the function information;

9. A computer device, characterized in that the computer device comprises a memory, in which a computer program is stored, and a processor, which when executing the computer program implements the transcoding method of any of claims 1 to 7.

10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, carries out the transcoding method of any one of claims 1 to 7.