Interfix expression analysis method and system for data processing

Abstract

The invention provides an infix expression analysis method and system for data processing, and relates to the technical field of data processing.The method comprises the steps that character splitting and character position coding are conducted on an infix expression to obtain an arithmetic expression with position coding information, a variable expression with position coding information and a function expression with position coding information; performing parameter analysis on the arithmetic expression, the variable expression and the function expression with the position coding information according to definition rules of different types of expressions to obtain different types of parameter lists; performing parameter extraction and parameter calling on different types of parameter lists to obtain a plurality of parameter calculation results; and performing parameter combination on the plurality of parameter calculation results to form a prefix expression. According to the method, the complex expressions formed by mixing variables, functions, nested functions, custom functions and the like in the infix expressions can be converted, the conversion speed is high, confusion is not prone to occurring, and the efficiency and accuracy of big data analysis can be ensured.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to an infix expression parsing method and system for data processing. Background Art

[0002] Big data analysis plays an increasingly important role in modern society. It not only provides powerful decision-making support for enterprises and organizations, but also promotes the intelligent and refined development of various fields.

[0003] In the process of big data analysis, it is necessary to convert conventional infix expressions into prefix expressions for corresponding parameter calculations, where infix expressions are the most commonly used form for writing and reading mathematical formulas, and prefix expressions are a form that computers can recognize and use. In the prior art, when converting infix expressions and prefix expressions, two stacks are first created, one stack stores operators, and the other stack stores operands, and then the characters are pushed into the two stacks respectively by scanning the infix expression, and finally the operators are popped out in turn and pushed into the stacks corresponding to the operands to finally form the prefix expression; when the infix expression contains only a single arithmetic expression, the prior art has a faster conversion speed and higher accuracy, but when the infix expression contains numbers, operators, functions, nested functions, custom functions, variables and any mixture of the above elements, when the prior art is used to convert the expression, the conversion speed is slow and confusion is prone to occur, which in turn affects the efficiency and accuracy of big data analysis. Summary of the invention

[0004] The present invention provides an infix expression parsing method and system for data processing, which solves the problem that when converting existing infix expressions into prefix expressions, the conversion speed is slow and confusion is prone to occur, thereby affecting the efficiency and accuracy of big data analysis.

[0005] In a first aspect, an embodiment of the present invention provides an infix expression parsing method for data processing, the method comprising the following process:

[0006] Obtain an infix expression, and perform character splitting and character position encoding on the infix expression to obtain an arithmetic expression, a variable expression, and a function expression with position encoding information;

[0007] According to the definition rules of different types of expressions, the parameters of arithmetic expressions, variable expressions and function expressions with positional coding information are parsed to obtain parameter lists of different types;

[0008] Parameter extraction and parameter calling are performed on parameter lists of different types to obtain a number of parameter calculation results; and parameter combination is performed on the several parameter calculation results to form a prefix expression.

[0009] In the above embodiment, the present invention firstly uses character splitting and character position coding to distinguish different types of expressions, splits the infix expression into a combination of arithmetic expression, variable expression and function expression, and then performs parameter parsing on the basis of character splitting and character position coding, and finally performs parameter calculation and parameter combination on the basis of parameter parsing to obtain a prefix expression. In this way, complex expressions containing variables, functions, nested functions, user-defined functions, etc. in the infix expression can be converted, the conversion speed is fast, confusion is not easy to occur, and the efficiency and accuracy of big data analysis can be ensured.

[0010] As some optional implementations of the present application, the process of character splitting and character position encoding for the infix expression is as follows:

[0011] Perform character splitting and character position encoding on the infix expression to obtain a string with position encoding information;

[0012] Characters of character strings with positional coding information are combined according to definition rules of different types of expressions to obtain arithmetic expressions, variable expressions and function expressions with positional coding information.

[0013] In the above embodiment, the present invention processes the infix expression by character splitting and character position encoding, which can simplify the complex expression and facilitate the subsequent expression parsing and conversion.

[0014] As some optional implementations of the present application, the character position encoding is implemented using tree encoding.

[0015] In the above embodiment, the present invention uses a tree coding method to distinguish the type, relative position and hierarchical relationship of expressions, which is convenient for subsequent expression parsing and conversion.

[0016] As some optional implementations of the present application, the definition rules of different types of expressions are as follows:

[0017] The definition rule of the arithmetic expression is a string format including numbers, operators and bracket pairs;

[0018] The definition rule of the variable expression is a string format including a number of square bracket pairs, and a number of variable names are included in the middle of the square bracket pairs;

[0019] The definition rule of the function expression is a string format that starts with a letter and includes a number of bracket pairs.

[0020] In the above embodiments, the present invention can combine the split characters according to the definition rules of different types of expressions, thereby obtaining different types of expressions.

[0021] As some optional implementations of the present application, the process of performing parameter parsing on arithmetic expressions, variable expressions, and function expressions with positional encoding information according to definition rules of different types of expressions is as follows:

[0022] For arithmetic expressions with positional coding information, the strings are directly sorted and saved according to the positional coding information to obtain a first-level parameter list of the corresponding type;

[0023] For variable expressions with positional coding information, the variable names in the brackets are sorted and saved according to the positional coding information to obtain a secondary parameter list of the corresponding type;

[0024] For function expressions with position coding information, the function name and function parameters are arranged and saved according to the position coding information to obtain a three-level parameter list of the corresponding type; the three-level parameter list uses a recursive method to repeat character splitting, character position coding and parameter parsing until character splitting can no longer be performed.

[0025] In the above-mentioned embodiment, the present invention performs different parameter parsing for different types of expressions, and can obtain corresponding parameter settlement results respectively, thereby simplifying subsequent prefix expressions.

[0026] As some optional implementations of the present application, the process of extracting parameters and calling parameters for different types of parameter lists is as follows:

[0027] For the first-level parameter list, the character reading method is used to read the characters of the first-level parameter list, and the read numbers are placed in the digital stack, the read operators are prioritized, and the operators are placed in the operator stack according to the priority determination result, and the digital stack and the operator stack are combined to perform parameter calculation to obtain the parameter calculation result of the first-level parameter list;

[0028] For the secondary parameter list, direct replacement is performed according to the parameter value at the time of calling to obtain the parameter calculation result of the secondary parameter list;

[0029] For the three-level parameter list, a function parser is used to convert the function expression into an arithmetic expression, the arithmetic expression is read character by character reading, and the read numbers are placed in a digital stack, the read operators are prioritized, and the operators are placed in an operator stack according to the priority determination results, and parameter calculation is performed in combination with the digital stack and the operator stack to obtain the parameter calculation results of the three-level parameter list.

[0030] In the above embodiment, the present invention uses tree coding to continue character splitting and parameter parsing of the nested function expressions, thereby realizing the parsing of the nested functions.

[0031] As some optional implementations of the present application, the prefix expression is a combination of the parameter calculation results of the first-level parameter list, the parameter calculation results of the second-level parameter list, and the parameter calculation results of the third-level parameter list.

[0032] In the above-mentioned embodiment, the present invention performs parameter combination on the basis of parameter calculation, and then obtains the prefix expression after simplified conversion.

[0033] In a second aspect, the present invention provides an infix expression parsing system for data processing, the system comprising:

[0034] A character splitting and encoding unit, which is used to obtain an infix expression, and perform character splitting and character position encoding on the infix expression to obtain an arithmetic expression, a variable expression, and a function expression with position encoding information;

[0035] An expression parameter parsing unit, the expression parameter parsing unit is used to perform parameter parsing on arithmetic expressions, variable expressions and function expressions with position coding information according to definition rules of different types of expressions to obtain parameter lists of different types;

[0036] A prefix expression conversion unit is used to extract parameters and call parameters for different types of parameter lists to obtain a number of parameter calculation results; and to combine parameters for the several parameter calculation results to form a prefix expression.

[0037] In a third aspect, the present invention provides a computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the infix expression parsing method for data processing when executing the computer program.

[0038] In a fourth aspect, the present invention provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the infix expression parsing method for data processing.

[0039] The beneficial effects of the present invention are as follows: the present invention firstly adopts character splitting and character position coding to distinguish different types of expressions, splits the infix expression into a combination of arithmetic expression, variable expression and function expression, and then performs parameter parsing respectively on the basis of character splitting and character position coding, and finally performs parameter calculation and parameter combination respectively on the basis of parameter parsing to obtain prefix expression, and can convert complex expressions containing variables, functions, nested functions, user-defined functions and the like in the infix expression, has fast conversion speed, is not prone to confusion, and can ensure the efficiency and accuracy of big data analysis. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0041] Figure 1 is a schematic diagram of the computer device structure of the hardware operating environment described in the embodiment of the present invention;

[0042] Figure 2 is a flowchart of the infix expression parsing method according to an embodiment of the present invention;

[0043] Figure 3 A schematic diagram of the structure of the tree coding according to an embodiment of the present invention;

[0044] Figure 4 It is a system block diagram of the infix expression parsing system described in an embodiment of the present invention. DETAILED DESCRIPTION

[0045] It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0046] In order to solve the problem that when existing infix expressions are converted to prefix expressions, the conversion speed is slow and confusion is prone to occur, which affects the efficiency and accuracy of big data analysis. The embodiment of the present invention provides an infix expression parsing method and system for data processing. Before introducing the specific technical solution of the present application, the hardware operating environment involved in the embodiment of the present application is first introduced.

[0047] See also Figure 1 , Figure 1 A schematic diagram of the computer device structure of the hardware operating environment involved in the embodiment of the present invention.

[0048] like Figure 1 As shown, the computer device may include: a processor, such as a central processing unit (CPU), a communication bus, a user interface, a network interface, and a memory. Among them, the communication bus is used to realize the connection and communication between these components. The user interface may include a display screen (Display), an input unit such as a keyboard (Keyboard), and optionally, the user interface may also include a standard wired interface and a wireless interface. The network interface may be a wired interface or a wireless interface (such as a wireless fidelity interface). The memory may be a high-speed random access memory (Random Access Memory, RAM), or a stable non-volatile memory (Non-Volatile Memory, NVM), such as a disk storage. The memory may optionally be a storage device independent of the aforementioned processor.

[0049] Those skilled in the art will understand that Figure 1 The structure shown in the figure does not constitute a limitation on the computer device, and may include more or less components than shown in the figure, or combine some components, or arrange the components differently.

[0050] like Figure 1 As shown, the memory as a storage medium may include an operating system module, a network communication module, a user interface module and a data storage module.

[0051] exist Figure 1 In the computer device shown, the network interface is mainly used for data communication with the network server; the user interface is mainly used for data interaction with the user; the processor and memory in the computer device of the present application can be set in the computer device, and the computer device calls an infix expression parsing system for data processing stored in the data storage module through the processor, and executes an infix expression parsing method for data processing provided in an embodiment of the present application.

[0052] Based on the hardware environment of the aforementioned embodiment, the embodiment of the present application provides an infix expression parsing method for data processing, see Figure 2 , Figure 2 This is a flowchart of the infix expression parsing method, and the method flow is as follows:

[0053] (1) Obtain an infix expression, read each character in the infix expression one by one, and perform character splitting and character position encoding on the infix expression, splitting the infix expression into a combination of numbers, arithmetic expressions, variable expressions, and function expressions with position encoding information.

[0054] In an embodiment of the present invention, the process of character splitting and character position encoding for an infix expression is as follows:

[0055] (1.1) Perform character splitting and character position encoding on the infix expression to obtain a character string with position encoding information, wherein the character position encoding is implemented in a tree encoding manner.

[0056] (1.2) Character combinations are performed on character strings with positional coding information according to definition rules of different types of expressions to obtain numbers, arithmetic expressions, variable expressions, and function expressions with positional coding information.

[0057] Specifically, the tree encoding is used to implement character position encoding. The infix expression is used as the original node of the tree. The numbers, arithmetic expressions, variable expressions, and function expressions obtained by splitting the characters are used as the first branch nodes of the tree in the order of splitting. Figure 3 , Figure 3 The diagram is a structural diagram of the tree encoding.

[0058] (2) According to the definition rules of different types of expressions, the parameters of arithmetic expressions, variable expressions and function expressions with positional encoding information are parsed to obtain different types of parameter lists.

[0059] In the embodiment of the present invention, the definition rules of different types of expressions are as follows:

[0060] The definition rule of the arithmetic expression is a string format including numbers, operators and bracket pairs, such as "((1+2)*3)".

[0061] The definition rule of the variable expression is to include a number of square bracket pairs, and a string format of a number of variable names is included between the square bracket pairs, for example, "[param1], param1 is the variable name".

[0062] The definition rule of the function expression is a string format that starts with a letter and includes a number of bracket pairs, such as "ADD (1, 3), ADD is the function name, 1 and 3 are function parameters".

[0063] Specifically, the process of parsing parameters for arithmetic expressions, variable expressions, and function expressions with positional encoding information according to the definition rules of different types of expressions is as follows:

[0064] (2.1) For numbers and arithmetic expressions with positional coding information, the character strings are directly arranged and saved according to the positional coding information to obtain a first-level parameter list of the corresponding type; that is, numbers and arithmetic expressions do not need special processing and only need to be recorded as is.

[0065] (2.2) For variable expressions with positional coding information, the variable names in the square brackets are arranged and saved according to the positional coding information to obtain a secondary parameter list of the corresponding type; that is, the variable expression needs to parse out the variable names in the square brackets and record the variable names. When calculating the variable expression later, the value of the variable name can be directly replaced.

[0066] (2.3) For function expressions with position coding information, the function name and function parameters are arranged and saved according to the position coding information to obtain a three-level parameter list of the corresponding type; the three-level parameter list uses a recursive method to repeatedly perform character splitting, character position coding and parameter parsing until character splitting can no longer be performed; that is, the function expression needs to first extract the function name, where the function name starts with a letter and the string consisting of the first character starting from the first left bracket to the characters before the first comma is parsed as the first parameter, and the string consisting of the first character starting from the first comma to the characters before the second comma is parsed as the second parameter, and so on, to form a three-level parameter list. If there is no comma between the first left bracket and the end of the first right bracket, the function is considered to be a parameterless function and does not need to process the function parameters. Finally, it is necessary to parse each parameter item in the three-level parameter list. The parameters in the three-level parameter list support numbers, arithmetic expressions, function expressions, and variable expressions, so it is necessary to repeatedly parse each parameter in the three-level parameter list in a recursive manner until the parsed three-level parameter list can no longer be split and parsed.

[0067] In the embodiment of the present invention, by saving the tree-coded numbers, arithmetic expressions, variable expressions and function expressions in the form of parameter lists, data storage and subsequent parameter extraction and parameter calling can be facilitated.

[0068] In the embodiment of the present invention, when each parameter item in the three-level parameter list needs to be further parsed, tree encoding is also used to implement further character position encoding, that is, the string of the three-level parameter list is used as the original node of the tree, and the numbers, arithmetic expressions, function expressions, and variable expressions obtained by splitting are used as the second branch nodes of the tree in the splitting order, and so on, to obtain the third branch node, the fourth branch node and the Nth branch node of the tree, see Figure 3 , Figure 3 The diagram is a structural diagram of the tree encoding.

[0069] (3) Parameter extraction and parameter calling are performed on parameter lists of different types to obtain a number of parameter calculation results; and parameter combination is performed on the several parameter calculation results to form a prefix expression.

[0070] In an embodiment of the present invention, the process of extracting parameters and calling parameters for different types of parameter lists is as follows:

[0071] (3.1) For the first-level parameter list, the character reading method is used to read the first-level parameter list, and the read numbers are placed in the digital stack, the read operators are prioritized, and the operators are placed in the operator stack according to the priority determination results. The digital stack and the operator stack are combined to perform parameter calculation to obtain the parameter calculation results of the first-level parameter list; that is, for the arithmetic expression, the expression is read by using a string, and each read number is pushed into the digital stack, and each read operator needs to be compared with the operator at the top of the operator stack for priority. If the current operator has a higher priority than the top operator, the current operator is directly pushed into the operator stack; if the current operator has a lower priority than the top operator, it is necessary to pop the two adjacent elements at the top of the digital stack and calculate the operation result, and then push the result into the digital stack. Similarly, since parentheses have the highest priority, if a left parenthesis is read, it is directly pushed into the operand stack. If a right parenthesis is read, an operator needs to be popped from the operator stack, and then two numbers from the number stack are popped in succession. The numbers and operators are used to perform arithmetic operations to obtain the arithmetic result, and the result number is pushed into the arithmetic stack. After the operator stack is empty, the value in the number stack is popped, which is the final parameter calculation result.

[0072] (3.2) For the secondary parameter list, direct replacement is performed according to the parameter value at the time of calling to obtain the parameter calculation result of the secondary parameter list; that is, no additional operations are required for numeric and variable expressions, and they only need to be recorded as is.

[0073] (3.3) For the three-level parameter list, the function parser is used to convert the function expression into an arithmetic expression, and the arithmetic expression is read character by character. The read numbers are placed in the number stack, the read operators are prioritized, and the operators are placed in the operator stack according to the priority determination result. The number stack and the operator stack are combined to perform parameter calculation to obtain the parameter calculation result of the three-level parameter list; that is, for the function expression, the value of each item in the parameter list needs to be calculated separately, and then the built-in function of the parser is matched according to the function name, and the parameter value is passed into the built-in function for calling and finally returning the calculation result of the function expression. Through the above description, several types of function expressions can be converted into arithmetic expressions for calculation.

[0074] Specifically, the prefix expression is a combination of the parameter calculation results of the first-level parameter list, the parameter calculation results of the second-level parameter list, and the parameter calculation results of the third-level parameter list.

[0075] In summary, the present invention firstly adopts character splitting and character position coding to distinguish different types of expressions, splits the infix expression into a combination of arithmetic expression, variable expression and function expression, and then performs parameter parsing on the basis of character splitting and character position coding, and finally performs parameter calculation and parameter combination on the basis of parameter parsing to obtain prefix expression, which can convert complex expressions containing variables, functions, nested functions, user-defined functions, etc. in the infix expression, has fast conversion speed, is not prone to confusion, and can ensure the efficiency and accuracy of big data analysis.

[0076] In addition, in one embodiment, based on the same inventive concept as the above embodiment, the embodiment of the present invention provides an infix expression parsing system for data processing, see Figure 4 , Figure 4 is a system block diagram of the infix expression parsing system, the system corresponds one-to-one to the method of Example 1, and the system includes:

[0077] A character splitting and encoding unit, which is used to obtain an infix expression, and perform character splitting and character position encoding on the infix expression to obtain an arithmetic expression, a variable expression, and a function expression with position encoding information;

[0078] An expression parameter parsing unit, the expression parameter parsing unit is used to perform parameter parsing on arithmetic expressions, variable expressions and function expressions with position coding information according to definition rules of different types of expressions to obtain parameter lists of different types;

[0079] A prefix expression conversion unit is used to extract parameters and call parameters for different types of parameter lists to obtain a number of parameter calculation results; and to combine parameters for the several parameter calculation results to form a prefix expression.

[0080] It should be noted that each unit in the infix expression parsing system for data processing in this embodiment corresponds one-to-one to each step in the infix expression parsing method for data processing in the aforementioned embodiment. Therefore, the specific implementation method and technical effect achieved by this embodiment can refer to the implementation method of the aforementioned method for displaying the front-end page with multiple tabs, which will not be repeated here.

[0081] In addition, in one embodiment, the present application also provides a computer device, which includes a processor, a memory, and a computer program stored in the memory, and the computer program implements the method in the aforementioned embodiment when executed by the processor.

[0082] In addition, in one embodiment, the present application further provides a computer storage medium, on which a computer program is stored, and the computer program implements the method in the aforementioned embodiment when executed by a processor.

[0083] In some embodiments, the computer readable storage medium may be a memory such as FRAM, ROM, PROM, EPROM, EEPROM, flash memory, magnetic surface memory, optical disk, or CD-ROM; or various devices including one or any combination of the above memories. The computer may be various computing devices including intelligent terminals and servers.

[0084] In some embodiments, executable instructions may be in the form of a program, software, software module, script or code, written in any form of programming language (including compiled or interpreted languages, or declarative or procedural languages), and may be deployed in any form, including as a stand-alone program or as a module, component, subroutine or other unit suitable for use in a computing environment.

[0085] As an example, executable instructions may, but need not, correspond to a file in a file system, may be stored as part of a file that stores other programs or data, such as in one or more scripts in a HyperText Markup Language (HTML) document, in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files storing one or more modules, subroutines, or code portions).

[0086] By way of example, executable instructions may be deployed to be executed on one computing device, or on multiple computing devices located at one site, or on multiple computing devices distributed across multiple sites and interconnected by a communication network.

[0087] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also includes other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or system including the element.

[0088] The serial numbers of the above-mentioned embodiments of the present application are for description only and do not represent the advantages or disadvantages of the embodiments.

[0089] Through the description of the above implementation methods, those skilled in the art can clearly understand that the above-mentioned embodiment methods can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as a read-only memory / random access memory, a magnetic disk, or an optical disk), and includes a number of instructions for enabling a multimedia terminal device (which can be a mobile phone, a computer, a television receiver, or a network device, etc.) to execute the methods described in each embodiment of the present application.

[0090] The above are only preferred embodiments of the present application, and are not intended to limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the present application specification and drawings, or directly or indirectly applied in other related technical fields, are included in the patent protection scope of the present application.

Claims

1. A method for parsing infix expressions for data processing, characterized in that: The method comprises the following steps: Obtain an infix expression, and perform character splitting and character position encoding on the infix expression to obtain an arithmetic expression, a variable expression, and a function expression with position encoding information; According to the definition rules of different types of expressions, the parameters of arithmetic expressions, variable expressions and function expressions with positional coding information are parsed to obtain parameter lists of different types; Parameter extraction and parameter calling are performed on parameter lists of different types to obtain a number of parameter calculation results; and parameter combination is performed on the several parameter calculation results to form a prefix expression.

2. The infix expression parsing method for data processing according to claim 1, characterized in that: The process of character splitting and character position encoding for infix expressions is as follows: Perform character splitting and character position encoding on the infix expression to obtain a string with position encoding information; Characters of character strings with positional coding information are combined according to definition rules of different types of expressions to obtain arithmetic expressions, variable expressions and function expressions with positional coding information.

3. The infix expression parsing method for data processing according to claim 1, characterized in that: The character position coding is implemented in a tree coding manner.

4. The infix expression parsing method for data processing according to claim 1, characterized in that: The rules for defining different types of expressions are as follows: The definition rule of the arithmetic expression is a string format including numbers, operators and bracket pairs; The definition rule of the variable expression is a string format including a number of square bracket pairs, and a number of variable names are included in the middle of the square bracket pairs; The definition rule of the function expression is a string format that starts with a letter and includes a number of bracket pairs.

5. The infix expression parsing method for data processing according to claim 1, characterized in that: The process of parsing parameters for arithmetic expressions, variable expressions, and function expressions with positional encoding information according to the definition rules of different types of expressions is as follows: For arithmetic expressions with positional coding information, the strings are directly sorted and saved according to the positional coding information to obtain a first-level parameter list of the corresponding type; For variable expressions with positional coding information, the variable names in the brackets are sorted and saved according to the positional coding information to obtain a secondary parameter list of the corresponding type; For function expressions with positional coding information, the function names and function parameters are arranged and saved according to the positional coding information to obtain a three-level parameter list of the corresponding type; The three-level parameter list recursively repeats character splitting, character position encoding and parameter parsing until character splitting cannot be performed any more.

6. The infix expression parsing method for data processing according to claim 1, characterized in that: The process of parameter extraction and parameter calling for different types of parameter lists is as follows: For the first-level parameter list, the character reading method is used to read the characters of the first-level parameter list, and the read numbers are placed in the digital stack, the read operators are prioritized, and the operators are placed in the operator stack according to the priority determination result, and the digital stack and the operator stack are combined to perform parameter calculation to obtain the parameter calculation result of the first-level parameter list; For the secondary parameter list, direct replacement is performed according to the parameter value at the time of calling to obtain the parameter calculation result of the secondary parameter list; For the three-level parameter list, a function parser is used to convert the function expression into an arithmetic expression, the arithmetic expression is read character by character reading, and the read numbers are placed in a digital stack, the read operators are prioritized, and the operators are placed in an operator stack according to the priority determination results, and parameter calculation is performed in combination with the digital stack and the operator stack to obtain the parameter calculation results of the three-level parameter list.

7. The infix expression parsing method for data processing according to claim 1, characterized in that: The prefix expression is a combination of the parameter calculation results of the first-level parameter list, the parameter calculation results of the second-level parameter list, and the parameter calculation results of the third-level parameter list.

8. An infix expression parsing system for data processing, characterized in that: The system comprises: A character splitting and encoding unit, which is used to obtain an infix expression, and perform character splitting and character position encoding on the infix expression to obtain an arithmetic expression, a variable expression, and a function expression with position encoding information; An expression parameter parsing unit, the expression parameter parsing unit is used to perform parameter parsing on arithmetic expressions, variable expressions and function expressions with position coding information according to definition rules of different types of expressions to obtain parameter lists of different types; A prefix expression conversion unit is used to extract parameters and call parameters for different types of parameter lists to obtain a number of parameter calculation results; and to combine parameters for the several parameter calculation results to form a prefix expression.

9. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the infix expression parsing method for data processing described in any one of claims 1 to 7 is implemented.

10. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the infix expression parsing method for data processing according to any one of claims 1 to 7 is implemented.

Images