CN115858019A - Data processing method, system, electronic device and storage medium for expressions - Google Patents

Abstract

The application provides a data processing method, a system, an electronic device and a storage medium aiming at an expression, wherein the method comprises the following steps: acquiring an expression to be analyzed, and generating an abstract syntax tree by using the expression to be analyzed; traversing the abstract syntax tree, and determining the data types of all nodes, wherein the data types comprise a first data type and a second data type, and the occupied bytes of the first data type are more than the occupied bytes of the second data type; in response to a first node having a first data type, determining a node to be adjusted associated with the first node; converting the data type of the node to be adjusted into a first data type; and constructing an expression statement by using the updated abstract syntax tree. The method and the device aim to reduce the occupied space of the expression and improve the running efficiency of the resource-limited operating system on the expression.

Description

Data processing method, system, electronic device and storage medium for expressions

technical field

The present application relates to the field of computer technology, in particular to a data processing method, system, electronic equipment and storage medium for expressions.

Background technique

The data types of general data in the operating system are divided into int type and other types. Among them, the space occupied by the int type is 32bit, while the space occupied by other types is 16bit, and the space occupied by different types is doubled. When generating register-based object code, choosing a reasonable data type has a great influence on the instruction rate and space utilization of the virtual machine. At the same time, in a resource-constrained operating system, the rational allocation of resources is very important.

At present, the most basic storage unit of the Java virtual machine in the related art is a variable slot, and each variable slot occupies a space of 32 bits, so that all variables and instructions are calculated based on the int type. For some data in the expression that only occupies 16 bits, such as byte type or short type, it also needs to be calculated based on int type, which takes up more space. Especially when multiple literal data appear in complex arithmetic expressions, each literal data takes up 32 bits of space, which will seriously waste space and affect the efficiency of data operation. Since some operation instructions only support the same type of operation during the operation, a data type with a small footprint can be converted to a data type with a large footprint, but a data type with a large footprint cannot be converted to a data type with a small footprint. If each literal data is stored in its achievable minimum footprint, additional type conversion instructions need to be added when performing operations with data types that occupy a large space, which will affect the efficiency of expression operations. Therefore, how to improve the operating efficiency of expressions in resource-constrained operating systems has become an urgent technical problem to be solved.

Contents of the invention

The following is an overview of the topics described in detail in this article. This summary is not intended to limit the scope of the claims.

The main purpose of the embodiments of the present application is to provide a data processing method, system, electronic device and storage medium for expressions, aiming at reducing the occupied space of expressions and improving the operation efficiency of expressions in resource-constrained operating systems.

In order to achieve the above purpose, the first aspect of the embodiment of the present application proposes a data processing method for expressions, the method comprising:

Obtain an expression to be parsed, and use the expression to be parsed to generate an abstract syntax tree;

Traversing the abstract syntax tree to determine the data types of all nodes, the data types include a first data type and a second data type, and the first data type occupies more bytes than the second data type occupied bytes;

In response to the presence of a first node of the first data type, determining a node to be adjusted associated with the first node;

converting the data type of the node to be adjusted into the first data type;

Build expression statements using the updated abstract syntax tree.

In some embodiments, the data processing method also includes:

In response to the absence of the first node of the first data type, converting the data types of all target nodes into the second data type, each of the target nodes is represented by each literal data in the expression to be parsed One-to-one correspondence is generated.

In some embodiments, the first node includes at least one of a variable node generated from variable data in the expression to be parsed and a literal node generated from literal data in the expression to be parsed kind.

In some embodiments, the determining a node to be adjusted associated with the first node in response to the presence of the first node of the first data type includes:

In response to the existence of the first node of the first data type, determine sibling nodes and ancestor nodes of the first node as nodes to be adjusted.

In some embodiments, the determining the node to be adjusted associated with the first node includes:

According to the depth of the abstract syntax tree, the ancestor nodes of the first node are sequentially determined as nodes to be adjusted until the next ancestor node is a special node, and the special node is characterized as a node with a fixed data type.

In some embodiments, the determining the node to be adjusted associated with the first node includes:

If the parent node of the first node is not a special node, determine the sibling node of the first node as the node to be adjusted, and the special node is characterized as a node whose data type is fixed.

In some embodiments, after converting the data type of the node to be adjusted into the first data type, it includes:

The updated abstract syntax tree is traversed, and the child nodes of the nodes of the first data type are converted to the first data type.

In order to achieve the above purpose, the second aspect of the embodiment of the present application proposes a data processing system for expressions, and the system includes:

A data generation module, configured to obtain an expression to be parsed, and use the expression to be parsed to generate an abstract syntax tree;

A type determination module, configured to traverse the abstract syntax tree to determine the data types of all nodes, the data types include a first data type and a second data type, and the first data type occupies more bytes than the Occupied bytes of the second data type;

an association determination module, configured to determine a node to be adjusted associated with the first node in response to the existence of the first node of the first data type;

a type conversion module, configured to convert the data type of the node to be adjusted into the first data type;

A statement building module for constructing expression statements using the updated abstract syntax tree.

In order to achieve the above purpose, the third aspect of the embodiments of the present application proposes an electronic device, the electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the above-mentioned computer program when executing the computer program. The data processing method for expressions described in the first aspect.

In order to achieve the above purpose, the fourth aspect of the embodiments of the present application proposes a storage medium, the storage medium is a computer-readable storage medium, the storage medium stores a computer program, and the computer program is implemented when the computer program is executed by a processor. The data processing method for expressions described in the first aspect above.

The application provides a data processing method, system, electronic device and storage medium for expressions. The method includes: obtaining an expression to be parsed, generating an abstract syntax tree by using the expression to be parsed; traversing the abstract syntax tree to determine all The data type of the node, the data type includes a first data type and a second data type, and the occupied bytes of the first data type are more than the occupied bytes of the second data type; in response to the existence of the first node of the first data type, it is determined The node to be adjusted associated with the first node; the data type of the node to be adjusted is converted into the first data type; and an expression statement is constructed by using the updated abstract syntax tree. According to the technical solution of the present application, by converting the expression into an abstract syntax tree, the data type of each node is determined one by one, that is, the data type of variable data and literal data in the expression that can be stored when generating the intermediate language. The data type of each node of the abstract syntax tree is judged to determine whether there is a node of the first data type. If there is a first node of the first data type, convert the data types of the nodes associated with the first node to the first data type, that is, convert the related nodes that perform operations with the first node to the first data type, so that there is no need to add additional type conversion instructions during operation. Nodes that are not associated with the first node can all be stored in the second data type, saving occupied space. Compared with the technical solutions in the related art that all use the data of the first data type for calculation, the solution of the present application can effectively reduce the space occupied by the expression data, thereby improving the operation efficiency of the expression in the resource-constrained operating system .

Description of drawings

FIG. 1 is a flow chart of the steps of a data processing method for expressions provided by an embodiment of the present application;

FIG. 2 is a flowchart of specific steps after step S120 provided by another embodiment of the present application;

Fig. 3 is a schematic diagram of an abstract syntax tree formed by a coerced expression provided by another embodiment of the present application;

FIG. 4 is a flow chart of specific steps of step S130 provided by another embodiment of the present application;

FIG. 5 is a flow chart of specific steps of step S130 provided by another embodiment of the present application;

FIG. 6 is a flow chart of specific steps of step S130 provided by another embodiment of the present application;

Fig. 7 is a schematic diagram of an abstract syntax tree formed by a logical operation expression provided by another embodiment of the present application;

Fig. 8 is a flow chart of specific steps after step S140 provided by another embodiment of the present application

Fig. 9 is a schematic diagram of an abstract syntax tree formed by an expression to be parsed provided by another embodiment of the present application

FIG. 10 is a block diagram of a data processing system for expressions provided by an embodiment of the present application;

FIG. 11 is a schematic diagram of a hardware structure of an electronic device provided by an embodiment of the present application.

Detailed ways

In order to make the purpose, technical solution and advantages of the present application clearer, the present application will be further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present application, not to limit the present application.

It should be noted that although the functional modules are divided in the system schematic diagram and the logical order is shown in the flow chart, in some cases, it can be executed in a different order than the module division in the system or the flow chart steps shown or described. The terms "first", "second" and the like in the specification and claims and the above drawings are used to distinguish similar objects, and not necessarily used to describe a specific sequence or sequence.

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

The expression-oriented data processing method provided in the embodiment of the present application can be applied to a terminal, can also be applied to a server, and can also be software running on a terminal or a server. In some embodiments, the terminal can be a smart phone, a tablet computer, a notebook computer, a desktop computer, etc.; the server end can be configured as an independent physical server, or can be configured as a server cluster or a distributed system composed of multiple physical servers, or It can be configured to provide cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery network (Content Delivery Network, CDN) and big data and artificial Cloud servers for basic cloud computing services such as intelligent platforms; software can be applications that implement data processing methods for expressions, but are not limited to the above forms.

The application can be used in numerous general purpose or special purpose computer system environments or configurations. Examples: personal computers, server computers, handheld or portable devices, tablet-type devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, including A distributed computing environment for any of the above systems or devices, etc. This 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 storage devices.

Embodiments of the present application will be described below in conjunction with the accompanying drawings.

In the first aspect, FIG. 1 is an optional flow chart of the data processing method for expressions provided in the embodiment of the present application. The data processing method for expressions in FIG. 1 may include but not limited to steps S110 to S150:

Step S110, obtaining an expression to be parsed, and using the expression to be parsed to generate an abstract syntax tree;

Step S120, traversing the abstract syntax tree to determine the data types of all nodes;

Step S130, in response to the existence of the first node of the first data type, determine the node to be adjusted associated with the first node;

Step S140, converting the data type of the node to be adjusted into the first data type;

Step S150, using the updated abstract syntax tree to construct an expression statement.

It can be understood that the expression that needs to be analyzed and calculated is acquired, wherein the expression includes variables, literals and operation logic symbols. The expression to be parsed is used to generate an abstract syntax tree, that is, the variables, literals, and operational logic symbols in the expression are transformed according to the corresponding logical relationship to generate the nodes of the abstract syntax tree. Traverse the abstract syntax tree generated by the expression to be parsed, and determine the data types of all nodes, that is, the data types of the variable data and literal data in the expression that can be used when generating the intermediate language, which is equivalent to the expression Expressions are scanned ahead before the intermediate language construction statement is generated. Wherein, the data type includes the first data type and the second data type, and the occupied bytes of the first data type are more than the occupied bytes of the second data type, that is, the first data type can be an int type occupying 32 bytes, and The second data type may be a short type occupying 16 bytes.

Judging the data type of each node of the abstract syntax tree, whether there is a node of the first data type, that is, judging whether there is int type data, including literal data and variable data. Since some operation instructions only support the same type of operation during the operation, a data type with a small footprint can be converted to a data type with a large footprint, but a data type with a large footprint cannot be converted to a data type with a small footprint. If each literal data or variable data is stored in its achievable minimum occupied space, additional type conversion instructions need to be added when operating with data of a large space-occupied data type, which will affect the operating efficiency of the expression. Therefore, if there is a first node of the first data type, the data types of the nodes to be adjusted associated with the first node are all converted to the first data type, that is, all related nodes that perform operations with the first node are converted to It is the first data type, so there is no need to add additional type conversion instructions during operation. The node to be adjusted may be a node generated by literal data and/or variable data. Nodes that are not associated with the first node can all be stored in the second data type, which saves space and achieves a balance between data space and expression operation efficiency.

Compared with the technical solutions in the related art that all use the first data type, that is, int type data for calculation, the method of the present application traverses the abstract syntax tree of the expression to be parsed, that is, the arithmetic operation, in the process of constructing the intermediate language, Scanning ahead analyzes all nodes of the abstract syntax tree, namely literal data and variable data, assigns appropriate data types, and constructs intermediate language or target instructions through the data types determined after scanning, which can make data operations more accurate and reduce overflow situations. Reducing the space occupied helps to improve the operation efficiency of expressions in resource-constrained operating systems.

Please refer to FIG. 2. In some embodiments, after step S120 in FIG. 1 is performed, the data processing method for expressions provided by the embodiment of the present application may also include but not limited to include step S210:

Step S210, in response to the fact that there is no first node of the first data type, the data types of all target nodes are converted into the second data type, and each target node is generated in one-to-one correspondence with each literal data in the expression to be parsed.

It can be understood that, in the case that there is no first node of the first data type in the abstract syntax tree, that is, it does not contain data of type int, it can be considered that all literals in the abstract syntax tree can be of type short , the second data type. Therefore, the data types of all target nodes are converted into the second data type, and the target nodes are correspondingly generated from each literal data in the expression to be parsed, which is equivalent to converting all the literal data in the expression to be parsed The default is the short type, which only occupies 16 bits, and there is no need to use the first data type to reduce the space occupied. At the same time, the result obtained from multiple operations of the second data type is also the second data type.

Referring to FIG. 3 , FIG. 3 shows a schematic diagram of an abstract syntax tree formed by a forced expression, and the forced expression is short result4=(short)(a+0xFF-b). It can be seen that when the variable node a, that is, the data type of the variable data a is the second data type, since both the variable node a and the literal node 0xFF are associated with the special node short, no matter whether the value calculated by (a+0xFF) is Exceeding 32767, that is, regardless of the data overflow, the obtained results are all short types, that is, the second data type, so the data type of the literal node 0xFF can be regarded as the second data type.

It should be noted that the first node includes variable nodes and/or literal nodes, which means that the expression to be parsed may only include variable data of the first data type, or may only include literals of the first data type The data may also include variable data and literal data of the first data type at the same time. Variable nodes are generated from variable data in the expression to be parsed, and literal nodes are generated from literal data in the expression to be parsed.

The default data type of literal data can be determined by the numerical value represented by the literal data. For example, when the value represented by the literal data does not exceed 32767, it can be considered that the literal data can adopt the second data type or the The first data type, the default data type is the second data type, that is, the data type that occupies the smallest space can be used. And when the value represented by the literal data exceeds 32767, it can be considered that the literal data can only adopt the first data type, that is, the default data type of the literal data is the first data type, and it can be considered that the literal data generated The node of is the first node.

Referring to FIG. 4, in some embodiments, step S130 in FIG. 1 may also include but not limited to include step S310:

Step S310, in response to the existence of the first node of the first data type, determine the sibling nodes and ancestor nodes of the first node as nodes to be adjusted.

It can be understood that, before parsing the expression to be parsed, the depth-first traversal algorithm of the abstract syntax tree is used to traverse each node of the abstract syntax tree, and if there is a first node of the first data type, then determine the The node to be adjusted associated with the node is the data used to perform operations on the data represented by the first node, including the sibling nodes and ancestor nodes of the first node. The ancestor nodes include the parent node, the parent node of the parent node, etc., which is equivalent to If the operands of the operation have the first data type, the results of the operation are all of the first data type, and at the same time, the data participating in the operation with the operand is also adjusted to the first data type. Among them, the sibling nodes and ancestor nodes can be generated from the literal data of the expression to be parsed, and can also be generated from variable data. Since the nodes to be adjusted need to perform operations with the first node, and some operation instructions only support the same type of operations, the nodes to be adjusted can be adjusted to the same first data type as the first node data type, thus facilitating Improve the accuracy of data operations, without adding additional type conversion instructions, and improve the operating efficiency of expressions.

Referring to FIG. 5, in some embodiments, step S130 in FIG. 1 may include but not limited to include step S410:

Step S410, according to the depth of the abstract syntax tree, successively determine the ancestor nodes of the first node as nodes to be adjusted until the next ancestor node is a special node.

It can be understood that, using the depth of the abstract syntax tree, the ancestor nodes of the first node in the abstract syntax tree are searched in turn, and these ancestor nodes are determined as nodes to be adjusted, until a special node with a fixed data type is encountered, the search is stopped ancestor node. The special node can be a node formed by a coercion operator, or a node formed by an assignment operator, and since the data type converted by the coercion operator and the data type assigned by the assignment operator can be determined, it is quite The data type of the ancestor node of the special node can be determined, so it is not necessary to determine it as the node to be adjusted.

Referring to FIG. 6, in some embodiments, step S130 in FIG. 1 may include but not limited to include step S510:

Step S510, if the parent node of the first node is not a special node, determine the sibling node of the first node as the node to be adjusted.

It can be understood that, in the case that the parent node of the first node is not a special node, it is equivalent to no restriction on the data type of the output result after processing other nodes and the first node. In order to improve the accuracy of the operation, the The sibling node of the first node is determined as the node to be adjusted, that is, the data type of the sibling node of the first node is adjusted to the first data type, so that the data types of the two are the same, so in the case of parsing the expression, there is no need to be a sibling node Add type conversion instructions to improve operation efficiency.

Referring to FIG. 7, FIG. 7 shows a schematic diagram of an abstract syntax tree formed by a logical operation expression, and the logical operation expression is boolean ressult4=a<1. It can be seen that the data type of literal node 1 depends on the data type of variable node a. When the data type of the variable node a is the first data type, and the parent node of the variable node a is not a special node, the data type of the literal node 1 can be considered as the first data type. Even though the data of the literal node 1 can be stored in the second data type, since the data types of the operands of the instructions in the operating system must be the same, the literal node 1 can be stored in the first data type to reduce the number of type conversion instructions. implement. When the data type of the variable node a is the second data type, the literal node 1 can use the second data type for storage.

Referring to FIG. 8 , in some embodiments, after step S140 in FIG. 1 , step S610 may be included but not limited to:

Step S610, traverse the updated abstract syntax tree, and convert the child nodes of the nodes of the first data type to the first data type.

It can be understood that after the node to be adjusted associated with the first node is determined, and the data type of the node to be adjusted is converted into the first data type, the abstract syntax tree initially completes the allocation of the data type of each node. In order to improve the operation efficiency and the precision of the data operation, the updated abstract syntax tree is traversed, the nodes of the first data type are determined again, and the child nodes of the first data type are converted into the first data type, which is equivalent to When the output result is the first data type, the operand can also use the first data type.

With reference to Fig. 9, Fig. 9 represents the synoptic diagram of the abstract syntax tree that a to-be-parsed expression forms, and this to-be-parsed expression is int result=0xFF+((short)((b+0xFFFF)-(b+0xFF))+ (short)(b+0xFF)). The abstract syntax tree is scanned and divided into multiple subtrees according to the expression to be parsed. Wherein, the default data type of variable data b is the second data type, that is, node eleven, node thirteen and node sixteen are all of the second data type, while node two is of the first data type. It can be seen that the literal data represented by node twelve is 0xFFF, and the value represented is greater than 32767. Therefore, the second data type cannot be used for storage, that is, node twelve can only be the first data type, which is equivalent to node ten Two is the first node. As the sibling node of the first node——node eleven is a known second data type, but since the output results of nodes eleven and twelve should satisfy the first data type, therefore, nodes nine and nodes eleven Both are nodes to be adjusted that need to be converted to the first data type. Node eight is the ancestor node of node twelve, therefore, node eight is also a node to be adjusted that needs to be converted to the first data type.

Correspondingly, node ten is a child node of node eight, and when nodes eight and nine are both of the first data type, node ten is also a node to be adjusted, that is, it needs to be converted to the first data type. Node thirteen and node fourteen are both the first node—child nodes of node ten, and node thirteen and node fourteen are also nodes to be adjusted that need to be converted into the first data type.

In addition, since the default data type of node 16 is the second data type, and the literal data represented by node 17 is 0xFF, that is, the represented data does not exceed 32767, therefore, node 17 and node 16 can be the first The second data type, and the corresponding parent node—node fifteen is also the second data type.

Since node 6 and node 7 are special nodes with strong transfer function, that is, node 5 is the second data type. Similarly, the literal data represented by node 4 is 0xFF, that is, the data represented does not exceed 32767. Node 4 can be the second data type. Two data types. However, since Node 1 is a special node with an assignment function, Node 1, Node 2 and Node 3 are all of the first data type, therefore, Node 4 may also be of the first data type. In the case that node 4 adopts the second data type, when constructing an expression statement such as an intermediate language or an object instruction, it is necessary to add a type conversion instruction.

For the second aspect, please refer to FIG. 10. FIG. 10 is a block diagram of a data processing system for expressions provided by the embodiment of the present application. The embodiment of the present application also provides a data processing system 1000 for expressions, which can realize the above-mentioned A data processing method for expressions, the system includes:

The data generation module 1010 is used to obtain the expression to be parsed, and generate an abstract syntax tree by using the expression to be parsed;

The type determination module 1020 is configured to traverse the abstract syntax tree to determine the data types of all nodes, the data types include the first data type and the second data type, and the occupied bytes of the first data type are more than those occupied by the second data type byte;

An association determination module 1030, configured to determine a node to be adjusted associated with the first node in response to the existence of the first node of the first data type;

A type conversion module 1040, configured to convert the data type of the node to be adjusted into a first data type;

A statement construction module 1050, configured to use the updated abstract syntax tree to construct an expression statement.

It should be noted that the specific implementation manner of the expression-oriented data processing system 1000 is basically the same as the specific embodiment of the above-mentioned expression-oriented data processing method, and will not be repeated here.

In a third aspect, the embodiment of the present application further provides an electronic device, the electronic device includes a memory and a processor, the memory stores a computer program, and the processor implements the above data processing method for expressions when executing the computer program. The electronic device may be any intelligent terminal including a tablet computer, a vehicle-mounted computer, and the like.

Please refer to FIG. 11. FIG. 11 illustrates a hardware structure of an electronic device in another embodiment. The electronic device includes:

The processor 1110 may be implemented by using a general-purpose CPU (Central Processing Unit, central processing unit), a microprocessor, an application-specific integrated circuit (Application Specific Integrated Circuit, ASIC), or one or more integrated circuits, and is used to execute related programs to realize The technical solutions provided by the embodiments of the present application;

The memory 1120 may be implemented in the form of a read-only memory (ReadOnlyMemory, ROM), a static storage device, a dynamic storage device, or a random access memory (RandomAccessMemory, RAM). The memory 1120 can store operating systems and other application programs. When implementing the technical solutions provided by the embodiments of this specification through software or firmware, the relevant program codes are stored in the memory 1120 and called by the processor 1110 to execute the implementation of this application. The data processing method for the expression of the example, for example, execute the method step S110 to step S150 in Fig. 1 described above, the method step S210 in Fig. 2, the method step S310 in Fig. 4, the method step S410 in Fig. 5 , the method step S510 in FIG. 6 and the method step S610 in FIG. 8;

The input/output interface 1130 is used to realize information input and output;

The communication interface 1140 is used to realize the communication and interaction between this device and other devices, and the communication can be realized through a wired method (such as USB, network cable, etc.), or can be realized through a wireless method (such as a mobile network, WIFI, Bluetooth, etc.);

bus 1150, to transfer information between various components of the device (eg, processor 1110, memory 1120, input/output interface 1130, and communication interface 1140);

The processor 1110 , the memory 1120 , the input/output interface 1130 and the communication interface 1140 are connected to each other within the device through the bus 1150 .

In a fourth aspect, the embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the above data processing method for expressions is implemented.

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

The non-transitory software programs and instructions required to implement the data processing method for expressions in the above embodiments are stored in the memory, and when executed by one or more processors, the data for expressions in the above embodiments are executed. Processing method, for example, carry out method step S110 to step S150 in Fig. 1 described above, method step S210 in Fig. 2, method step S310 in Fig. 4, method step S410 in Fig. 5, method step in Fig. 6 S510 and method step S610 in FIG. 8 .

The embodiments described in the embodiments of the present application are to illustrate the technical solutions of the embodiments of the present application more clearly, and do not constitute a limitation to the technical solutions provided by the embodiments of the present application. Those skilled in the art know that with the evolution of technology and new For the emergence of application scenarios, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems.

Those skilled in the art can understand that the technical solution shown in the figure does not constitute a limitation to the embodiment of the present application, and may include more or less steps than those shown in the figure, or combine some steps, or different steps.

The system embodiments described above are only illustrative, and the units described as separate components may or may not be physically separated, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the modules can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

Those of ordinary skill in the art can understand that all or some of the steps in the methods disclosed above, the functional modules/units in the system, and the device can be implemented as software, firmware, hardware, and an appropriate combination thereof.

The terms "first", "second", "third", "fourth", etc. (if any) in the description of the present application and the above drawings are used to distinguish similar objects and not necessarily to describe specific sequence or sequence. It is to be understood that the data so used are interchangeable under appropriate circumstances such that the embodiments of the application described herein can be practiced in sequences other than those illustrated or described herein. Furthermore, the terms "comprising" and "having", as well as any variations thereof, are intended to cover a non-exclusive inclusion, for example, a process, method, system, product or device comprising a sequence of steps or elements is not necessarily limited to the expressly listed instead, may include other steps or elements not explicitly listed or inherent to the process, method, product or apparatus.

It should be understood that in this application, "plurality" means two or more. The character "/" generally indicates that the contextual objects are an "or" relationship.

In the several embodiments provided in this application, it should be understood that the disclosed system and method can be implemented in other ways. For example, the above-described system embodiments are only illustrative. For example, the division of the above-mentioned units is only a logical function division. In actual implementation, there may be other division methods. For example, multiple units or components can be combined or can be Integrate into another system, or some features may be ignored, or not implemented. In another point, the mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces, and the indirect coupling or communication connection of systems or units may be in electrical, mechanical or other forms.

The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or may be distributed to multiple network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, each unit may exist separately physically, or two or more units may be integrated into one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.

If the integrated unit is realized in the form of a software function unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application is essentially or part of the contribution to the prior art or all or part of the technical solution can be embodied in the form of a software product, and the computer software product is stored in a storage medium , including multiple instructions to make a computer device (which may be a personal computer, a server, or a network device, etc.) execute all or part of the steps of the method in each embodiment of the present application. The aforementioned storage media include: U disk, mobile hard disk, read-only memory (Read-Only Memory, ROM for short), random access memory (Random Access Memory, RAM for short), magnetic disk or optical disk, etc., which can store programs. medium.

The preferred embodiments of the embodiments of the present application have been described above with reference to the accompanying drawings, which does not limit the scope of rights of the embodiments of the present application. Any modifications, equivalent replacements and improvements made by those skilled in the art without departing from the scope and essence of the embodiments of the present application shall fall within the scope of rights of the embodiments of the present application.

Claims (10)

1. A data processing method for an expression, the data processing method comprising:

acquiring an expression to be analyzed, and generating an abstract syntax tree by using the expression to be analyzed;

traversing the abstract syntax tree, and determining the data types of all nodes, wherein the data types comprise a first data type and a second data type, and the occupied bytes of the first data type are more than the occupied bytes of the second data type;

in response to a first node of the first data type being present, determining a node to be adjusted associated with the first node;

converting the data type of the node to be adjusted into the first data type;

and constructing an expression statement by using the updated abstract syntax tree.

2. The data processing method of claim 1, further comprising:

and responding to the absence of the first node of the first data type, converting the data types of all target nodes into the second data type, wherein each target node is generated by corresponding literal data in the expression to be analyzed.

3. The data processing method of claim 1, wherein the first node comprises at least one of a variable node generated from variable data in the expression to be parsed and a literal node generated from literal data in the expression to be parsed.

4. The data processing method of claim 1, wherein the determining the node to be adjusted associated with the first node in response to the first node having the first data type comprises:

in response to a first node of the first data type being present, sibling and ancestor nodes of the first node are determined to be nodes to be adjusted.

5. The data processing method of claim 1, wherein the determining the node to be adjusted associated with the first node comprises:

and sequentially determining ancestor nodes of the first node as nodes to be adjusted according to the depth of the abstract syntax tree until the next ancestor node is a special node, wherein the special node is characterized as a node with a fixed data type.

6. The data processing method of claim 1, wherein the determining the node to be adjusted associated with the first node comprises:

and under the condition that the parent node of the first node is not a special node, determining the brother node of the first node as a node to be adjusted, wherein the special node is characterized as a node with a fixed data type.

7. The data processing method according to claim 1, wherein after converting the data type of the node to be adjusted into the first data type, the method comprises:

traversing the updated abstract syntax tree, and converting the child nodes of the first data type into the first data type.

8. A data processing system for expressions, the system comprising:

the data generation module is used for acquiring an expression to be analyzed and generating an abstract syntax tree by using the expression to be analyzed;

the type determining module is used for traversing the abstract syntax tree and determining the data types of all nodes, wherein the data types comprise a first data type and a second data type, and the occupied bytes of the first data type are more than the occupied bytes of the second data type;

the association determining module is used for responding to a first node with the first data type, and determining a node to be adjusted associated with the first node;

the type conversion module is used for converting the data type of the node to be adjusted into the first data type;

and the statement construction module is used for constructing the expression statement by using the updated abstract syntax tree.

9. An electronic device, comprising a memory storing a computer program and a processor implementing the data processing method for an expression of any one of claims 1 to 7 when the computer program is executed by the processor.

10. A computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the data processing method for an expression of any one of claims 1 to 7.

Images