WO2021073195A1 - Computer-implemented method and device for generating spreadsheet formula, and storage medium - Google Patents

Abstract

The present application discloses a computer-implemented method and device for generating a spreadsheet formula, and a storage medium. The method comprises: acquiring a hierarchical formula for a spreadsheet, the hierarchical formula comprising an operator and a hierarchical reference, wherein the hierarchical reference corresponds to one or more nodes in one or more hierarchies in a hierarchical structure for the spreadsheet; determining dependency between one or more nodes on the basis of the correlation between the hierarchical reference and the one or more nodes; determining a computational relationship between one or more nodes on the basis of the operator and the dependency; and generating a spreadsheet formula at least on the basis of the hierarchical structure and the computational relationship for the spreadsheet.

Description

Computer-implemented method, device and storage medium for generating spreadsheet formula

cross reference

This application claims the priority of Chinese Patent Application No. 201910977971.4 filed on October 15, 2019, the entire content of which is incorporated herein by reference.

Technical field

This application relates to electronic form information processing, and in particular to computer-implemented methods, devices and storage media for generating electronic form formulas.

Background technique

In many industries, it is often necessary to write spreadsheets containing a large number of formulas (Spreadsheet). Spreadsheets usually include dozens of pages (sheets), thousands of rows (rows), and tens of thousands of cells (Cells), and there is a very complex mutual calculation relationship between each cell. The contents are all formulas.

Summary of the invention

In traditional spreadsheet processing software (such as Microsoft Excel, Google Sheet), if a formula is stored in a cell, the spreadsheet defaults to displaying the calculation result of the formula, and the formula lacks semantic information representing its true meaning. This makes editing the formulas in the spreadsheets time-consuming and laborious, error-prone, difficult to debug, and difficult to understand or change by people other than the spreadsheet author. There is currently no feasible solution to solve these problems.

Therefore, this application proposes a computer-implemented method, device, and storage medium for generating spreadsheet formulas in response to at least one of the above-mentioned problems.

According to a first aspect of the present application, there is provided a computer-implemented method for generating an electronic form formula, the method comprising: obtaining a hierarchical formula for the electronic form, the hierarchical formula including an operator and a hierarchical reference , Wherein the level reference corresponds to one or more nodes in one or more levels in the hierarchical structure of the spreadsheet, wherein each level has at least one node and has a corresponding level type, and each node corresponds to One or more cells in the electronic form, wherein the hierarchical structure further includes the affiliation relationship between the one or more nodes; based on the correspondence between the hierarchical reference and the one or more nodes Relationship to determine the dependency relationship between the one or more nodes; determine the calculation relationship between the one or more nodes based on the operator and the dependency relationship; and at least based on the use of the spreadsheet The hierarchical structure and the calculation relationship are used to generate the spreadsheet formula.

According to a second aspect of the present application, there is provided an apparatus for generating an electronic form formula, including: components for executing the steps of the method according to any one of the foregoing items.

According to a third aspect of the present application, there is provided a device for generating spreadsheet formulas, including: at least one processor; and at least one storage device, the at least one storage device stores instructions, when the instructions are The execution of the at least one processor causes the at least one processor to execute the method according to any one of the foregoing items.

According to a fourth aspect of the present application, there is provided a non-transitory computer-readable storage medium storing instructions that when executed by a processor cause the method as described in any one of the foregoing items to be performed.

According to a fifth aspect of the present application, there is provided an apparatus for generating an electronic form formula, the apparatus comprising: a hierarchical formula editor configured to obtain a hierarchical formula for the electronic form , The level formula includes an operator and a level reference, wherein the level reference corresponds to one or more nodes in one or more levels in the hierarchical structure of the spreadsheet, wherein each level has at least one node and Has a corresponding level type, each node corresponds to one or more cells in the spreadsheet, wherein the hierarchical structure also includes the membership relationship between the one or more nodes; a level formula parser, so The hierarchical formula parser is configured to determine the dependency relationship between the one or more nodes based on the correspondence between the hierarchical reference and the one or more nodes; the hierarchical formula parser is further configured In order to determine the calculation relationship between the one or more nodes based on the operator and the dependency relationship; and a formula translator, the formula translator is configured to be based on at least the The hierarchy structure and the calculation relationship are used to generate the spreadsheet formula.

According to some embodiments of the present application, an electronic form formula can be written intuitively. Therefore, you can easily understand the meaning of the formula by reading the formula itself in the spreadsheet.

In addition, according to some embodiments of the present application, formulas can be automatically written in electronic software. Therefore, you can make intelligent prompts or auto-complete when writing spreadsheet formulas.

In addition, according to some embodiments of the present application, formulas in the electronic form can be reused easily. Reusable formulas with semantic information can be automatically converted into formulas written with cell location information in the spreadsheet.

In addition, according to some embodiments of the present application, formula errors in the electronic form can be efficiently avoided or discovered. Therefore, even when the spreadsheet contains many formulas, it is easy to find errors in some of the formulas.

Those skilled in the art should understand that the above technical effects are exemplary rather than restrictive. Through the following detailed description of exemplary embodiments of the present application with reference to the accompanying drawings, other features and advantages of the present application will become clear.

Description of the drawings

The drawings constituting a part of the specification describe the embodiments of the present application, and together with the specification are used to explain the principle of the present application.

With reference to the drawings, the application can be understood more clearly according to the following detailed description, in which:

Fig. 1 is a flowchart schematically showing a computer-implemented method for generating spreadsheet formulas according to some embodiments of the present application.

Fig. 2 is a schematic diagram schematically showing a hierarchical structure for an electronic form according to some embodiments of the present application.

Fig. 3 is a schematic diagram schematically showing a hierarchical structure for an electronic form according to some embodiments of the present application.

Fig. 4 is a schematic diagram schematically showing a hierarchical calculation diagram for representing a hierarchical structure of an electronic form according to some embodiments of the present application.

Fig. 5 is a schematic diagram schematically showing nodes in a hierarchical calculation graph according to some embodiments of the present application.

Fig. 6 is a flowchart schematically showing a process for parsing text codes to generate a hierarchical formula according to some embodiments of the present application.

FIG. 7 is a schematic diagram schematically showing a directed graph of a compound operator for a hierarchy according to some embodiments of the present application.

FIG. 8 is a schematic diagram schematically showing a directed graph of a compound operator for a cell according to some embodiments of the present application.

FIG. 9 is a schematic diagram schematically illustrating a process for specifying a dependent cell for an operator according to some embodiments of the present application.

FIG. 10 is a schematic diagram schematically showing a process for converting a compound operator for a hierarchy into a compound operator for a cell according to some embodiments of the present application.

FIG. 11 is a schematic diagram schematically showing a directed graph of a compound operator for a cell after conversion according to some embodiments of the present application.

Fig. 12 is a schematic diagram schematically showing a directed graph of a custom atomic operator according to some embodiments of the present application.

FIG. 13 is a block diagram schematically showing an apparatus for generating an electronic form formula according to some embodiments of the present application.

Fig. 14 is a schematic block diagram showing an information processing device that can be used to implement an electronic form formula according to some embodiments of the present application.

Detailed ways

Various exemplary embodiments of the present application will now be described in detail with reference to the accompanying drawings. It should be noted that unless specifically stated otherwise, the relative arrangement, numerical expressions and numerical values of the modules and steps set forth in these embodiments do not limit the scope of the present application.

At the same time, it should be understood that, for ease of description, the sizes of the various parts shown in the drawings are not drawn in accordance with actual proportional relationships.

The following description of at least one exemplary embodiment is actually only illustrative, and in no way serves as any restriction on the application and its application or use.

The technologies, methods, and equipment known to those of ordinary skill in the relevant fields may not be discussed in detail, but where appropriate, the technologies, methods, and equipment should be regarded as part of the specification.

In all examples shown and discussed herein, any specific value should be interpreted as merely exemplary, rather than as a limitation. Therefore, other examples of the exemplary embodiment may have different values.

It should be noted that similar reference numerals and letters indicate similar items in the following drawings, and therefore, once an item is defined in one drawing, it does not need to be further discussed in the subsequent drawings.

FIG. 1 is a flowchart schematically showing a computer-implemented method 100 for generating spreadsheet formulas according to some embodiments of the present application.

As shown in FIG. 1, in step S101, a hierarchical formula for the electronic form can be obtained. The hierarchical formula includes an operator and a hierarchical reference, where the hierarchical reference corresponds to one or more levels in the hierarchical structure used for the electronic form. One or more nodes in.

According to some embodiments of the present application, each level may have at least one node and a corresponding level type, and each node may correspond to one or more cells in the spreadsheet. In addition, for example, the hierarchical structure may also include the affiliation relationship between one or more nodes.

The following describes the hierarchical structure for the electronic form with reference to FIGS. 2 and 3. Fig. 2 is a schematic diagram schematically showing a hierarchical structure for an electronic form according to some embodiments of the present application. Fig. 3 is a schematic diagram schematically showing a hierarchical structure for an electronic form according to some embodiments of the present application.

According to some embodiments of the present application, the hierarchical structure used for the electronic form may include, for example, the following levels obtained by dividing the electronic form: book, sheet, section, table, Block, row, column, interval, cell, etc. Note that the above-mentioned division method for the hierarchical structure of the electronic form is only exemplary, and other division methods may also be adopted.

The workbook can be a spreadsheet file (such as a file in .xls or .xlsx format), and the workbook can include multiple pages. Pages can include sections or tables, and each section can also include subsections and tables. The table can include rows, columns, or blocks. A block can be a collection of closely related rows or columns, and each block can also include sub-blocks.

Pages can be divided into different sections by different levels of headings. FIG. 2 shows an example of the hierarchical structure of pages in an electronic form. As shown in Figure 2, the first-level heading 1 and the first-level heading 2 can divide the pages in the spreadsheet into the first section and the second section. Section 1 may further include second-level heading 1.1 and second-level heading 1.2. Second-level heading 1.1 and second-level heading 1.2 may divide section 1 into section 1.1 and section 1.2 (in this example, section 1.2 Section is empty). Section 1.1 can include two tables, namely Table 1.1.A and Table 1.1.B. Similarly, section 2 may further include second-level heading 2.1 and second-level heading 2.2, and second-level heading 2.1 and second-level heading 2.2 may divide section 2 into section 2.1 and section 2.2. In addition, Section 2 can also include Table 2.A. Section 2.1 may include third-level heading 2.1.1 and third-level heading 2.1.2. The third level heading 2.1.2 may include section 2.1.2. Section 2.1.2 may include Table 2.1.2.A. In addition, Section 2.2 may include Table 2.2.A and Table 2.2.B. Note that you can add names to both the title and the table.

A table can include rows, columns, or blocks, and a block can include multiple rows or columns. FIG. 3 shows an example of the hierarchical structure of the table in the page in the spreadsheet. As shown in FIG. 3, the table may include, for example, 11 rows/columns, in which there may be 4 first-level rows/columns, namely, first-level rows/columns 1, first-level rows/columns, and first-level rows/columns. Row/column 4 and first-level row/column 6. In addition, the second-level row/column 3.1, the second-level row/column 3.2, and the second-level row/column 3.3 are second-level rows/columns, and they can form the first-level block 3. In addition, the third-level row/column 5.2.1 and the third-level row/column 5.2.2 are the third-level rows/columns, and they can form the second-level block 5.2. In addition, the second-level row/column 5.1, the second-level block 5.2, and the second-level row/column 5.3 may constitute the first-level block 5.

Cells at intersections of rows (or row blocks including multiple rows) and certain columns (or column blocks including multiple columns) may form intervals. For example, rows, row blocks, columns, and column blocks can all include intervals.

According to some embodiments of the present application, the hierarchical structure of the electronic form can be represented by a hierarchical calculation graph. The hierarchical calculation diagram can contain all the information in the electronic form, which can form a one-to-one correspondence with the electronic form.

The following describes a hierarchical calculation diagram for representing the hierarchical structure of the electronic form with reference to FIG. 4. FIG. 4 is a schematic diagram schematically showing a hierarchical calculation diagram 301 for representing the hierarchical structure of an electronic form according to some embodiments of the present application.

As shown in FIG. 4, each of the nodes 302 to 311 in the hierarchical calculation graph 301 may represent various levels in the hierarchical structure for the spreadsheet. Each node 302 to 311 may have a corresponding type, which may be various levels in the hierarchical structure of the spreadsheet, such as workbook, page, section, table, block, row, column, interval, cell, and so on. In Figure 4, different shapes can be used to represent different types of nodes. For example, the shape of the nodes 307 to 311 is a rhombus, which means that the type of the node is a cell.

In addition, as shown in FIG. 4, the edges between the various nodes in the hierarchical calculation graph 301 can be divided into two types, for example. For example, one type of edge in the hierarchical calculation graph 301 may be a membership relationship edge, which represents the membership relationship between one or more nodes. In Figure 4, solid arrows can be used to indicate the edges of the membership relationship. For example, the membership edge 316 from the node 302 to the node 303 may represent that the node 303 is a child of the node 302, that is, the node 303 belongs to the node 302. In addition, for example, another type of edge in the hierarchical calculation graph 301 may be a calculation relationship edge, which represents a calculation relationship between one or more nodes. Dotted arrows can be used in the figure to indicate the calculation relationship edge. For example, the calculation relationship edge 314 from the node 303 to the node 305 may represent that the node 305 is calculated by the node 303.

The nodes in the hierarchical calculation graph are described below with reference to FIG. 5. Fig. 5 is a schematic diagram schematically showing a node 305 in a hierarchical calculation diagram according to some embodiments of the present application.

As shown in FIG. 5, the node 305 in the hierarchical calculation graph may include: the type 402 of the corresponding level of the node, and the child nodes 403 connected by the affiliation edge of the node (for example, for the node 305, a node 309 is stored). Pointer), the operator 404 of the node, the dependent node 405 on which the node depends (for example, for the node 305, a pointer to the node 303 is stored), the semantic information 406 of the node (for example, the name of the node, the label, etc.) , Other information related to the node (optional) 407 (for example, node modifiers, attribute tags, etc.).

Those skilled in the art can understand that other nodes in the hierarchical calculation graph may have a configuration similar to that of the node 305, which will not be repeated here.

According to some embodiments of the present application, the step S101 of obtaining the level formula for the electronic form may include: providing a graphical user interface editor, wherein the graphical user interface editor includes a user interface for specifying nodes and/or operators of different levels. Components; receiving input for components used to specify nodes and/or operators of different levels; and generating a level formula based on the input.

For example, the user can specify different levels of nodes and/or operators by clicking and/or dragging the visual components provided in the graphical user interface editor, so that the level formula can be constructed more intuitively. Since the graphical user interface editor can provide visual components, it can enable users to construct hierarchical formulas more intuitively, which improves the convenience of users.

According to some embodiments of the present application, the above step S101 of obtaining a hierarchical formula for an electronic form may also include: receiving a text code input by a user; and parsing the text code to generate a hierarchical formula.

For example, a user can input a level formula in a plain text format through a text editor, and can generate a level formula by parsing the level formula in a plain text format, so that the level formula can be generated more efficiently.

According to some embodiments of the present application, operators may include atomic operators, and atomic operators may include one or more of the following: mathematical operators, mathematical functions, constants, system-defined functions, user-defined atomic operations symbol.

For example, the mathematical operator can be "+", "-", "*", "/" and other mathematical operators. In addition, for example, the mathematical function may be a mathematical function such as a summing function "SUM()", an averaging function "AVERAGE()" and the like. In addition, for example, the constant may be a constant such as "10" or "1 year". In addition, for example, the system-defined function can be the data source function "SOURCE()", the lag operation function ".lag(1 year)" and other system-defined functions. Among them, the data source function "SOURCE()" means receiving the data input by the user. , The lag calculation function ".lag(1 year)" represents the calculation that lags the data by 1 year. User-defined atomic operators are defined by users by combining other types of atomic operators. For example, the user can customize a new custom atomic operator "growth rate ()" by entering "growth rate ({x1}, {x2})={x2}/{x1}-1".

According to some embodiments of the present application, the hierarchical reference may correspond to one or more nodes in one or more hierarchies in the hierarchical structure used for the electronic form. For example, according to some embodiments of the present application, the hierarchical reference can be referred to by a character string.

As an example, here are some examples of hierarchical references:

(a) "ROW! Revenue>>BOOK! DCF Model/SHEET! Financial Statement/TABLE! Income Statement/BLOCK! US":

This level reference (a) represents a row (ROW) named "Revenue". This row is named "Financial Statement" under the workbook (BOOK) named "DCF Model". In the block named "US" under the table (TABLE) named "Income Statement" under the "SHEET" page (SHEET).

(b) "Revenue>>DCF Model/Financial Statement/Income Statement/US":

This level reference (b) represents the same meaning as the above level reference (a), but allows users to omit the level type without causing ambiguity, such as row (ROW), workbook (BOOK), page (SHEET) ), table (TABLE), block (BLOCK), etc.

(c) "Revenue>>./Income Statement/US":

This level reference (c) represents the same meaning as the above level reference (b). Note that the character string after ">>" is called the path (Path), and the path represents the level passed through in the process of finding the referred level from the top to the bottom of the hierarchical structure representing the spreadsheet. The path can be an absolute path, such as "DCF Model/Financial Statement/Income Statement/US" in the above-mentioned hierarchical reference (b); the path can also be a relative path, "./" indicates the current level, and "../" indicates the current The level to which the level belongs. For example, when the user is already under the page (SHEET) named "Financial Statement" under the workbook (BOOK) named "DCF Model", the relative The path is expressed as "./Income Statement/US".

(d) "Revenue":

If it does not cause ambiguity, the path can also be omitted. For example, if there is only one row named "Revenue" under the current table, then "Revenue" itself can refer to this row.

(e) "[[Europe]]Revenue":

You can add a label to further distinguish different rows. For example, "[[Europe]]Revenue" represents a row named "Revenue", and this row has the label "Europe (Europe)" to distinguish it from Other rows that are also named "Revenue (Income)", for example, are distinguished from the row "[[US]]Revenue" with the label "US (美国)".

(f) "ROW! Revenue: ROW! Profit":

This level reference (f) represents all the rows from the row of "Revenue" (ROW) to the row of "Profit" (ROW).

(g) "BLOCK! US>>BOOK! DCF Model/SHEET! Financial Statement/TABLE! Income Statement":

This level reference (g) represents a block named "US" (BLOCK). This block (BLOCK) is named "Financial Statement" under the workbook (BOOK) named "DCF Model". Under the table (TABLE) named "Income Statement" under "SHEET" page (SHEET).

(h) "COLUMN! 2018>>BOOK! DCF Model/SHEET! Financial Statement/TABLE! Income Statement":

This level reference (h) represents a column (COLUMN) named "2018". This column (COLUMN) is named "Financial Statement" under the workbook (BOOK) named "DCF Model". Under the table (TABLE) named "Income Statement" under "SHEET" page (SHEET).

(i) "COLUMN! 2018: COLUMN! 2020":

This level reference (i) represents all the columns from the column named "2018" (COLUMN) to the column named "2020" (COLUMN) in the current table.

(j) "Revenue[2018]":

This level reference (j) represents the cell named "2018" in the row named "Revenue".

(k) "Revenue[2018:2020]":

This level of reference represents the range named "2018" to "2020" in the row named "Revenue".

(l) "Revenue[hist]":

Represents the range of cells corresponding to all the columns with the label "hist" in the row named "Revenue".

(m) "COLUMN! 2018[Inventory]"

This hierarchical reference represents an interval composed of cells corresponding to all rows with the label "Inventory" in the column named "2018".

Note that the above implementation of the hierarchical reference is only exemplary, and other methods may also be used to implement the hierarchical reference. For example, the hierarchical structure used for the spreadsheet can be expressed as elements in the visual view in the graphical user interface, so that the hierarchical reference can be implemented directly through the elements in the visual view in the graphical user interface.

According to some embodiments of the present application, a level formula can be regarded as a series of atomic operators (or a compound operator composed of a series of atomic operators) acting on a parameter list composed of hierarchical references, and will act The result of is assigned to the left value of the hierarchy formula. As an example, some examples of hierarchical formulas are shown below. Note that in some implementations of this application, the content within "{}" can be used to represent hierarchical references.

{Profit}={income}-{cost}

{Income growth rate}={income}/{income}.lag(1 year)-1

{Average income growth rate}={Income growth rate}.average()

{Income}[forecast period]={income: ../income statement}.lag(1)*(1+{average revenue growth rate})

{Full year}[Inventory]={Q1}+{Q2}+{Q3}+{Q4}

{Total income}=SUM({US income: China income})

{BLOCK! Profit}={BLOCK! Income}-{BLOCK! cost}

As mentioned above, the hierarchical formula entered by the user includes operators and hierarchical references. According to the different input methods of the level formula, it is recognized that the operators included in the level formula and the complexity of the level reference are different. If the user constructs the hierarchical formula by clicking and/or dragging the visual components in the graphical user interface, since the hierarchical reference or operator of the spreadsheet corresponding to each component is determined, only the corresponding graphical user interface component needs to be identified The hierarchical reference or operator of the spreadsheet is sufficient. If the user inputs a level formula in the form of a text code (that is, the input is a string), the text code needs to be parsed to identify operators and level references in the string.

The process for parsing text codes to generate hierarchical formulas is described below with reference to FIG. 6. FIG. 6 is a flowchart schematically showing a process 600 for parsing text codes to generate a hierarchical formula according to some embodiments of the present application.

As shown in FIG. 6, in step S601, the text code may be segmented to obtain a word segmentation stream.

For example, for the following level formula:

{Income}[forecast period]={income: ../income statement}.lag(1)*(1+{average revenue growth rate})

The result of word segmentation is a word segmentation stream including the following word segmentation list:

"{", "Income", "}", "[", "Forecast period", "]", "=", "{", "Income", ":", "..", "/", "Income Statement", "}", ".lag", "(", "1", ")", "*", "(", "1", "+", "{", "Average revenue growth rate","}",")"

Note that the above word segmentation methods are only exemplary, and other word segmentation methods are also possible.

Referring back to FIG. 6, after step S601, the process 600 for parsing the text code to generate a hierarchical formula may proceed to step S603 and step S605.

In step S603, the word segmentation related to the operator in the word segmentation stream can be identified to determine the operator.

For example, in the above example, the word segmentation related to the operator in the word segmentation stream includes: "=", ".lag", "(", "1", ")", "*", "(", "1 ", "+", ")".

Based on the identified word segmentation related to the operator, the operator can be determined. According to some embodiments of the present application, based on the identified word segmentation related to the operator, the atomic operator can be determined.

For example, in the above example, according to the participles "=", ".lag", "(", "1", ")", "*", "(", "1", "+" related to the operator , ")", you can determine the atomic operators include: ".lag(1)", "*", "+".

In step S605, the word segmentation related to one or more nodes in one or more levels in the hierarchical structure of the electronic table in the word segmentation stream may be identified to determine the level reference.

For example, in the above example, the word segmentation related to one or more nodes in one or more levels in the hierarchical structure of the spreadsheet in the above word segmentation stream includes: "{", "income", "}", "[ ", "forecast period", "]", "{", "income", ":", "..", "/", "income statement", "}", "{", "average revenue growth rate ", "}".

Based on the identified word segmentation related to one or more nodes in one or more levels in the hierarchical structure of the electronic form, a hierarchical reference can be determined. Each level of reference can be referred to by one or more consecutive participles.

For example, in the above example, "{", "income", "}", "[", "forecast period", "]" refer to those whose column label in the row named "income" includes "forecast period" The range of cells. For another example, "{", "income", ":", "..", "/", "income statement", "}" refer to the table named "income statement" under the name "income" Line. For another example, "{", "average income growth rate", "}" refer to a cell named "average income growth rate".

Note that according to some implementations of the present application, the matching process from word segmentation to hierarchical citation can support fuzzy matching. For example, if the above "revenue" is written as "Sales", it can also be matched to the same level of reference. In addition, in other implementations, hierarchical references that follow a specific syntax may be supported, but the supported syntax for referring to hierarchical references may be arbitrary.

Referring back to FIG. 6, after step S603 and step S605, the process 600 for parsing the text code to generate a hierarchical formula may proceed to step S607. In step S607, a hierarchical formula may be generated according to the determined operator and hierarchical reference.

When the operator and the hierarchical reference are determined, the hierarchical formula can be generated according to the determined operator and the hierarchical reference. According to some embodiments of the present application, a hierarchical formula can be generated according to the determined atomic operator and hierarchical reference.

For example, in the above example, according to the determined atomic operators ".lag(1)", "*", "+" and the determined level reference "{income}[forecast period]", "{income:. ./Income Statement}", "{Average Revenue Growth Rate}", you can identify and generate a level formula: {Income}[Forecast Period]={Income: ../Income Statement}.lag(1)*(1+ {Average income growth rate}).

According to some embodiments of the present application, a compound operator may be constructed based on the atomic operators in the hierarchical formula, where the compound operator may include a combination of all the atomic operators in the hierarchical formula.

For example, in the case of identifying an atomic operator, a compound operator that can include a combination of all atomic operators in the hierarchy formula can be constructed based on the identified atomic operator and its position in the word segmentation stream (such as relative position) .

For example, in the above example, one expression of the compound operator constructed from the identified atomic operators ".lag(1)", "*", "+" is the following string:

{y}={x1}.lag(1)*(1+{x2})

Where {y}, {x1}, {x2} are placeholders, which means that parameters need to be filled in here.

In the case of constructing a compound operator based on an atomic operator, the above step S607 may include generating a hierarchical formula according to the determined compound operator and a hierarchical reference.

For example, in the above example, according to the constructed compound operator "{y}={x1}.lag(1)*(1+{x2})" and the determined level reference "{income}[forecast period] ", "{income:../income statement}", "{average revenue growth rate}", you can identify and generate a level formula: {income}[forecast period]={income:../income statement}.lag (1)*(1+{average income growth rate}).

According to some embodiments of the present application, a compound operator can be stored using one or more of the following items: a character string; a computer-implemented function pointed to by a function pointer; and a directed graph.

For example, in the above example, the compound operator can be stored in the form of a character string "{y}={x1}.lag(1)*(1+{x2})".

For example, in the above example, the compound operator can also be stored in the form of a computer-implemented function pointed to by a function pointer, where this function receives two parameters {x1} and {x2}.

For example, in the above example, the compound operator can also be stored in the form of a directed graph.

According to some embodiments of the present application, each node in a directed graph may represent an operator in a hierarchical formula, and the directed edges between each node in a directed graph may represent a combination of operators in a hierarchical formula relationship.

For example, each node in a directed graph can represent an atomic operator, a placeholder for a parameter, or a constant operator, and the directed edge between each node in a directed graph can represent a relationship between each node, such as an operation relationship. The combination of classes.

The directed graph for the compound operator of the hierarchy is described below with reference to FIG. 7. FIG. 7 is a schematic diagram schematically showing a directed graph of a compound operator for a hierarchy according to some embodiments of the present application.

FIG. 7 shows a directed graph for storing the compound operator "{y}={x1}.lag(1)* (1+{x2})" for the hierarchy in the above example. As shown in FIG. 7, nodes 802 to 804 in the directed graph represent atomic operators, nodes 805 and 807 in the directed graph represent placeholders for parameters, and node 806 in the directed graph represents constant operators.

In addition, as shown in Figure 7, the uppermost atomic operator is the atomic operator "*" in node 802 in the directed graph, which is based on the atomic operator ".lag(1)" in node 803 and node The calculation results of the two atomic operators "+" in 804 are used as input variables, and the atomic operator ".lag(1)" in node 803 takes the parameter "x1" in node 805 as input variables. The "+" in the node 804 takes the constant operator "1" in the node 806 and the parameter "x2" in the node 807 as input variables.

Referring back to FIG. 1, after step S101, the computer-implemented method 100 for generating spreadsheet formulas proceeds to step S103. In step S103, the dependency relationship between one or more nodes may be determined based on the correspondence relationship between the hierarchical reference and the one or more nodes.

According to some embodiments of the present application, the level reference may include the first level reference located on the left side of the equal sign in the level formula and the second level reference located on the right side of the equal sign in the level formula, where the first level reference (also Called lvalue) corresponds to the first node in one or more nodes, and the second-level reference corresponds to the second node in the one or more nodes (the second-level reference may be an empty set).

As mentioned above, a hierarchical formula can be seen as a series of atomic operators (or a compound operator composed of a series of atomic operators) acting on a parameter list composed of hierarchical references, and assigning the result of the effect to The left value of the level formula.

In the case of expressing the hierarchical formula with a hierarchical calculation graph, each hierarchical reference in the hierarchical formula can uniquely correspond to a certain level in the hierarchical structure of the spreadsheet and a certain node in the hierarchical calculation graph. The level reference on the left side of the equal sign in the level formula can be called the first level reference, and the node in the level calculation graph corresponding to the first level reference can be called the first node (or lvalue node) of this level formula (leftNode)). The level reference on the right side of the equal sign in the level formula can be called the second level reference, and the node in the level calculation graph corresponding to the second level reference can be called the second node (or dependent node ( inNodes)).

Each level formula can uniquely correspond to a compound operator, a first node (or lvalue node), and a group of second nodes (or dependent nodes). On the other hand, each compound operator and a matching first node (or lvalue node) and a set of second nodes (or dependent nodes) can also uniquely specify a level formula. The meaning of the hierarchical formula can be to pass the second node (or dependent node) to the parameter placeholder in the compound operator, and assign the result obtained to the first node (or lvalue node).

For example, for the level formula "{income}[forecast period]={income:../profit statement}.lag(1)*(1+{average revenue growth rate})", it is located on the left side of the equal sign in the level formula The level reference "{income}[forecast period]" can be called the first level reference, and the level on the right side of the equal sign in the level formula references "{income:../income statement}" and "{average income Growth rate}" can be referred to as a second-level citation.

For example, the first node (or lvalue node) corresponding to the first-level reference "{income}[forecast period]" can be defined by the column label in the row named "income" in the spreadsheet including "forecast period" The nodes in the hierarchical calculation graph corresponding to the interval composed of cells. For example, the second node (or dependent node) corresponding to the second-level reference "{income:../income statement}" can be the one named "income" in the table named "income statement" in the spreadsheet The nodes in the hierarchy calculation graph corresponding to the rows, and the second node (or dependent node) corresponding to the second-level reference "{average revenue growth rate}" can be the name "average revenue growth rate" in the spreadsheet The node in the hierarchical calculation graph corresponding to the cell.

According to some embodiments of the present application, the step S103 of determining the dependency relationship between one or more nodes based on the correspondence between the level reference and the one or more nodes may include: at least based on the first level reference and the first The correspondence between the nodes and the correspondence between the second-level reference and the second node are used to determine the dependency between the first node and the second node.

For example, in the above example, it can be based at least on the first-level reference "{income}[forecast period]" and the interval composed of the cells whose column label in the row named "income" in the spreadsheet includes "forecast period" The corresponding relationship between the nodes in the corresponding hierarchical calculation graph, the second-level reference "{income:../ income statement}" and the spreadsheet named "income statement" in the table named "income" The corresponding relationship between the nodes in the hierarchical calculation graph corresponding to the rows of, and the second-level reference "{average income growth rate}" and the level corresponding to the cell named "average income growth rate" in the spreadsheet Calculate the correspondence between the nodes in the graph, and determine the level corresponding to the interval composed of cells whose column label in the row named "Income" in the spreadsheet includes the "prediction period". The nodes in the calculation graph and the spreadsheet are determined The node in the hierarchical calculation graph corresponding to the row named "income" in the table named "Income Statement", and the hierarchical calculation corresponding to the cell named "Average Income Growth Rate" in the spreadsheet The dependencies between the nodes in the graph.

Referring back to FIG. 1, after step S103, the computer-implemented method 100 for generating spreadsheet formulas proceeds to step S105. In step S105, the calculation relationship between one or more nodes may be determined based on the operator and the dependency relationship.

For example, in the above example, it can be based on the nodes corresponding to the atomic operators ".lag(1)", "*", "+" and the level reference "{income}[forecast period]" and the level reference "{income: ../Income Statement}" and "{Average Income Growth Rate}" correspond to the dependency relationship between the nodes to determine the calculation relationship between the above nodes.

According to some embodiments of the present application, the step S105 of determining the calculation relationship between one or more nodes based on the operator and the dependency relationship may further include: determining one or more nodes based on at least the compound operator and the dependency relationship. The calculation relationship between.

For example, in the above example, it can be based on the compound operator "{y}={x1}.lag(1)*(1+" composed of the atomic operators ".lag(1)", "*", and "+" {x2})" and the node corresponding to the level reference "{income}[forecast period]" and the node corresponding to the level reference "{income: ../income statement}" and "{average revenue growth rate}" Dependency relationship to determine the calculation relationship between the above-mentioned various nodes.

According to some embodiments of the present application, for each node of one or more nodes, the calculation relationship between the node and other nodes may be stored via a hierarchical calculation graph.

For example, referring to Figure 4, in the case where the calculation relationship between each node of one or more nodes and other nodes is determined, the relationship between the node and other nodes can be stored in the hierarchical calculation graph shown in Figure 4 The calculation relationship between. For example, for the node 305 shown in FIG. 4, when it is determined that the node 305 is calculated by the node 303, the calculation relationship edge 314 from the node 303 to the node 305 can be used to store the relationship between the node 305 and the node 303. The dependency relationship, and the compound operator (404) of the calculation relationship is stored in the node 305, and the corresponding relationship between the dependent node of the node 305 and the placeholder in the compound operator.

According to some embodiments of the present application, the step S105 of determining the calculation relationship between one or more nodes based on the operator and the dependency relationship may include: determining the calculation relationship between the one or more nodes based on the operator and the dependency relationship between the first node and the second node. Determine the calculation relationship between the first node and the second node.

For example, in the above example, it can be based on the atomic operators ".lag(1)", "*", "+" or the compound operator "{y}={x1}.lag(1 )*(1+{x2})" and the first node corresponding to the first level reference "{income}[forecast period]" and the second level reference "{income: ../income statement}" and "{average Income growth rate}" corresponds to the dependency relationship between the corresponding second nodes to determine the calculation relationship between the first node and the second node.

According to some embodiments of the present application, for the first node, the calculation relationship between the first node and the second node may be stored via a hierarchical calculation graph.

For example, referring to FIG. 4, in the case where the calculation relationship between the first node and the second node is determined, the calculation relationship between the first node and the second node may be stored in the hierarchical calculation graph shown in FIG. 4 . For example, for the first node 305 shown in FIG. 4, when it is determined that the first node 305 is calculated by the second node 303, the calculation relationship edge 314 from the second node 303 to the first node 305 can be used to Store the dependency relationship between the first node 305 and the second node 303, and store the compound operator (404) of the calculation relationship in the node 305, and between the dependent node of the node 305 and the placeholder in the compound operator The corresponding relationship.

Referring back to FIG. 1, after step S105, the computer-implemented method 100 for generating spreadsheet formulas proceeds to step S107. In step S107, an electronic form formula may be generated based at least on the hierarchical structure and calculation relationship used for the electronic form.

Each level formula corresponds to one or more spreadsheet formulas. For example, for the level formula "{income}[forecast period]={income:../profit statement}.lag(1)*(1+{average revenue growth rate})", refer to the following "table: total table" , Assuming that the “income” row of the first node (or left value node) in the hierarchy formula is in row 10 of the total table in the spreadsheet, and “2019”, “2020” and “ The columns for 2021" are "F", "G", and "H" respectively. If the three columns of "2019", "2020", and "2021" all have the label "forecast period", then the "income" row (that is, row 10) in the total table in the target spreadsheet and Required in the cells at the intersection of "2019" (ie column F), "2020" (ie column G), and "2021" (ie column H) (ie cells F10, G10, and H10) Generate spreadsheet formulas.

Table: Total table

In addition, for example, referring to the following "table: income statement", suppose that the second node (dependent node) in the hierarchy formula, the line "income:../income statement" is on the 30th line of the income statement in the spreadsheet .

Table: Income Statement

In addition, for example, referring to the following "table: total table", suppose the cell corresponding to the value "10%" of the "average income growth rate" of another second node (dependent node) in the hierarchy formula is in the spreadsheet Row 12 and column C in the total table.

Table: Total table

Therefore, it can be based on the hierarchical structure of the spreadsheet (such as the above-mentioned total table, income statement, etc.), as well as the atomic operators ".lag(1)", "*", "+" or composed of the above atomic operators The compound operator "{y}={x1}.lag(1)*(1+{x2})" will generate the following three spreadsheets for cells F10, G10, and H10 in the total table in the spreadsheet formula:

For cell F10 in the total table, generate the spreadsheet formula "=E$30*(1+$C$12)"; for cell G10 in the total table, generate the spreadsheet formula "=F$30*(1+$C $12)"; For cell H10 in the total table, generate the spreadsheet formula "=G$30*(1+$C$12)".

According to some embodiments of the present application, the above step S107 of generating an electronic form formula based on at least the hierarchical structure and calculation relationship used for the electronic form may include: for each current node of the one or more nodes, based on one or more The calculation relationship between the current node and other nodes in the node determines the one or more second cells corresponding to each of the one or more first cells corresponding to the current node and one or more second cells corresponding to other nodes. The calculated relationship between each second cell in the cell; and at least based on each first cell in one or more first cells and each second cell in one or more second cells The calculation relationship between the cells generates a spreadsheet formula for each first cell of the one or more first cells.

According to some embodiments of the present application, each node in the hierarchical calculation graph corresponding to the spreadsheet can be traversed according to various graph traversal algorithms. Note that various graph traversal algorithms known in the art can be used when traversing the hierarchical calculation graph, which is not limited in this application, and will not be described in detail.

When traversing to each current node in one or more nodes in the hierarchical calculation graph, the calculation relationship between the current node and other nodes can be converted into each first cell and other nodes corresponding to the current node The calculation relationship between the corresponding second cells.

For example, in the above example, when traversing to the current node "{income}[prediction period]" in the hierarchical calculation graph, the current node "{income}[prediction period]" can be compared with other nodes "{income:. The calculation relationship between "./income statement}" and "{average revenue growth rate}" is converted to the first cell F10, G10, and H10 in the total table corresponding to the current node "{income}[forecast period]" The second cell E30, F30, G30 in the income statement corresponding to other nodes "{income:../profit statement}" and the value in the total table corresponding to the values of other nodes "{average revenue growth rate}" The calculation relationship between the second cell C12.

In the case where the calculation relationship between each first cell and each second cell has been obtained, the calculation relationship between each first cell and each second cell may be used to generate the calculation relationship between each first cell and each second cell. Spreadsheet formula for the cell.

For example, in the above example, for cell F10 in the total table, you can generate a spreadsheet formula "=E$30*(1+$C$12)"; for cell G10 in the total table, you can generate a spreadsheet formula " =F$30*(1+$C$12)"; For cell H10 in the total table, a spreadsheet formula "=G$30*(1+$C$12)" can be generated.

According to some embodiments of the present application, it is determined above that each of the one or more first cells corresponding to the current node and each of the one or more second cells corresponding to other nodes The step of calculating the relationship between the second cells may include: determining each of the one or more first cells corresponding to the current node based at least on the operator corresponding to the current node in the one or more nodes. Operator corresponding to a first cell; and at least based on the dependency relationship between the current node and other nodes in one or more nodes, determine the one or more first cells corresponding to the current node The dependency relationship between each first cell and each of the one or more second cells corresponding to other nodes.

The directed graph of the compound operator for the cell is described below with reference to FIG. 8. FIG. 8 is a schematic diagram schematically showing a directed graph of a compound operator for a cell according to some embodiments of the present application.

According to some embodiments of the present application, the operator corresponding to the current node in the one or more nodes is related to one of the one or more nodes in the hierarchical structure of the spreadsheet. The corresponding first-level compound operator, the first-level compound operator includes one or more first-level atomic operators; the operator corresponding to each first cell in the one or more first cells Is a second-level compound operator corresponding to one of the one or more cells in the spreadsheet, and the second-level compound operator includes one or more second-level atomic operators; and Based on at least the first-level compound operator corresponding to the current node in the one or more nodes, determine the corresponding one of the one or more first cells corresponding to the current node The second level compound operator.

The compound operator for the cell (which is also referred to as the second-level compound operator in this article) and the compound operator for the level in the hierarchical calculation graph (which is also called the first-level compound operator in this article) Operator) is very similar in form, both are a directed graph, but have different meanings. Since each cell in the spreadsheet can only store one number or other variable, each parameter of the compound operator used in the cell can only be a scalar, and its calculation result is also a scalar. In contrast, the parameter of the compound operator used for the level is a level. This level is generally a collection of multiple variables, and its calculation result is also a collection of multiple calculation results.

For example, in the above example, since the lvalue node contains three cells F10, G10, and H10, it is necessary to generate a second-level compound operator for the three cells F10, G10, and H10 respectively. In this example, the generated compound operators for these three cells F10, G10, and H10 are all the same (but the dependent cells passed to the placeholder are different), as shown in Figure 8.

In Figure 8, the hierarchical atomic operator "*" 802 in Figure 7 is converted to the cell atomic operator "*" 1002; the hierarchical atomic operator ".lag(1)" 803 is converted to the cell atom Operator "id (equal)" 1003; level atomic operator "+" 804 is converted into cell atomic operator "+" 1004; level constant atomic operator "1" 806 is converted into cell constant atomic operation The symbol "1" 1006; the two types of hierarchical parameter placeholders "x1" 805 and "x2" 807 are converted into two parameter placeholders "x1" 1005 and "x2" 1007 that are cell references.

Although the atomic operators "*", "+", and "1" in Figure 7 and Figure 8 have the same name, they are objects of different classes. Similarly, the parameter placeholders "x1" and "x2" are also objects of different classes in Figure 7 and Figure 8. The former is a node in the hierarchical calculation graph, and the latter is used to store references to cells in the spreadsheet.

According to some embodiments of the present application, the dependency relationship between the current node and other nodes in one or more nodes can be converted into each first cell corresponding to the current node and each second cell corresponding to other nodes. Dependencies between cells.

The process for specifying dependent cells for operators is described below with reference to FIG. 9. FIG. 9 is a schematic diagram schematically illustrating a process for specifying a dependent cell for an operator according to some embodiments of the present application.

As shown in Figure 9, in the case where compound operators have been constructed for cells F10, G10, and H10 in the total table, it is possible to determine which cells each parameter placeholder in these compound operators depends on. . The dependent nodes of the node storage corresponding to the level "income [prediction period]" in the level calculation graph are "{income: ../income statement}" and "{average income growth rate}". The former is a row and the latter is A cell. Due to the ".lag(1)" operation on "{income:../income statement}", the position of the dependent cell needs to be shifted 1 bit to the left. Therefore, the dependent node "{income:../income statement}" can be converted into the dependent cell E$30 of cell F10, the dependent cell F$30 of cell G10, and the dependent cell G$30 of cell H10; Convert the dependent node "{average income growth rate}" into the dependent cell $C$12 of cell F10, the dependent cell $C$12 of cell G10, and the dependent cell $C$12 of cell H10. Therefore, the dependent cells of the three cells F10, G10, and H10 are [E$30,$C$12], [F$30,$C$12], [G$30,$C$12], respectively.

According to some embodiments of the present application, the step of generating the spreadsheet formula for each of the one or more first cells may include: at least based on one or more first cells corresponding to the current node. The operator corresponding to each first cell in a cell, and one or more corresponding to each first cell in the one or more first cells corresponding to the current node and other nodes The dependency relationship between each second cell in the second cell generates a spreadsheet formula for each first cell in the one or more first cells.

For example, in the above example, for cell F10, according to the compound operator shown in Figure 8 and dependent cells [E$30, $C$12], the spreadsheet formula for cell F10 can be generated as "=E$30 *(1+$C$12)". Similarly, for cell G10, according to the compound operator shown in Figure 8 and dependent cells [F$30, $C$12], the spreadsheet formula for cell G10 can be generated as "=F$30*(1+$ C$12)". Similarly, for cell H10, according to the compound operator shown in Figure 8 and dependent cells [G$30, $C$12], the spreadsheet formula for cell H10 can be generated as "=G$30*(1+$ C$12)".

According to some embodiments of the present application, the first-level compound operator uses a first-level directed graph for storage, and each directed graph node in the first-level directed graph represents each first-level of the first-level compound operator Atomic operators, and the directed edges between each directed graph node in the first-level directed graph represent the combination relationship between each first-level atomic operator in the first-level compound operator; the second-level compound Operators are stored in the second-level directed graph. Each directed graph node in the second-level directed graph represents each second-level atomic operator in the second-level compound operator, and the second-level directed graph The directed edges between the nodes of the directed graph represent the combination relationship between the second-level atomic operators in the second-level compound operator; and the first-level corresponding to the first-level compound operator through traversal The directed graph is used to determine the second-level directed graph, and the second-level compound operator is determined according to the second-level directed graph.

The following describes the process of converting the compound operator for the hierarchy into the compound operator for the cell with reference to FIG. 10 and FIG. 11. FIG. 10 is a schematic diagram schematically showing a process for converting a compound operator for a hierarchy into a compound operator for a cell according to some embodiments of the present application. FIG. 11 is a schematic diagram schematically showing a directed graph of a compound operator for a cell after conversion according to some embodiments of the present application.

For example, the compound operator "{y}=SUM(({x1}+{x2}.lag(1)).sum(),{x3},{x4}*{x5})" in the hierarchy formula is For example, the parameter placeholders {y}, {x1}, {x2}, {x3} represent the first-level directed graph nodes whose type is row, and the parameter placeholders {x4}, {x5} Represents the first-level directed graph node whose type is a cell.

The left side of Figure 10 shows the above-mentioned hierarchical formula "{y}=SUM(({x1}+{x2}.lag(1)).sum(),{x3},{x4}*{x5})" A directed graph (referred to as a first-level directed graph in this article) of a compound operator (referred to as the first-level compound operator in this article) used in the hierarchy. Figure 11 shows the conversion of the compound operator (referred to as the second-level compound operator in this article) for the cell with the column label of “2018” in the row "{y}" in Figure 10 after conversion. A directed graph (referred to as a second-level directed graph in this article).

According to some embodiments of the present application, the determining the second-level directed graph by traversing the first-level directed graph corresponding to the first-level compound operator may include: traversing the first level in the order of post-order traversal Directed graph, so that the child directed graph nodes in the first-level directed graph are traversed first, and then the parent directed graph nodes in the first-level directed graph are traversed.

According to some embodiments of the present application, when traversing to the current first-level directed graph node in one or more first-level directed graph nodes, according to the current first-level directed graph node The first-level atomic operator represented by the graph node and the attribute information of the first-level child directed graph node of the current first-level directed graph node determine the attribute information of the current first-level directed graph node, where each The attribute information of a first-level directed graph node includes one or more of the following: the location information of the cell in the spreadsheet, the label information corresponding to the cell in the spreadsheet, and the Cell location information, label information and intermediate directed graph nodes corresponding to the cells in the spreadsheet, intermediate directed graph nodes corresponding to the cells in the spreadsheet, and can be based on the first level The attribute information of each first-level directed graph node in the one or more first-level directed graph nodes in the first-level directed graph determines the set of each intermediate-level directed graph node in the intermediate-level directed graph, according to The dependency relationship between the one or more first-level directed graph nodes in the first-level directed graph determines that each intermediate level in each intermediate-level directed graph node set in the intermediate-level directed graph has The dependency relationship between a directed graph node and each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph.

In addition to storing atomic operators, each node in the first-level directed graph of the first-level compound operator used for the hierarchy also stores additional attribute information (1212-1219, 1231 as shown on the right in Figure 10). ~1233). The attribute information is used to record the intermediate calculation process of transforming the first-level directed graph into the second-level directed graph. For each node in the first-level directed graph in the row-oriented hierarchy formula, the attribute information can be a labeled row (a list of column labels (called a column label group)) and an intermediate directed graph Graph node list), where the intermediate-level directed graph node stores the position of a cell or a cell atomic operator (called intermediate-level atomic operator), and other intermediate nodes that the atomic operator depends on), or Is a scalar (an intermediate-level directed graph node without a label). For each node in the first-level directed graph of the hierarchical formula for other hierarchical types, the attribute information can also be a labeled column (a list of row labels (called a row label group) and an intermediate level A directed graph node list) can also be a two-dimensional list of a row label group, a column label group, and a corresponding intermediate-level directed graph node. All intermediate-level directed graph nodes corresponding to all first-level directed graph nodes constitute an intermediate-level directed graph. For the row-specific formula, the attribute information of the leaf node of the compound operator of the hierarchy can be obtained directly from the position of the row or cell corresponding to the leaf node. If the leaf node corresponds to a row (for example, the left side in Figure 10) Shown as 1202, 1203, 1207), the attribute information consists of the column label group of this row and the intermediate directed graph node that stores the position of each cell in this row (for example, as shown on the right in Figure 10 1212, 1213, 1217); if the leaf node corresponds to a cell (for example, 1221, 1222 shown on the left in Figure 10), then its attribute information is the middle-level directed Graph nodes (for example, 1231 and 1232 shown on the right in FIG. 10).

As described above, a post-order traversal method can be used to traverse the directed graph for the compound operator of the hierarchy (the child node is traversed first, and then the parent node). When traversing to each node, the attribute information of the node can be determined according to the atomic operator of the node and the attribute information of the child nodes of the node. For example, by performing post-order traversal on the directed graph of the compound operator for the hierarchy shown on the left in FIG. 10, the intermediate directed graph shown on the right in FIG. 10 can be obtained, wherein, according to the first The attribute information of each first-level directed graph node in the one or more first-level directed graph nodes in the first-level directed graph determines the set of each intermediate-level directed graph node in the intermediate-level directed graph , At least according to the dependency relationship between the one or more first-level directed graph nodes in the first-level directed graph to determine each of the set of each intermediate-level directed graph node in the intermediate-level directed graph The dependency relationship between the intermediate-level directed graph node and each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph.

According to some embodiments of the present application, the first-level atomic operators are divided into elementwise atomic operators (Elementwise Atomic Operators), dimensionality-reduction atomic operators (Dimension-Reduction Atomic Operators), and transposition atomic operators (Transposition Atomic Operators). , One of user-defined atomic operators.

Element-wise atomic operators can include mathematical operators such as "+, -, *, /", and functions expressed in capital letters, such as "SUM(), AVERAGE()", and so on. When the element-wise atomic operator is applied to two rows, the cells with the same column label corresponding positions in the two rows can be added.

Dimensionality reduction atomic operators can be expressed in lowercase letters and connected to variables with ".", excluding misplaced atomic operators.

Misplaced atomic operators can refer to atomic operators such as "lag(1), lead(1), shift(1)", etc. When determining the label information in the attribute information of the nodes of these misplaced atomic operators, these misplaced operations need to be performed The label information of the child nodes of the symbol node is obtained by dislocation.

According to some embodiments of the present application, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is an element-wise atomic operator, the following operations can be performed.

If the attribute information of each first-level sub-directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, then the attribute information of each first-level sub-directed graph node The intersection of the label information contained in the attribute information sets the label information in the attribute information of the current first-level directed graph node, and sets the current first-level atomic operator represented by the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the first-level directed graph node is determined to be related to the current first-level based on the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The current intermediate-level directed graph node set corresponding to the directed graph node, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes and according to the current first-level directed graph node The label information in the attribute information of the graph node and its first-level child directed graph node is used to determine each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph.

For example, for a row-oriented hierarchical formula, when traversing to element-wise atomic operators (for example, when traversing to 1205, 1208, and 1223 shown on the left in Figure 10): If the attribute information of the child nodes are all labeled rows , The intersection of the column label groups of these rows is taken as the column label group of the node. For example, when traversing to 1205 shown on the left in Figure 10, the attribute information 1212 and 1214 of its child nodes are all labeled rows, and the column label groups are "[2017,2018,2019]" and "[2018 ,2019,2020]", and use the intersection "[2018,2019]" of the two column label groups as the label of the attribute information (1215) of 1205. Set the intermediate atomic operator of the intermediate directed graph node in 1215 to the cell atomic operator "+" corresponding to the element-wise atomic operator of 1205, and the intermediate directed graph node corresponding to the position of the "2018" label The dependent intermediate node is set to the intermediate directed graph node corresponding to the position of the "2018" label in 1212 and 1214; the intermediate directed graph node that the intermediate directed graph node at the corresponding position of the "2019" label depends on is set to The middle-level directed graph node corresponding to the "2019" label in 1212 and 1214.

If the attribute information of each first-level child directed graph node of the current first-level directed graph node does not contain label information, then the attribute information of the current first-level directed graph node does not include label information, according to The first-level atomic operator represented by the current first-level directed graph node sets the intermediate-level atomic operator in the attribute information of the current first-level directed graph node, at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the current first-level directed graph node is used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level The dependency relationship between the sub-directed graph nodes is used to determine the current intermediate-level directed graph node corresponding to the current first-level directed graph node in each intermediate-level directed graph node and the intermediate-level directed graph. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes.

If the attribute information of the child nodes are all intermediate-level directed graph nodes without labels (for example, node 1223), the attribute information (1233) of the node is also set as an intermediate-level directed graph node without labels, The atomic operator of the 1233 intermediate-level directed graph node is the cell atomic operator ("*") corresponding to the element-wise atomic operator, and the dependent intermediate-level directed graph node is the intermediate level in the attribute information of the child node. Graph nodes (1231, 1232).

If the attribute information of a part of the current first-level directed graph node of the first-level child directed graph node contains the label information corresponding to the cell in the spreadsheet and the other part of the current first-level directed graph node is the first The attribute information of the first-level child directed graph node does not contain the label information corresponding to the cell in the spreadsheet, then according to the intersection of the label information contained in the attribute information of the first-level child directed graph node that contains the label information Set the label information in the attribute information of the current first-level directed graph node, and set the attribute information of the current first-level directed graph node according to the first-level atomic operator represented by the current first-level directed graph node The intermediate level atomic operator in the current first level directed graph node determines the current intermediate level corresponding to the current first level directed graph node based on the label information and the intermediate level atomic operator in the attribute information of the current first level directed graph node The set of directed graph nodes, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node and its first-level child directed graph The label information in the attribute information of the node determines each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node and other intermediates in the intermediate-level directed graph The dependency relationship between each intermediate-level directed graph node in the set of one-level directed graph nodes.

If the attribute information of the child node has both a labeled row and a scalar (such as node 1208), first use the intersection of the column label group ([2017,2018,2019]) of the attribute information of the child node as the attribute information of the node ( 1218) column label group ([2017,2018,2019]), set the atomic operator of the intermediate node in 1218 to the cell atomic operator "sum" corresponding to the first-level atomic operator of 1208, and set "2017 The intermediate node on which the intermediate node corresponding to the position of the label depends is set to the intermediate node corresponding to the position of the "2017" label in 1217, as well as the intermediate node 1216 and the intermediate node 1233; in addition, for the positions corresponding to the "2018" and "2019" labels in 1218 The operation of the intermediate node is similar, so I won't repeat it here.

According to some embodiments of the present application, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is a dimensionality reduction atomic operator, the following operations can be performed.

So that the attribute information of the current first-level directed graph node does not contain label information or includes a subset of the label information in the attribute information of the first-level child directed graph node of the current first-level directed graph node, Set the intermediate-level atomic operator in the attribute information of the current first-level directed graph node at least according to the first-level atomic operator represented by the current first-level directed graph node, and at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level directed graph node The dependency relationship between the first-level sub-directed graph nodes is used to determine each intermediate-level directed graph node and the intermediate-level directed graph in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in.

For example, when traversing to a dimensionality reduction operator (such as node 1206), the attribute information of the node is set to a scalar, and the operator of the intermediate-level directed graph node (1216) corresponding to this scalar is set to the dimensionality reduction operation The cell atomic operator ("sum") corresponding to the symbol, the dependent node of the intermediate-level directed graph node is all the intermediate-level directed graph nodes in the attribute information (1215) of the child node (1205) of 1206.

According to some embodiments of the present application, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is a misplaced atomic operator, the following operations can be performed.

In the case that the attribute information of the first-level child directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, the attribute information of the first-level child directed graph node The label information contained in the information is set to the label information in the attribute information of the current first-level directed graph node, and the “equal” atomic operator is set to the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the directed graph node is determined to be relative to the current first-level directed graph node according to the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The corresponding set of current intermediate-level directed graph nodes, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node and its first level The label information in the attribute information of the first-level sub-directed graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the directed graph.

For example, when traversing to 1204, since the atomic operator of 1204 is ".lag(1)", the column label group "[2017,2018,2019]" of the attribute information (1213) of the child node 1203 of 1204 is wrong The first place becomes "[2018,2019,2020]". Set the cell atomic operator of the intermediate node at positions "2018" and "2019" in 1214 to "id (equivalent)", and set the dependent node to the intermediate node corresponding to positions "2018" and "2019" in 1213.

According to some embodiments of the present application, a sub-directed graph with the root node of each intermediate-level directed graph in the set of intermediate-level directed graph root nodes as the root node may be extracted from the intermediate-level directed graph, and the The extracted sub-directed graph is used as the second-level directed graph to determine the second-level compound operator according to the second-level directed graph.

According to some embodiments of the present application, when the root node set of the intermediate-level directed graph is obtained, the position of each intermediate-level directed graph root node in the intermediate-level directed graph root node set can be compared with that of the intermediate-level directed graph. The positions of the left-value nodes of each intermediate-level directed graph in the set of left-value nodes correspond to each other. For example, the label information in the attribute information of the root node of each intermediate-level directed graph can be matched with the label information in the attribute information of the left-value node of each intermediate-level directed graph. The position corresponds to the position of the left value node of each intermediate-level directed graph. Then, the sub-directed graph with the root node of the intermediate-level directed graph at the corresponding matching position as the root node can be extracted as the second-level directed graph to determine the middle-level left-value node corresponding to the second-level directed graph The second level compound operator of the cell.

For example, in the case of obtaining the attribute information 1218 of the node 1208, each intermediate node in 1218 corresponds to a compound operator for the cell, and this only needs to be the sub-directed graph with the intermediate node as the root node Just pull it out. For example, the compound operator of the cell corresponding to the position of the label "2018" in 1218 is shown in Figure 11. Assign the compound operator of these cells to the cell with the same label position as the left value. For example, the compound operator in Fig. 11 can be assigned to the cell corresponding to the intermediate node in the row corresponding to 1219 in Fig. 10 and the column label is “2018”. Specifically, for example, in a case where the attribute information 1218 of the node 1208 is obtained, the position of each attribute information 1218 may be corresponded to the position of each attribute information 1219 of the node 1209. For example, the attribute information 1218 can be matched by matching the label information "2017", "2018", and "2019" in each attribute information 1218 with the labels "2018", "2019", and "2020" in each attribute information 1219. The position of the intermediate-level directed graph node corresponding to the label information "2018" in the attribute information 1219 corresponds to the intermediate-level directed graph node position corresponding to the label information "2018" in the attribute information 1219, and the label information in the attribute information 1218 The position of the intermediate-level directed graph node corresponding to “2019” corresponds to the position of the intermediate-level directed graph node corresponding to the label information “2019” in the attribute information 1219. Then, the sub-directed graph with the node "2018" in the attribute information 1218 as the root node can be extracted as the second-level compound operator and assigned to the middle-level directed graph at the position of the label "2018" in the attribute information 1219 The cell corresponding to the graph node.

Note that for different levels of formulas such as columns, blocks, intervals, cells, etc., similar steps can be used to convert the first-level directed graph to the second-level directed graph. For example, for a column-level formula, the row label group in the first-level directed graph node attribute information can be operated according to the method for operating the column label group in the above steps. For another example, for a block-level formula, when each element-wise atomic operator is traversed, the column label group contained in the attribute information of the first-level sub-directed graph node of the current first-level directed graph node The intersection of is set as the column label group in the attribute information of the current first-level directed graph node, and the row label contained in the attribute information of the first-level child directed graph node of the current first-level directed graph node The intersection of the groups is set as the row label group in the attribute information of the current first-level directed graph node; when traversing to the dimensionality reduction atomic operator, the attribute information of the current first-level directed graph node does not contain the label Information, or only a subset of the label information contained in the attribute information of the first-level child directed graph node of the current first-level directed graph node (for example, only one row label group or only one column label Group); when traversing to the dislocation atomic operator, the row label group contained in the attribute information of the first-level sub-directed graph node is dislocated and the post-dislocation row label group is set as the current first-level directed The row label group in the label information in the attribute information of the graph node, or the column label group contained in the attribute information of the first-level sub-directed graph node is misaligned and the post-dislocation column label group is set as the current first The column label group in the label information in the attribute information of the first-level directed graph node, or the misalignment of the row label group and the column label group is performed at the same time. For another example, for hierarchical formulas for intervals and cells, similar steps to those for hierarchical formulas for rows and columns can also be adopted. For the sake of brevity, the specific details will not be repeated here.

Referring back to FIG. 1, after step S107, the computer-implemented method 100 for generating spreadsheet formulas may end.

According to some embodiments of the present application, the generated spreadsheet formula for each first cell of the one or more first cells may be stored in a corresponding cell in the spreadsheet file.

For example, in the example shown in Figure 9 above, the generated spreadsheet formula strings of the three cells F10, G10, and H10 can be written into a spreadsheet file in a common format (for example, .xls or .xlsx). Format file) in the corresponding cell. In addition, if you open it with general spreadsheet processing software, you can calculate the results of these three cells F10, G10, and H10.

According to some embodiments of the present application, the step of storing the generated spreadsheet formula for each first cell of the one or more first cells in the corresponding first cell is also It may include: automatically naming a part or all of the cell names of the one or more first cells and the one or more second cells in the electronic table; and using automatically named cells The grid name is used to rewrite the spreadsheet formula and store the rewritten spreadsheet formula.

For example, when writing a spreadsheet file, you can automatically name some or all of the cells in the spreadsheet (name the cells in a file in .xls or .xlsx format), and write the spreadsheet formulas with the same meaning. For example, you can name cell C12 "average income growth rate", and rewrite the formula written in cells F10, G10, H10 as "=E$30*(1+average income growth rate)", "=F $30*(1+average income growth rate)", "=G$30*(1+average income growth rate)".

According to some embodiments of the present application, an intelligent suggestion knowledge base may be updated based on the already acquired hierarchical formula, the intelligent suggestion knowledge base including information related to the hierarchical formula or hierarchical structure; and the intelligent suggestion may be The knowledge base provides intelligent suggestions when a new level formula is about to be obtained.

For example, the knowledge base of intelligent prompts can be updated according to the content that has been entered. For example, if the user adds three rows of "mobile phone", "personal computer", and "tablet" under the block named "income", then these three terms can be added to the smart reminder knowledge base and combined with " "Income". For another example, the user creates a new table named "Income Statement" under the page named "Financial Statement" under the workbook named "Valuation Model". And add a row named "Revenue (revenue)", then, in the knowledge base of the hierarchical path, add a path such as "Valuation Model/Financial Statement/Income Statement/Revenue". Depending on the expected intelligent prompt information, the knowledge base may also include other prompt information related to the hierarchical formula and/or the hierarchical calculation graph, which is not limited in this application.

The user can be intelligently prompted according to the intelligent prompt knowledge base in the user edit level formula. For example, in the above example, after updating the knowledge base of smart tips, "mobile phone", "personal computer", and "tablet" in the knowledge base have been associated with "income". For the hierarchical formula of the line of “Income”, the user will be intelligently prompted “=SUM({phone}, {personal computer}, {tablet})" and all other hierarchical formulas with high probability for users to choose. For another example, when a user edits a level formula under a table named "SUMMARY" and wants to refer to the "income" row under the table of an "income statement", after entering "income", the level will be prompted Calculate the path of all nodes named "income" (or similar in name to "income") in the graph for the user to choose from.

According to some embodiments of the present application, users can combine atomic operators preset by the system into custom atomic operators.

The following describes the custom atomic operator with reference to Figure 12. FIG. 12 is a schematic diagram schematically showing a directed graph of a custom atomic operator according to some embodiments of the present application.

For example, the user can customize a new custom atomic operator "growth rate ()" by entering "growth rate ({x1}, {x2})={x2}/{x1}-1". According to some embodiments of the present application, the custom atomic operator "growth rate ()" can also be represented by a directed graph. For example, as shown in FIG. 12, the custom atomic operator "growth rate ()" can be represented by a directed graph 1511.

In the case of customizing a new custom atomic operator, you can use the custom atomic operator when entering the hierarchical formula used in the spreadsheet. For example, using the customized custom atomic operator "growth rate ()" above, you can enter the following hierarchical formula for spreadsheets:

"{Income growth rate} = growth rate ({income}.lag(1), {income})"

The compound operator used in the hierarchical formula of the spreadsheet can also be represented by a directed graph. For example, referring to FIG. 12, the hierarchical formula for the spreadsheet can be represented by the original directed graph 1512, where the original directed graph 1512 includes an operator 1508 and two child directed graphs with the operator 1508 as the parent node. : The first sub-directed graph "{x1}.lag(1)" 1504 and the second sub-directed graph "{x2}" 1506, the parameter placeholders "x1" and "x2" correspond to the same level of the calculation graph The node "Income". The operator 1508 is a custom atomic operator "growth rate".

If the hierarchical formula used in the spreadsheet includes custom atomic operators, you need to convert the custom atomic operators to other types of atomic operators preset by the system. For example, for each custom atomic operator, you can replace the custom atomic operator with the root node of the directed graph representing the custom atomic operator in the original directed graph of the hierarchical formula used in the spreadsheet. And replace the leaf nodes in the directed graph of the custom atomic operator with the child directed graph with the custom atomic operator as the parent node in the original directed graph of the hierarchical formula. Then, the converted directed graph of the compound operator can be used to perform the steps shown in FIG. 10.

For example, referring to Figure 12, for the custom atomic operator "growth rate" 1508 in the original directed graph 1512 of the above level formula, it can be replaced with a directed graph 1511 representing the custom atomic operator "growth rate" (In the replaced directed graph 1513, the subgraph 1503 corresponds to the subgraph 1502 of the directed graph 1511) root node 1517, and the custom atomic operator "growth rate" in the original directed graph 1512 with the hierarchical formula The first sub-directed graph "{x1}.lag(1)" 1504 of "1508 replaces the placeholder representing the leaf node "x1" in the directed graph 1511 (it becomes the sub-graph 1505 of the directed graph 1513), And use the second sub-directed graph "{x2}" 1506 of the custom atomic operator "growth rate" 1508 to replace the placeholder representing the leaf node "x2" in the directed graph 1502 (it becomes the direction of the directed graph 1513 The sub-directed graph 1507), so that the converted directed graph 1513 shown in FIG. 12 can be obtained. Then, the directed graph 1513 of the converted compound operator can be used to perform the steps shown in FIG. 10.

According to some embodiments of the present application, defects existing in the acquired hierarchy formula can be automatically detected; and debugging information can be automatically generated based on the defects and prompt the debugging information, wherein the debugging information includes errors or warnings .

The user may make different degrees of errors when entering the level formula, or the input format is not standard. In some implementations of this application, the system can automatically generate debugging information. The debugging information includes errors (Error) and warnings (Warning). Error means that the entered level formula does not conform to the grammar of the level formula, and the correct spreadsheet model cannot be generated; the warning means that the entered level formula conforms to the grammar of the level formula, but the generated spreadsheet model is likely not to meet the level formula writer’s True intentions. For example, in some implementations of this application, users are allowed to quote this row in the hierarchy formula before defining the “Revenue” row under the “Income Statement” table. This is called “undefined”. Reference" (Undefined Reference). This is just a warning message before the user finishes typing, because the user may define these temporary undefined references later. However, if these undefined references have not been defined when the user completes the input of the hierarchical formula in the entire spreadsheet model, this becomes an error. Since the debugging information is constantly changing with the user's input, the debugging information needs to be updated after the user enters a new level formula. In different implementations of this application, different types of debugging information may be included. For example, in the implementation of a financial model, the knowledge base of debugging information may include accounting equations, and if the entered hierarchical formula is inconsistent with the accounting equation, a warning message is generated. For another example, the debugging information knowledge base may include algorithms for judging and correcting error level formulas. When the wrong level formula is input, error information can be generated, and possible correction suggestions can be automatically generated. In other implementation manners of this application, more complicated debugging information may also be included, which is not limited in this application.

The generated debugging information can be prompted to the user in some form. For example, when undefined references appear in the level formula, highlight them. When the level formula is entered and the level that may match with it is defined, the number "n" is marked at the undefined reference to indicate that there are n possible matches. When selecting one of the levels, the highlighting of the undefined reference is cancelled. For another example, if "={mobile}++{personal computer}" is entered in the level formula, the error message "meaningless operator++, consider changing it to +" will be prompted. For another example, if the user enters the hierarchical formula "={income}+{cost}" in the "profit" row, the warning message "may be wrong formula, consider changing it to ={income}-{cost}".

According to some embodiments of the present application, an electronic form model may be stored, the electronic form model including one or more of the following: a hierarchical structure for the electronic form, a hierarchical calculation diagram for the electronic form, and an electronic form file .

According to some embodiments of the present application, the spreadsheet model can be imported and/or exported.

According to another aspect of the present application, an apparatus for generating an electronic form formula may be provided, including: components for executing the steps of the method as described above.

According to another aspect of the present application, there may be provided a device for generating spreadsheet formulas, including: at least one processor; and at least one storage device, the at least one storage device stores instructions, when the instructions are The execution of the at least one processor causes the at least one processor to execute the aforementioned method.

According to another aspect of the present application, a non-transitory computer-readable storage medium may be provided, which stores instructions, which when executed by a processor causes the aforementioned method to be performed.

According to another aspect of the present application, an apparatus for generating an electronic form formula can be provided. The apparatus for generating spreadsheet formulas will be described below with reference to FIG. 13. FIG. 13 is a block diagram schematically showing an apparatus 1300 for generating spreadsheet formulas according to some embodiments of the present application.

As shown in FIG. 13, the apparatus 1300 for generating an electronic form formula may include: a hierarchical formula editor 1301, the hierarchical formula editor 1301 is configured to obtain a hierarchical formula for the electronic form, the hierarchical formula includes Operators and level references, where the level references correspond to one or more nodes in one or more levels in the hierarchy of the spreadsheet, where each level has at least one node and has a corresponding level type, Each node corresponds to one or more cells in the spreadsheet, wherein the hierarchical structure further includes the membership relationship between the one or more nodes; a hierarchical formula parser 1303, the hierarchical formula parser 1303 is configured to determine the dependency relationship between the one or more nodes based on the correspondence between the hierarchical reference and the one or more nodes; the hierarchical formula parser is further configured to be based on the corresponding relationship between the one or more nodes; Operator and the dependency relationship to determine the calculation relationship between the one or more nodes; and a formula translator 1305 configured to be based at least on the hierarchical structure for the spreadsheet And the calculation relationship to generate the spreadsheet formula.

According to some embodiments of the present application, the hierarchical formula editor 1301 may include a graphical user interface editor, where the graphical user interface editor includes components for specifying nodes and/or operators at different levels, and The graphical user interface editor may also be configured to: receive input for components for specifying nodes and/or operators of different levels; and generate the level formula based on the input.

According to some embodiments of the present application, the hierarchical formula editor 1301 may include a text editor, and the text editor may be configured to: receive a text code input by a user; and parse the text code to generate the hierarchical formula .

According to some embodiments of the present application, the operator may include an atomic operator, and the atomic operator includes one or more of the following: mathematical operators, mathematical functions, constants, system-defined functions, user-defined Define atomic operators.

According to some embodiments of the present application, the hierarchical formula parser 1303 may be further configured to construct a compound operator according to the atomic operator in the hierarchical formula, wherein the compound operator includes the hierarchical The combination of all atomic operators in the formula.

According to some embodiments of the present application, the hierarchical formula parser 1303 may be further configured to determine the calculation relationship between the one or more nodes based at least on the compound operator and the dependency relationship.

According to some embodiments of the present application, the level reference may include a first level reference located on the left side of the equal sign in the level formula and a second level reference located on the right side of the equal sign in the level formula, wherein, The first-level reference corresponds to the first node in the one or more nodes, and the second-level reference corresponds to the second node in the one or more nodes.

According to some embodiments of the present application, the hierarchical formula parser 1303 may be further configured to be based at least on the correspondence between the first-level reference and the first node and the correspondence between the second-level reference and the second node. To determine the dependency between the first node and the second node.

According to some embodiments of the present application, the apparatus 1300 for generating spreadsheet formulas may further include a hierarchical calculation graph storage 1307, and the hierarchical calculation graph storage 1307 may be configured to: for each of the one or more nodes The node stores the calculation relationship between the node and other nodes via the hierarchical calculation graph.

According to some embodiments of the present application, the hierarchical formula parser 1303 may be further configured to determine the relationship between the first node and the second node based on the operator and the dependency relationship between the first node and the second node. The calculation relationship.

According to some embodiments of the present application, the hierarchical calculation graph storage 1307 may also be configured to store the calculation relationship between the first node and the second node via the hierarchical calculation graph for the first node.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: for each current node in the one or more nodes, based on the current node and other nodes in the one or more nodes The calculation relationship between nodes is used to determine each first cell in one or more first cells corresponding to the current node and each second cell in one or more second cells corresponding to other nodes. Calculation relationship between cells; and based at least on the relationship between each first cell in the one or more first cells and each second cell in the one or more second cells The calculation relationship of, generates a spreadsheet formula for each first cell of the one or more first cells.

According to some embodiments of the present application, the formula translator 1305 may also be configured to determine one or more corresponding operators of the current node based at least on the operator corresponding to the current node among the one or more nodes. The operator corresponding to each first cell in the first cell; and at least based on the dependency relationship between the current node and other nodes in the one or more nodes, determine the operator corresponding to the current node The dependency relationship between each first cell in the one or more first cells and each second cell in the one or more second cells corresponding to other nodes.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: at least be based on the operator corresponding to each of the one or more first cells corresponding to the current node, And the dependency relationship between each first cell in one or more first cells corresponding to the current node and each second cell in one or more second cells corresponding to other nodes To generate a spreadsheet formula for each of the one or more first cells.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: the operator corresponding to the current node in the one or more nodes is the same as that used in the hierarchical structure of the spreadsheet The first-level compound operator corresponding to one of the one or more nodes, the first-level compound operator includes one or more first-level atomic operators; in the one or more first cells The operator corresponding to each first cell of is a second-level compound operator corresponding to one of the one or more cells in the spreadsheet, and the second-level compound operator includes One or more second-level atomic operators; and determining one or more first units corresponding to the current node based at least on the first-level compound operator corresponding to the current node in the one or more nodes The second-level compound operator corresponding to each first cell in the grid.

According to some embodiments of the present application, the formula translator 1305 may also be configured as: the first-level compound operator is stored in a first-level directed graph, and each directed graph node in the first-level directed graph represents Each first-level atomic operator in the first-level compound operator, and the directed edges between each directed graph node in the first-level directed graph represent each first-level atom in the first-level compound operator The combination relationship between operators; the second-level compound operator is stored in the second-level directed graph, and each directed graph node in the second-level directed graph represents each second-level in the second-level compound operator Atomic operators, and the directed edges between each directed graph node in the second-level directed graph represent the combination relationship between each second-level atomic operator in the second-level compound operator; and through traversal and The first-level directed graph corresponding to the first-level compound operator determines the second-level directed graph, and the second-level compound operator is determined according to the second-level directed graph.

According to some embodiments of the present application, the formula translator 1305 may also be configured to traverse the first-level directed graph in the order of post-order traversal, so as to first traverse the sub-directed graphs in the first-level directed graph. Node, and then traverse the parent directed graph node in the first level directed graph.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: traverse to the current first-level directed graph node among one or more first-level directed graph nodes in the first-level directed graph. In the case of a graph node, the current first level is determined according to the first level atomic operator represented by the current first level directed graph node and the attribute information of the first level child directed graph node of the current first level directed graph node The attribute information of the directed graph node, where the attribute information of each first-level directed graph node includes one or more of the following: the location information of the cell in the spreadsheet, and the cell in the spreadsheet The label information corresponding to the cell and the location information of the cell in the spreadsheet, the label information corresponding to the cell in the spreadsheet and the middle-level directed graph node, and the middle-level corresponding to the cell in the spreadsheet has Nodes in a directed graph; determine the middle-level directed graph based on the attribute information of each first-level directed graph node in the one or more first-level directed graph nodes in the first-level directed graph Each intermediate-level directed graph node set determines that each intermediate level in the intermediate-level directed graph has a dependency relationship between the one or more first-level directed graph nodes in the first-level directed graph. The dependency relationship between each intermediate-level directed graph node in the set of directed graph nodes and each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph.

According to some embodiments of the present application, the first-level atomic operators are classified into one of element-wise atomic operators, dimensionality reduction atomic operators, misplaced atomic operators, and user-defined atomic operators.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is When an element-wise atomic operator is used, the following operations are performed:

If the attribute information of each first-level sub-directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, then the attribute information of each first-level sub-directed graph node The intersection of the label information contained in the attribute information sets the label information in the attribute information of the current first-level directed graph node, and sets the current first-level atomic operator represented by the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the first-level directed graph node is determined to be related to the current first-level based on the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The current intermediate-level directed graph node set corresponding to the directed graph node, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes and according to the current first-level directed graph node The label information in the attribute information of the graph node and its first-level child directed graph node is used to determine each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship with each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph;

If the attribute information of each first-level child directed graph node of the current first-level directed graph node does not contain label information, then the attribute information of the current first-level directed graph node does not include label information, according to The first-level atomic operator represented by the current first-level directed graph node sets the intermediate-level atomic operator in the attribute information of the current first-level directed graph node, at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the current first-level directed graph node is used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level The dependency relationship between the sub-directed graph nodes is used to determine the current intermediate-level directed graph node corresponding to the current first-level directed graph node in each intermediate-level directed graph node and the intermediate-level directed graph. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes;

If the attribute information of a part of the current first-level directed graph node of the first-level child directed graph node contains the label information corresponding to the cell in the spreadsheet and the other part of the current first-level directed graph node is the first If the attribute information of the first-level child directed graph node does not contain label information, the current first-level directed graph node is set according to the intersection of the label information contained in the attribute information of the first-level child directed graph node containing the label information According to the label information in the attribute information of the current first-level directed graph node, the middle-level atomic operator in the attribute information of the current first-level directed graph node is set according to the first-level atomic operator represented by the current first-level directed graph node. The label information and intermediate atomic operators in the attribute information of the current first-level directed graph node are used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current The dependency relationship between the first-level directed graph node and its first-level child directed graph node is determined according to the label information in the attribute information of the current first-level directed graph node and its first-level child directed graph node Each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node and each intermediate-level directed graph node set in the intermediate-level directed graph The dependency relationship between the nodes of the hierarchical directed graph.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is When reducing dimensionality atomic operators, perform the following operations:

So that the attribute information of the current first-level directed graph node does not contain label information or includes a subset of the label information in the attribute information of the first-level child directed graph node of the current first-level directed graph node, Set the intermediate-level atomic operator in the attribute information of the current first-level directed graph node at least according to the first-level atomic operator represented by the current first-level directed graph node, and at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level directed graph node The dependency relationship between the first-level sub-directed graph nodes is used to determine each intermediate-level directed graph node and the intermediate-level directed graph in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is When misplaced atomic operators, do the following:

In the case that the attribute information of the first-level sub-directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, according to the attributes of the first-level sub-directed graph node The post-dislocation label information obtained after misalignment of the label information contained in the information sets the label information in the attribute information of the current first-level directed graph node, and sets the "equivalence" atomic operator to the current first-level The intermediate-level atomic operator in the attribute information of the directed graph node is determined to be relative to the current first-level directed graph node according to the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The corresponding set of current intermediate-level directed graph nodes, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node and its first level The label information in the attribute information of the first-level sub-directed graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the directed graph.

According to some embodiments of the present application, the formula translator 1305 may also be configured to extract from the intermediate-level directed graph to each intermediate-level directed graph root node in the set of intermediate-level directed graph root nodes. It is the sub-directed graph of the root node, and the extracted sub-directed graph is used as the second-level directed graph to determine the second-level compound operator according to the second-level directed graph.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: combine the label information in the attribute information of the root node of each intermediate-level directed graph with the attribute information of the left-value node of each intermediate-level directed graph. The label information in the middle-level directed graph is matched, and the position of each intermediate-level directed graph root node in the intermediate-level directed graph root node set is matched with the position of each intermediate-level directed graph left-value node in the intermediate-level directed graph left-value node set Position correspondence; and extracting the sub-directed graph with the root node of the intermediate-level directed graph at the corresponding matching position as the root node as the second-level directed graph to determine the intermediate-level left value according to the second-level directed graph The second level compound operator of the cell corresponding to the node.

According to some embodiments of the present application, the apparatus 1300 for generating an electronic form formula may further include an electronic form formula writer 1309, and the electronic form formula writer 1309 may be configured to use the generated formula for the The spreadsheet formula of each of the one or more first cells is stored in the corresponding cell in the spreadsheet file.

According to some embodiments of the present application, the custom atomic operator may be defined by combining the atomic operators preset by the system.

According to some embodiments of the present application, the formula translator 1305 may be further configured to convert the custom atomic operator when the custom atomic operator is included in the hierarchical formula used in the spreadsheet. Atomic operator preset for the system.

According to some embodiments of the present application, the formula translator 1305 may also be configured to: replace the custom atomic operator in the original directed graph of the hierarchical formula with a directed The root node of the graph; and the child directed graph with the custom atomic operator as the parent node in the original directed graph of the hierarchical formula is used to replace the leaf nodes in the directed graph of the custom atomic operator.

According to some embodiments of the present application, the apparatus 1300 for generating an electronic form formula may further include an intelligent suggestion module 1311, and the intelligent suggestion module 1311 may be configured to update the intelligent suggestion knowledge base based on the obtained hierarchical formula The intelligent suggestion knowledge base includes information related to the hierarchical formula or hierarchical structure; and based on the intelligent suggestion knowledge base, intelligent suggestions are made when a new hierarchical formula is about to be obtained.

According to some embodiments of the present application, the apparatus 1300 for generating an electronic form formula may further include a defect detection module 1313, and the defect detection module 1313 may be configured to automatically detect defects existing in the acquired hierarchical formula; And automatically generate debugging information based on the defect and prompt the debugging information, wherein the debugging information includes errors or warnings.

According to some embodiments of the present application, the apparatus 1300 for generating spreadsheet formulas may further include a spreadsheet model storage module 1315, and the spreadsheet model storage module 1315 may be configured to store a spreadsheet model, the spreadsheet model including One or more of the following: hierarchical structure for spreadsheets, hierarchical calculation diagrams for spreadsheets, and spreadsheet files.

According to some embodiments of the present application, the apparatus 1300 for generating spreadsheet formulas may further include a spreadsheet model import/export module 1317, and the spreadsheet model import/export module 1317 may be configured to import and/or export the spreadsheet model.

According to some embodiments of the present application, the text editor may be configured to: perform word segmentation on the text code to obtain a word segmentation stream; identify the word segmentation related to the operator in the word segmentation stream to determine the operation Identify the word segmentation related to the one or more nodes in the one or more levels in the hierarchy structure of the spreadsheet in the word segmentation stream to determine the level reference; and according to the determined Operators and hierarchical references are used to generate the hierarchical formula.

According to some embodiments of the present application, the compound operator may use one or more of the following items to store: a character string; a computer-implemented function pointed to by a function pointer; and a directed graph.

According to some embodiments of the present application, each node in the directed graph may represent the operator in the hierarchical formula, and the directed edge between each node in the directed graph may represent the The combination relationship between the operators in the hierarchy formula.

According to some embodiments of the present application, the spreadsheet formula writer 1309 may also be configured to: compare the one or more first cells and the one or more second cells in the spreadsheet Part or all of the cell names in the grid are automatically named; and the automatically named cell names are used to rewrite the spreadsheet formula and store the rewritten spreadsheet formula.

Note that the hierarchical calculation graph memory 1307, the spreadsheet formula writer 1309, the smart suggestion module 1311, the defect detection module 1313, the spreadsheet model storage module 1315, and the spreadsheet model import/export module 1317 in Figure 13 are optional, so The box is a dashed line.

Note that for the specific details of the apparatus 1300 for generating electronic form formulas, reference may be made to the above detailed description of the computer-implemented method for generating electronic form formulas, and the specific content is not repeated here.

This application supports inputting calculation relationships between levels in an electronic form model in the form of level formulas, and generating electronic form formulas in batches based on them, which has the advantages of at least one of intuitive, automatic, reusable, and less error-prone. The lvalues and parameters used in the level formula are all levels of the spreadsheet. The level reference has clear semantics. The meaning of the level can be intuitively seen through the name of the level reference. Therefore, the level formula is more intuitive than the formula in the spreadsheet format. Hierarchical formulas can automatically generate spreadsheet formulas in batches. In some implementations, even hierarchical formulas can be automatically generated or prompted to users, so this method is automatic and intelligent. Since the hierarchical formulas have clear semantics and these semantics are relatively fixed, the hierarchical formulas can be reused, and the hierarchical formulas in one spreadsheet model can be reused to other spreadsheet models without logic errors. This application may also include a debugging function, which can identify possible errors in the electronic form model and provide corresponding debugging information. Therefore, it is not easy to make mistakes in the electronic form formula generated by this application.

Fig. 14 is a schematic block diagram showing an information processing device that can be used to implement an electronic form formula according to some embodiments of the present application.

In FIG. 14, a central processing unit (CPU) 1401 performs various processes in accordance with a program stored in a read only memory (ROM) 1402 or a program loaded from a storage portion 1408 to a random access memory (RAM) 1403. In the RAM 1403, data required when the CPU 1401 executes various processes and the like is also stored as needed. The CPU 1401, the ROM 1402, and the RAM 1403 are connected to each other via a bus 1404. The input/output interface 1405 is also connected to the bus 1404.

The following components are connected to the input/output interface 1405: input part 1406 (including keyboard, mouse, etc.), output part 1407 (including display, such as cathode ray tube (CRT), liquid crystal display (LCD), etc., and speakers, etc.), Storage part 1408 (including hard disk, etc.), communication part 1409 (including network interface card such as LAN card, modem, etc.). The communication section 1409 performs communication processing via a network such as the Internet. The driver 1410 can also be connected to the input/output interface 1405 according to needs. Removable media 1411 such as magnetic disks, optical disks, magneto-optical disks, semiconductor memories, etc. are mounted on the drive 1410 as needed, so that the computer programs read from them are installed into the storage portion 1408 as needed.

In the case of implementing the above-mentioned series of processing by software, a program constituting the software is installed from a network such as the Internet or a storage medium such as a removable medium 1411.

Those skilled in the art should understand that this storage medium is not limited to the removable medium 1411 shown in FIG. 14 where the program is stored and distributed separately from the device to provide the program to the user. Examples of removable media 1411 include magnetic disks (including floppy disks (registered trademarks)), optical disks (including compact disk read-only memory (CD-ROM) and digital versatile disks (DVD)), magneto-optical disks (including mini disks (MD) (registered trademarks) )) and semiconductor memory. Alternatively, the storage medium may be a ROM 1402, a hard disk included in the storage portion 1408, etc., in which programs are stored and distributed to users together with the devices containing them.

When the instruction code is read and executed by a machine, the above-mentioned method according to the embodiment of the present application can be executed.

The computer program code used to perform the operations of the various aspects of the application can be written in any combination of one or more programming languages. The programming languages include object-oriented programming languages—such as Java, Smalltalk, C++, etc., Also includes conventional procedural programming languages-such as "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partly on the user's computer, executed as an independent software package, partly on the user's computer and partly executed on a remote computer, or entirely executed on the remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computer (for example, using an Internet service provider to pass Internet connection).

It should be understood that each block of the flowchart and/or block diagram and the combination of each block in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to the processors of general-purpose computers, special-purpose computers, or other programmable data processing devices, thereby producing a machine that makes these computer program instructions when executed by the processors of the computer or other programmable data processing devices , A device that implements the functions/actions specified in one or more blocks in the flowcharts and/or block diagrams is produced.

It is also possible to store these computer program instructions in a computer-readable medium. These instructions make computers, other programmable data processing devices, or other devices work in a specific manner, so that the instructions stored in the computer-readable medium generate An article of manufacture that implements instructions for the functions/actions specified in one or more blocks in the flowchart and/or block diagram.

It is also possible to load computer program instructions onto a computer, other programmable data processing device, or other equipment, so that a series of operation steps are executed on the computer, other programmable data processing device, or other equipment to produce a computer-implemented process, thereby The instructions executed on the computer or other programmable device can provide a process for realizing the functions/operations specified in the blocks in the flowcharts and/or block diagrams.

The flowcharts and block diagrams in the accompanying drawings show the possible implementation architecture, functions, and operations of the system, method, and computer program product according to multiple embodiments of the present application. In this regard, each block in the flowchart or block diagram may represent a module, program segment, or part of the code, and the module, program segment, or part of the code contains one or more functions for realizing the specified logic function. Executable instructions. It should also be noted that, in some alternative implementations, the functions marked in the block may also occur in a different order from the order marked in the drawings. For example, two consecutive blocks can actually be executed substantially in parallel, or they can sometimes be executed in the reverse order, depending on the functions involved. It should also be noted that each block in the block diagram and/or flowchart, and the combination of the blocks in the block diagram and/or flowchart, can be implemented by a dedicated hardware-based system that performs the specified functions or actions Or it can be realized by a combination of dedicated hardware and computer instructions.

Note that in order to avoid obscuring the concept of this application, some details that are well known in the art are not described. Based on the above description, those skilled in the art can fully understand how to implement the technical solutions disclosed herein.

This application can also be configured as follows:

(1) A computer-implemented method for generating spreadsheet formulas, the method comprising:

Acquire a hierarchical formula for the electronic form, the hierarchical formula including an operator and a hierarchical reference, wherein the hierarchical reference corresponds to one or more nodes in one or more levels in the hierarchical structure of the electronic form , Wherein each level has at least one node and has a corresponding level type, and each node corresponds to one or more cells in the spreadsheet, wherein the level structure further includes the one or more nodes Affiliation;

Determine the dependency relationship between the one or more nodes based on the correspondence relationship between the hierarchical reference and the one or more nodes;

Determining the calculation relationship between the one or more nodes based on the operator and the dependency relationship; and

The spreadsheet formula is generated based at least on the hierarchical structure and the calculation relationship for the spreadsheet.

(2) The method according to (1), wherein the step of obtaining the hierarchical formula for the electronic form includes:

Provide a graphical user interface editor, wherein the graphical user interface editor includes components for specifying nodes and/or operators at different levels;

Receive input for components used to specify nodes and/or operators at different levels; and

The hierarchical formula is generated based on the input.

(3) The method according to (1), wherein the step of obtaining a hierarchical formula for the electronic form includes:

Receive the text code entered by the user; and

The text code is parsed to generate the hierarchical formula.

(4) The method according to (1), wherein the operators include atomic operators, and the atomic operators include one or more of the following: mathematical operators, mathematical functions, constants, systems Define functions and user-defined atomic operators.

(5) The method according to (4), further including:

A compound operator is constructed according to the atomic operator in the hierarchical formula, wherein the compound operator includes a combination of all the atomic operators in the hierarchical formula.

(6) The method according to (5), wherein the step of determining the calculation relationship between the one or more nodes based on the operator and the dependency relationship further includes:

The calculation relationship between the one or more nodes is determined based on at least the compound operator and the dependency relationship.

(7) The method according to any one of (1) to (6), wherein the level reference includes the first level reference located to the left of the equal sign in the level formula and the first level reference located in the level formula The second-level reference on the right side of the equal sign of, where the first-level reference corresponds to the first of the one or more nodes, and the second-level reference corresponds to the second of the one or more nodes node.

(8) The method according to (7), wherein the step of determining the dependency relationship between the one or more nodes based on the correspondence relationship between the hierarchical reference and the one or more nodes include:

The dependency relationship between the first node and the second node is determined based at least on the correspondence between the first-level reference and the first node and the correspondence between the second-level reference and the second node.

(9) The method according to any one of (1) to (6), further comprising:

For each node of the one or more nodes, the calculation relationship between the node and other nodes is stored via a hierarchical calculation graph.

(10) The method according to (8), wherein the determining the calculation relationship between the one or more nodes based on the operator and the dependency relationship includes:

The calculation relationship between the first node and the second node is determined based on the operator and the dependency relationship between the first node and the second node.

(11) The method according to (10), further comprising:

For the first node, the calculation relationship between the first node and the second node is stored via the hierarchical calculation graph.

(12) The method according to any one of (1) to (6), wherein the generating the spreadsheet formula based at least on the hierarchical structure for the spreadsheet and the calculation relationship includes :

For each current node in the one or more nodes, one or more first nodes corresponding to the current node are determined based on the calculation relationship between the current node and other nodes in the one or more nodes. The calculation relationship between each first cell in the cell and each second cell in the one or more second cells corresponding to other nodes; and

Based on at least the calculated relationship between each first cell in the one or more first cells and each second cell in the one or more second cells, the The spreadsheet formula for each of the one or more first cells.

(13) The method according to (12), wherein the determining that each of the one or more first cells corresponding to the current node corresponds to one or more first cells corresponding to other nodes The steps of calculating the relationship between each second cell in the second cell include:

Determine the operator corresponding to each first cell in the one or more first cells corresponding to the current node based at least on the operator corresponding to the current node in the one or more nodes; and

At least based on the dependency relationship between the current node and other nodes in the one or more nodes, it is determined that each first cell of the one or more first cells corresponding to the current node is connected to other nodes. Corresponding to the dependency relationship between each second cell in one or more second cells.

(14) The method according to (13), wherein the step of generating a spreadsheet formula for each first cell of the one or more first cells includes:

At least based on the operator corresponding to each first cell in the one or more first cells corresponding to the current node, and each first cell in the one or more first cells corresponding to the current node The dependency relationship between a cell and each second cell in one or more second cells corresponding to other nodes is generated for each first cell in the one or more first cells Spreadsheet formula for the cell.

(15) The method according to (14), wherein:

The operator corresponding to the current node in the one or more nodes is a first-level compound operator corresponding to one of the one or more nodes in the hierarchical structure of the spreadsheet , The first-level compound operator includes one or more first-level atomic operators;

The operator corresponding to each first cell in the one or more first cells is the second level corresponding to one cell in the one or more cells in the spreadsheet Compound operators, the second-level compound operators include one or more second-level atomic operators; and

Based on at least the first-level compound operator corresponding to the current node in the one or more nodes, determine the corresponding one of the one or more first cells corresponding to the current node The second level compound operator.

(16) The method according to (15), wherein

The first-level compound operator uses the first-level directed graph for storage. Each directed graph node in the first-level directed graph represents each first-level atomic operator in the first-level compound operator, and the first-level The directed edges between each directed graph node in the directed graph represent the combination relationship between each first-level atomic operator in the first-level compound operator;

The second-level compound operator uses a second-level directed graph for storage. Each directed graph node in the second-level directed graph represents each second-level atomic operator in the second-level compound operator, and the second-level The directed edges between each directed graph node in the directed graph represent the combination relationship between each second-level atomic operator in the second-level compound operator; and

The second-level directed graph is determined by traversing the first-level directed graph corresponding to the first-level compound operator, and the second-level compound operator is determined according to the second-level directed graph.

(17) The method according to (16), wherein the determining the second-level directed graph by traversing the first-level directed graph corresponding to the first-level compound operator includes:

Traverse the first-level directed graph in the order of post-order traversal, so that the child directed graph nodes in the first-level directed graph are traversed first, and then the parent directed graph nodes in the first-level directed graph are traversed.

(18) The method according to (17), further comprising:

When traversing to the current first-level directed graph node in one or more first-level directed graph nodes in the first-level directed graph, according to the first-level atom represented by the current first-level directed graph node Operator and the attribute information of the first-level child directed graph node of the current first-level directed graph node to determine the attribute information of the current first-level directed graph node. The attribute information includes one or more of the following items: the location information of the cells in the spreadsheet, the label information corresponding to the cells in the spreadsheet, and the location information of the cells in the spreadsheet, and the location information of the cells in the spreadsheet. Label information and intermediate nodes corresponding to the cells in, and intermediate nodes corresponding to the cells in the spreadsheet, wherein the intermediate nodes are used to store intermediate calculation results;

According to the attribute information of each first-level directed graph node in the one or more first-level directed graph nodes in the first-level directed graph, each intermediate-level directed graph in the intermediate-level directed graph is determined The graph node set is determined according to the dependency relationship between the one or more first-level directed graph nodes in the first-level directed graph in each intermediate-level directed graph node set in the intermediate-level directed graph The dependency between each intermediate-level directed graph node in the intermediate-level directed graph and each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph.

(19) The method according to (18), wherein the first-level atomic operators are divided into one of element-wise atomic operators, dimensionality reduction atomic operators, misplaced atomic operators, and user-defined atomic operators. Kind.

(20) The method according to (19), wherein, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is an element-wise atomic operator ,

If the attribute information of each first-level sub-directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, then the attribute information of each first-level sub-directed graph node The intersection of the label information contained in the attribute information sets the label information in the attribute information of the current first-level directed graph node, and sets the current first-level atomic operator represented by the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the first-level directed graph node is determined to be related to the current first-level based on the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The current intermediate-level directed graph node set corresponding to the directed graph node, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node The label information in the attribute information of the graph node and its first-level child directed graph node is used to determine each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph;

If the attribute information of each first-level child directed graph node of the current first-level directed graph node does not contain label information, then the attribute information of the current first-level directed graph node does not include label information, according to The first-level atomic operator represented by the current first-level directed graph node sets the intermediate-level atomic operator in the attribute information of the current first-level directed graph node, at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the current first-level directed graph node is used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level The dependency relationship between the sub-directed graph nodes is used to determine the current intermediate-level directed graph node corresponding to the current first-level directed graph node in each intermediate-level directed graph node and the intermediate-level directed graph. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes;

If the attribute information of a part of the current first-level directed graph node of the first-level child directed graph node contains the label information corresponding to the cell in the spreadsheet and the other part of the current first-level directed graph node is the first If the attribute information of the first-level child directed graph node does not contain label information, the current first-level directed graph node is set according to the intersection of the label information contained in the attribute information of the first-level child directed graph node containing the label information According to the label information in the attribute information of the current first-level directed graph node, the intermediate-level atomic operator in the attribute information of the current first-level directed graph node is set according to the first-level atomic operator represented by the current first-level directed graph node. The label information and intermediate atomic operators in the attribute information of the current first-level directed graph node are used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current The dependency relationship between the first-level directed graph node and its first-level child directed graph node is determined according to the label information in the attribute information of the current first-level directed graph node and its first-level child directed graph node Each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node and each intermediate-level directed graph node set in the intermediate-level directed graph The dependency relationship between the nodes of the hierarchical directed graph.

(21) The method according to (19), wherein, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is a dimensionality reduction atomic operator ,

So that the attribute information of the current first-level directed graph node does not contain label information or includes a subset of the label information in the attribute information of the first-level child directed graph node of the current first-level directed graph node, Set the intermediate-level atomic operator in the attribute information of the current first-level directed graph node at least according to the first-level atomic operator represented by the current first-level directed graph node, and at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level directed graph node The dependency relationship between the first-level sub-directed graph nodes is used to determine each intermediate-level directed graph node and the intermediate-level directed graph in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in.

(22) The method according to (19), wherein, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is a misplaced atomic operator,

In the case that the attribute information of the first-level child directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, the attribute information of the first-level child directed graph node The label information contained in the information is set to the label information in the attribute information of the current first-level directed graph node, and the “equal” atomic operator is set to the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the directed graph node is determined to be relative to the current first-level directed graph node according to the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The corresponding set of current intermediate-level directed graph nodes, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node and its first level The label information in the attribute information of the first-level sub-directed graph node is used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the directed graph.

(23) The method according to any one of (18) to (22), further comprising:

Extract the sub-directed graphs with each intermediate-level directed graph root node in the set of intermediate-level directed graph root nodes as the root node from the intermediate-level directed graph, and use the extracted sub-directed graph as the first The second-level directed graph is used to determine the second-level compound operator based on the second-level directed graph.

(24) The method according to (23), wherein the step of extracting includes:

By matching the label information in the attribute information of the root node of each intermediate-level directed graph with the label information in the attribute information of the left-value node of each intermediate-level directed graph, each intermediate-level directed graph root node set The position of the root node of the level directed graph corresponds to the position of the left value node of each intermediate level directed graph in the set of left value nodes of the intermediate level directed graph; and

The sub-directed graph with the root node of the intermediate-level directed graph at the corresponding matching position as the root node is extracted as the second-level directed graph to determine the cell corresponding to the intermediate-level lvalue node according to the second-level directed graph The second-level compound operator.

(25) The method according to (12), further comprising:

The generated spreadsheet formula for each first cell of the one or more first cells is stored in a corresponding cell in the spreadsheet file.

(26) The method according to (4), wherein:

The custom atomic operator is defined by combining the atomic operators preset by the system.

(27) The method according to (26), wherein:

In the case that the custom atomic operator is included in the hierarchical formula used in the spreadsheet, the custom atomic operator is converted into a system preset atomic operator.

(28) The method according to (27), wherein the step of unfolding includes:

Replacing the custom atomic operator in the original directed graph of the hierarchical formula with the root node of the directed graph representing the custom atomic operator; and

Replace the leaf nodes in the directed graph of the custom atomic operator with the child directed graph in the original directed graph of the hierarchical formula with the custom atomic operator as the parent node.

(29) The method according to (1), further comprising:

Updating the knowledge base of intelligent suggestions based on the obtained hierarchy formula, the knowledge base of intelligent suggestions including information related to the hierarchy formula or hierarchy structure; and

Based on the intelligent suggestion knowledge base, intelligent suggestions are made when a new level formula is about to be obtained.

(30) The method according to (1), further including:

Automatically detect defects in the obtained hierarchy formula; and

Automatically generate debugging information based on the defect and prompt the debugging information,

Wherein, the debugging information includes errors or warnings.

(31) The method according to (1), further comprising:

An electronic form model is stored, and the electronic form model includes one or more of the following: a hierarchical structure for the electronic form, a hierarchical calculation diagram for the electronic form, and an electronic form file.

(32) The method according to (31), further comprising:

Import and/or export the spreadsheet model.

(33) The method according to (3), wherein the step of parsing the text code to generate the hierarchical formula includes:

Perform word segmentation on the text code to obtain a word stream;

Identifying the word segmentation related to the operator in the word segmentation stream to determine the operator;

Identifying the word segmentation related to the one or more nodes in the one or more levels in the hierarchical structure of the spreadsheet in the word segmentation stream to determine the level reference; and

The hierarchical formula is generated according to the determined operator and hierarchical reference.

(34) The method according to (5), wherein the compound operator adopts one or more of the following items to store:

String

The computer-implemented function pointed to by the function pointer; and

Directed graph.

(35) The method according to (34), wherein each node in the directed graph represents the operator in the hierarchical formula, and the directed graph between each node in the directed graph The edges represent the combination relationship between the operators in the hierarchical formula.

(36) The method according to (25), wherein the generated spreadsheet formula for each first cell of the one or more first cells is stored in the corresponding first cell. The steps in the cell also include:

Automatically naming a part or all of the cell names of the one or more first cells and the one or more second cells in the electronic table; and

Utilize automatically named cell names to rewrite the spreadsheet formula and store the rewritten spreadsheet formula.

(37) A device for generating spreadsheet formulas, including: components for performing the steps of the method described in any one of (1) to (36).

(38) A device for generating spreadsheet formulas, including:

At least one processor; and

At least one storage device, the at least one storage device stores instructions, and when the instructions are executed by the at least one processor, the at least one processor executes the instructions as described in any one of (1)-(36) The method described.

(39) A non-transitory computer-readable storage medium storing instructions that, when executed by a processor, cause the method described in any one of (1) to (36) to be performed.

(40) A device for generating an electronic form formula, the device comprising:

A hierarchical formula editor configured to obtain a hierarchical formula for the electronic form, the hierarchical formula including an operator and a hierarchical reference, wherein the hierarchical reference corresponds to a hierarchical structure for the electronic form One or more nodes in one or more levels in each level, where each level has at least one node and has a corresponding level type, and each node corresponds to one or more cells in the spreadsheet, where all The hierarchical structure also includes the affiliation relationship between the one or more nodes;

A hierarchical formula parser, the hierarchical formula parser is configured to determine the dependency relationship between the one or more nodes based on the correspondence between the hierarchical reference and the one or more nodes; the hierarchy The formula parser is further configured to determine the calculation relationship between the one or more nodes based on the operator and the dependency relationship; and

A formula translator configured to generate the spreadsheet formula based on at least the hierarchical structure and the calculation relationship for the spreadsheet.

(41) The device according to (40), wherein the hierarchical formula editor includes a graphical user interface editor, wherein the graphical user interface editor includes components for specifying nodes and/or operators of different levels , And wherein the graphical user interface editor is further configured to:

Receive input for components used to specify nodes and/or operators at different levels; and

The hierarchical formula is generated based on the input.

(42) The device according to (40), wherein the hierarchical formula editor includes a text editor, and the text editor is configured to:

Receive the text code entered by the user; and

The text code is parsed to generate the hierarchical formula.

(43) The device according to (40), wherein the operator includes an atomic operator, and the atomic operator includes one or more of the following: mathematical operator, mathematical function, constant, system Define functions and user-defined atomic operators.

(44) The device according to (43), wherein the hierarchical formula parser is further configured to:

A compound operator is constructed according to the atomic operator in the hierarchical formula, wherein the compound operator includes a combination of all the atomic operators in the hierarchical formula.

(45) The device according to (44), wherein the hierarchical formula parser is further configured to:

The calculation relationship between the one or more nodes is determined based on at least the compound operator and the dependency relationship.

(46) The device according to any one of (40) to (45), wherein the level reference includes the first level reference located to the left of the equal sign in the level formula and the first level reference located in the level formula The second-level reference on the right side of the equal sign of, where the first-level reference corresponds to the first of the one or more nodes, and the second-level reference corresponds to the second of the one or more nodes node.

(47) The device according to (46), wherein the hierarchical formula parser is further configured to:

The dependency relationship between the first node and the second node is determined based at least on the correspondence between the first-level reference and the first node and the correspondence between the second-level reference and the second node.

(48) The device according to any one of (40) to (45), further comprising a hierarchical calculation graph memory, and the hierarchical calculation graph memory is configured to:

For each node of the one or more nodes, the calculation relationship between the node and other nodes is stored via a hierarchical calculation graph.

(49) The device according to (48), wherein the hierarchical formula parser is further configured to:

The calculation relationship between the first node and the second node is determined based on the operator and the dependency relationship between the first node and the second node.

(50) The device according to (49), further comprising a hierarchical calculation graph memory, and the hierarchical calculation graph memory is configured to:

For the first node, the calculation relationship between the first node and the second node is stored via the hierarchical calculation graph.

(51) The device according to any one of (40) to (45), wherein the formula translator is further configured to:

For each current node in the one or more nodes, one or more first nodes corresponding to the current node are determined based on the calculation relationship between the current node and other nodes in the one or more nodes. The calculation relationship between each first cell in the cell and each second cell in the one or more second cells corresponding to other nodes; and

Based on at least the calculated relationship between each first cell in the one or more first cells and each second cell in the one or more second cells, the The spreadsheet formula for each of the one or more first cells.

(52) The device according to (51), wherein the formula translator is further configured to:

Determine the operator corresponding to each first cell in the one or more first cells corresponding to the current node based at least on the operator corresponding to the current node in the one or more nodes; and

At least based on the dependency relationship between the current node and other nodes in the one or more nodes, it is determined that each first cell of the one or more first cells corresponding to the current node is connected to other nodes. Corresponding to the dependency relationship between each second cell in one or more second cells.

(53) The device according to (52), wherein the formula translator is further configured to:

At least based on the operator corresponding to each first cell in the one or more first cells corresponding to the current node, and each first cell in the one or more first cells corresponding to the current node The dependency relationship between a cell and each second cell in one or more second cells corresponding to other nodes is generated for each first cell in the one or more first cells Spreadsheet formula for the cell.

(54) The device according to (53), wherein the formula translator is further configured to:

The operator corresponding to the current node in the one or more nodes is a first-level compound operator corresponding to one of the one or more nodes in the hierarchical structure of the spreadsheet , The first-level compound operator includes one or more first-level atomic operators;

The operator corresponding to each first cell in the one or more first cells is the second level corresponding to one cell in the one or more cells in the spreadsheet Compound operators, the second-level compound operators include one or more second-level atomic operators; and

Based on at least the first-level compound operator corresponding to the current node in the one or more nodes, determine the corresponding one of the one or more first cells corresponding to the current node The second level compound operator.

(55) The device according to (54), wherein the formula translator is further configured to:

The first-level compound operator uses the first-level directed graph for storage. Each directed graph node in the first-level directed graph represents each first-level atomic operator in the first-level compound operator, and the first-level The directed edges between each directed graph node in the directed graph represent the combination relationship between each first-level atomic operator in the first-level compound operator;

The second-level compound operator uses a second-level directed graph for storage. Each directed graph node in the second-level directed graph represents each second-level atomic operator in the second-level compound operator, and the second-level The directed edges between each directed graph node in the directed graph represent the combination relationship between each second-level atomic operator in the second-level compound operator; and

The second-level directed graph is determined by traversing the first-level directed graph corresponding to the first-level compound operator, and the second-level compound operator is determined according to the second-level directed graph.

(56) The device according to (55), wherein the formula translator is further configured to:

Traverse the first-level directed graph in the order of post-order traversal, so that the child directed graph nodes in the first-level directed graph are traversed first, and then the parent directed graph nodes in the first-level directed graph are traversed.

(57) The device according to (56), wherein the formula translator is further configured to:

When traversing to the current first-level directed graph node in one or more first-level directed graph nodes in the first-level directed graph, according to the first-level atom represented by the current first-level directed graph node Operator and the attribute information of the first-level child directed graph node of the current first-level directed graph node to determine the attribute information of the current first-level directed graph node. The attribute information includes one or more of the following items: the location information of the cells in the spreadsheet, the label information corresponding to the cells in the spreadsheet, and the location information of the cells in the spreadsheet, and the location information of the cells in the spreadsheet. Label information and intermediate nodes corresponding to the cells in, and intermediate nodes corresponding to the cells in the spreadsheet, wherein the intermediate nodes are used to store intermediate calculation results;

According to the attribute information of each first-level directed graph node in the one or more first-level directed graph nodes in the first-level directed graph, each intermediate-level directed graph in the intermediate-level directed graph is determined The graph node set is determined according to the dependency relationship between the one or more first-level directed graph nodes in the first-level directed graph in each intermediate-level directed graph node set in the intermediate-level directed graph The dependency between each intermediate-level directed graph node in the intermediate-level directed graph and each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph.

(58) The device according to (57), wherein the first-level atomic operators are divided into one of element-wise atomic operators, dimensionality reduction atomic operators, misplaced atomic operators, and user-defined atomic operators. Kind.

(59) The device according to (58), wherein the formula translator is further configured to: when traversed to the first-level directed graph, the current first-level directed graph node represents the first level When the atomic operator is an element-wise atomic operator,

If the attribute information of each first-level sub-directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, then the attribute information of each first-level sub-directed graph node The intersection of the label information contained in the attribute information sets the label information in the attribute information of the current first-level directed graph node, and sets the current first-level atomic operator represented by the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the first-level directed graph node is determined to be related to the current first-level based on the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The current intermediate-level directed graph node set corresponding to the directed graph node, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node The label information in the attribute information of the graph node and its first-level child directed graph node is used to determine each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph;

If the attribute information of each first-level child directed graph node of the current first-level directed graph node does not contain label information, then the attribute information of the current first-level directed graph node does not include label information, according to The first-level atomic operator represented by the current first-level directed graph node sets the intermediate-level atomic operator in the attribute information of the current first-level directed graph node, at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the current first-level directed graph node is used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level The dependency relationship between the sub-directed graph nodes is used to determine the current intermediate-level directed graph node corresponding to the current first-level directed graph node in each intermediate-level directed graph node and the intermediate-level directed graph. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes;

If the attribute information of a part of the current first-level directed graph node of the first-level child directed graph node contains the label information corresponding to the cell in the spreadsheet and the other part of the current first-level directed graph node is the first If the attribute information of the first-level child directed graph node does not contain label information, the current first-level directed graph node is set according to the intersection of the label information contained in the attribute information of the first-level child directed graph node containing the label information According to the label information in the attribute information of the current first-level directed graph node, the middle-level atomic operator in the attribute information of the current first-level directed graph node is set according to the first-level atomic operator represented by the current first-level directed graph node. The label information and intermediate atomic operators in the attribute information of the current first-level directed graph node are used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current The dependency relationship between the first-level directed graph node and its first-level child directed graph node is determined according to the label information in the attribute information of the current first-level directed graph node and its first-level child directed graph node Each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node and each intermediate-level directed graph node set in the intermediate-level directed graph The dependency relationship between the nodes of the hierarchical directed graph.

(60) The device according to (58), wherein the formula translator is further configured to: when traversed to the first-level directed graph, the current first-level directed graph node represents the first level When the atomic operator is a dimensionality reduction atomic operator,

So that the attribute information of the current first-level directed graph node does not contain label information or includes a subset of the label information in the attribute information of the first-level child directed graph node of the current first-level directed graph node, Set the intermediate-level atomic operator in the attribute information of the current first-level directed graph node at least according to the first-level atomic operator represented by the current first-level directed graph node, and at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level directed graph node The dependency relationship between the first-level sub-directed graph nodes is used to determine each intermediate-level directed graph node and the intermediate-level directed graph in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in.

(61) The device according to (58), wherein the formula translator is further configured to: when traversed to the first-level directed graph, the current first-level directed graph node represents the first level When the atomic operator is a misplaced atomic operator,

In the case that the attribute information of the first-level child directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, the attribute information of the first-level child directed graph node The label information contained in the information is set to the label information in the attribute information of the current first-level directed graph node, and the “equal” atomic operator is set to the current first-level node. The intermediate-level atomic operator in the attribute information of the directed graph node is determined to be relative to the current first-level directed graph node according to the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The corresponding set of current intermediate-level directed graph nodes, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node and its first level The label information in the attribute information of the first-level sub-directed graph node is used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the directed graph.

(62) The device according to any one of (57) to (61), wherein the formula translator is further configured to:

Extract the sub-directed graphs with each intermediate-level directed graph root node in the set of intermediate-level directed graph root nodes as the root node from the intermediate-level directed graph, and use the extracted sub-directed graph as the first The second-level directed graph is used to determine the second-level compound operator based on the second-level directed graph.

(63) The device according to (62), wherein the formula translator is further configured to:

By matching the label information in the attribute information of the root node of each intermediate-level directed graph with the label information in the attribute information of the left-value node of each intermediate-level directed graph, each intermediate-level directed graph root node set The position of the root node of the level directed graph corresponds to the position of the left value node of each intermediate level directed graph in the set of left value nodes of the intermediate level directed graph; and

The sub-directed graph with the root node of the intermediate-level directed graph at the corresponding matching position as the root node is extracted as the second-level directed graph to determine the cell corresponding to the intermediate-level lvalue node according to the second-level directed graph The second-level compound operator.

(64) The device according to (51), further comprising a spreadsheet formula writer, the spreadsheet formula writer being configured to:

The generated spreadsheet formula for each first cell of the one or more first cells is stored in a corresponding cell in the spreadsheet file.

(65) The device according to (43), wherein

The custom atomic operator is defined by combining the atomic operators preset by the system.

(66) The device according to (65), wherein the formula translator is further configured to:

In the case that the custom atomic operator is included in the hierarchical formula used in the spreadsheet, the custom atomic operator is converted into a system preset atomic operator.

(67) The method according to (66), wherein the formula translator is further configured to:

Replacing the custom atomic operator in the original directed graph of the hierarchical formula with the root node of the directed graph representing the custom atomic operator; and

Replace the leaf nodes in the directed graph of the custom atomic operator with the child directed graph in the original directed graph of the hierarchical formula with the custom atomic operator as the parent node.

(68) The device according to (40), further comprising an intelligent suggestion module, the intelligent suggestion module being configured to:

Updating the knowledge base of intelligent suggestions based on the obtained hierarchy formula, the knowledge base of intelligent suggestions including information related to the hierarchy formula or hierarchy structure; and

Based on the intelligent suggestion knowledge base, intelligent suggestions are made when a new level formula is about to be obtained.

(69) The device according to (40), further comprising a defect detection module configured to:

Automatically detect defects in the obtained hierarchy formula; and

Automatically generate debugging information based on the defect and prompt the debugging information,

Wherein, the debugging information includes errors or warnings.

(70) The device according to (40), further comprising:

An electronic form model storage module, the electronic form model storage module is configured to store an electronic form model, the electronic form model includes one or more of the following: for the hierarchical structure of the electronic form, used for the electronic form Hierarchical calculation diagrams and spreadsheet files.

(71) The device according to (70), further comprising:

An electronic form model import and export module, the electronic form model import and export module is configured to import and/or export the electronic form model.

(72) The device according to (42), wherein the text editor is configured to:

Perform word segmentation on the text code to obtain a word stream;

Identifying the word segmentation related to the operator in the word segmentation stream to determine the operator;

Identifying the word segmentation related to the one or more nodes in the one or more levels in the hierarchical structure of the spreadsheet in the word segmentation stream to determine the level reference; and

The hierarchical formula is generated according to the determined operator and hierarchical reference.

(73) The device according to (44), wherein the compound operator adopts one or more of the following items to store:

String

The computer-implemented function pointed to by the function pointer; and

Directed graph.

(74) The device according to (73), wherein each node in the directed graph represents the operator in the hierarchical formula, and the directed graph between each node in the directed graph The edges represent the combination relationship between the operators in the hierarchical formula.

(75) The device according to (64), wherein the spreadsheet formula writer is configured to:

Automatically naming a part or all of the cell names of the one or more first cells and the one or more second cells in the electronic table; and

Utilize automatically named cell names to rewrite the spreadsheet formula and store the rewritten spreadsheet formula.

Claims (75)

1. A computer-implemented method for generating spreadsheet formulas, the method comprising:

   Acquire a hierarchical formula for the electronic form, the hierarchical formula including an operator and a hierarchical reference, wherein the hierarchical reference corresponds to one or more nodes in one or more levels in the hierarchical structure of the electronic form , Wherein each level has at least one node and has a corresponding level type, and each node corresponds to one or more cells in the spreadsheet, wherein the level structure further includes the one or more nodes Affiliation;

   Determine the dependency relationship between the one or more nodes based on the correspondence relationship between the hierarchical reference and the one or more nodes;

   Determining the calculation relationship between the one or more nodes based on the operator and the dependency relationship; and

   The spreadsheet formula is generated based at least on the hierarchical structure and the calculation relationship for the spreadsheet.
2. The method according to claim 1, wherein the step of obtaining a hierarchical formula for the electronic form comprises:

   Provide a graphical user interface editor, wherein the graphical user interface editor includes components for specifying nodes and/or operators at different levels;

   Receive input for components used to specify nodes and/or operators at different levels; and

   The hierarchical formula is generated based on the input.
3. The method according to claim 1, wherein the step of obtaining a hierarchical formula for the electronic form comprises:

   Receive the text code entered by the user; and

   The text code is parsed to generate the hierarchical formula.
4. The method of claim 1, wherein the operator includes an atomic operator, and the atomic operator includes one or more of the following: mathematical operators, mathematical functions, constants, system-defined functions, User-defined atomic operators.
5. The method according to claim 4, further comprising:

   A compound operator is constructed according to the atomic operator in the hierarchical formula, wherein the compound operator includes a combination of all the atomic operators in the hierarchical formula.
6. The method according to claim 5, wherein the step of determining the calculation relationship between the one or more nodes based on the operator and the dependency relationship further comprises:

   The calculation relationship between the one or more nodes is determined based on at least the compound operator and the dependency relationship.
7. The method according to any one of claims 1 to 6, wherein the level reference includes a first level reference located on the left side of the equal sign in the level formula and a first level reference located on the right side of the equal sign in the level formula The second-level reference of, wherein the first-level reference corresponds to the first node in the one or more nodes, and the second-level reference corresponds to the second node in the one or more nodes.
8. The method according to claim 7, wherein the step of determining the dependency relationship between the one or more nodes based on the correspondence relationship between the hierarchical reference and the one or more nodes comprises:

   The dependency relationship between the first node and the second node is determined based at least on the correspondence between the first-level reference and the first node and the correspondence between the second-level reference and the second node.
9. The method according to any one of claims 1 to 6, further comprising:

   For each node of the one or more nodes, the calculation relationship between the node and other nodes is stored via a hierarchical calculation graph.
10. The method according to claim 8, wherein the determining the calculation relationship between the one or more nodes based on the operator and the dependency relationship comprises:

    The calculation relationship between the first node and the second node is determined based on the operator and the dependency relationship between the first node and the second node.
11. The method according to claim 10, further comprising:

    For the first node, the calculation relationship between the first node and the second node is stored via the hierarchical calculation graph.
12. The method according to any one of claims 1 to 6, wherein the generating the spreadsheet formula based at least on the hierarchical structure for the spreadsheet and the calculation relationship comprises:

    For each current node in the one or more nodes, one or more first nodes corresponding to the current node are determined based on the calculation relationship between the current node and other nodes in the one or more nodes. The calculation relationship between each first cell in the cell and each second cell in the one or more second cells corresponding to other nodes; and

    Based on at least the calculated relationship between each first cell in the one or more first cells and each second cell in the one or more second cells, the The spreadsheet formula for each of the one or more first cells.
13. The method according to claim 12, wherein said determining each first cell of the one or more first cells corresponding to the current node and one or more second cells corresponding to other nodes The steps of calculating the relationship between each second cell include:

    Determine the operator corresponding to each first cell in the one or more first cells corresponding to the current node based at least on the operator corresponding to the current node in the one or more nodes; and

    At least based on the dependency relationship between the current node and other nodes in the one or more nodes, it is determined that each first cell of the one or more first cells corresponding to the current node is connected to other nodes. Corresponding to the dependency relationship between each second cell in one or more second cells.
14. The method according to claim 13, wherein the step of generating a spreadsheet formula for each first cell of the one or more first cells comprises:

    At least based on the operator corresponding to each first cell in the one or more first cells corresponding to the current node, and each first cell in the one or more first cells corresponding to the current node The dependency relationship between a cell and each second cell in one or more second cells corresponding to other nodes is generated for each first cell in the one or more first cells Spreadsheet formula for the cell.
15. The method of claim 14, wherein:

    The operator corresponding to the current node in the one or more nodes is a first-level compound operator corresponding to one of the one or more nodes in the hierarchical structure of the spreadsheet , The first-level compound operator includes one or more first-level atomic operators;

    The operator corresponding to each first cell in the one or more first cells is the second level corresponding to one cell in the one or more cells in the spreadsheet Compound operators, the second-level compound operators include one or more second-level atomic operators; and

    Based on at least the first-level compound operator corresponding to the current node in the one or more nodes, determine the corresponding one of the one or more first cells corresponding to the current node The second level compound operator.
16. The method according to claim 15, wherein:

    The first-level compound operator uses the first-level directed graph for storage. Each directed graph node in the first-level directed graph represents each first-level atomic operator in the first-level compound operator, and the first-level The directed edges between each directed graph node in the directed graph represent the combination relationship between each first-level atomic operator in the first-level compound operator;

    The second-level compound operator uses a second-level directed graph for storage. Each directed graph node in the second-level directed graph represents each second-level atomic operator in the second-level compound operator, and the second-level The directed edges between each directed graph node in the directed graph represent the combination relationship between each second-level atomic operator in the second-level compound operator; and

    The second-level directed graph is determined by traversing the first-level directed graph corresponding to the first-level compound operator, and the second-level compound operator is determined according to the second-level directed graph.
17. The method according to claim 16, wherein the determining the second-level directed graph by traversing the first-level directed graph corresponding to the first-level compound operator comprises:

    Traverse the first-level directed graph in the order of post-order traversal, so that the child directed graph nodes in the first-level directed graph are traversed first, and then the parent directed graph nodes in the first-level directed graph are traversed.
18. The method according to claim 17, further comprising:

    When traversing to the current first-level directed graph node in one or more first-level directed graph nodes in the first-level directed graph, according to the first-level atom represented by the current first-level directed graph node Operator and the attribute information of the first-level child directed graph node of the current first-level directed graph node to determine the attribute information of the current first-level directed graph node. The attribute information includes one or more of the following items: the location information of the cells in the spreadsheet, the label information corresponding to the cells in the spreadsheet, and the location information of the cells in the spreadsheet, and the location information of the cells in the spreadsheet. Label information and intermediate nodes corresponding to the cells in, and intermediate nodes corresponding to the cells in the spreadsheet, wherein the intermediate nodes are used to store intermediate calculation results;

    According to the attribute information of each first-level directed graph node in the one or more first-level directed graph nodes in the first-level directed graph, each intermediate-level directed graph in the intermediate-level directed graph is determined The graph node set is determined according to the dependency relationship between the one or more first-level directed graph nodes in the first-level directed graph in each intermediate-level directed graph node set in the intermediate-level directed graph The dependency between each intermediate-level directed graph node in the intermediate-level directed graph and each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph.
19. The method according to claim 18, wherein the first-level atomic operators are classified into one of element-wise atomic operators, dimensionality reduction atomic operators, misplaced atomic operators, and user-defined atomic operators.
20. The method according to claim 19, wherein, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is an element-wise atomic operator,

    If the attribute information of each first-level sub-directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, then the attribute information of each first-level sub-directed graph node The intersection of the label information contained in the attribute information sets the label information in the attribute information of the current first-level directed graph node, and sets the current first-level atomic operator represented by the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the first-level directed graph node is determined to be related to the current first-level based on the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The current intermediate-level directed graph node set corresponding to the directed graph node, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node The label information in the attribute information of the graph node and its first-level child directed graph node is used to determine each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph;

    If the attribute information of each first-level child directed graph node of the current first-level directed graph node does not contain label information, then the attribute information of the current first-level directed graph node does not include label information, according to The first-level atomic operator represented by the current first-level directed graph node sets the intermediate-level atomic operator in the attribute information of the current first-level directed graph node, at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the current first-level directed graph node is used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level The dependency relationship between the sub-directed graph nodes is used to determine the current intermediate-level directed graph node corresponding to the current first-level directed graph node in each intermediate-level directed graph node and the intermediate-level directed graph. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes;

    If the attribute information of a part of the current first-level directed graph node of the first-level child directed graph node contains the label information corresponding to the cell in the spreadsheet and the other part of the current first-level directed graph node is the first If the attribute information of the first-level child directed graph node does not contain label information, the current first-level directed graph node is set according to the intersection of the label information contained in the attribute information of the first-level child directed graph node containing the label information According to the label information in the attribute information of the current first-level directed graph node, the middle-level atomic operator in the attribute information of the current first-level directed graph node is set according to the first-level atomic operator represented by the current first-level directed graph node. The label information and intermediate atomic operators in the attribute information of the current first-level directed graph node are used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current The dependency relationship between the first-level directed graph node and its first-level child directed graph node is determined according to the label information in the attribute information of the current first-level directed graph node and its first-level child directed graph node Each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node and each intermediate-level directed graph node set in the intermediate-level directed graph The dependency relationship between the nodes of the hierarchical directed graph.
21. The method according to claim 19, wherein, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is a dimensionality reduction atomic operator,

    So that the attribute information of the current first-level directed graph node does not contain label information or includes a subset of the label information in the attribute information of the first-level child directed graph node of the current first-level directed graph node, Set the intermediate-level atomic operator in the attribute information of the current first-level directed graph node at least according to the first-level atomic operator represented by the current first-level directed graph node, and at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level directed graph node The dependency relationship between the first-level sub-directed graph nodes is used to determine each intermediate-level directed graph node and the intermediate-level directed graph in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in.
22. The method according to claim 19, wherein, when the first-level atomic operator represented by the current first-level directed graph node in the traversed first-level directed graph is a misplaced atomic operator,

    In the case that the attribute information of the first-level child directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, the attribute information of the first-level child directed graph node The label information contained in the information is set to the label information in the attribute information of the current first-level directed graph node, and the “equal” atomic operator is set to the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the directed graph node is determined to be relative to the current first-level directed graph node according to the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The corresponding set of current intermediate-level directed graph nodes, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node and its first level The label information in the attribute information of the first-level sub-directed graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the directed graph.
23. The method according to any one of claims 18 to 22, further comprising:

    Extract the sub-directed graphs with each intermediate-level directed graph root node in the set of intermediate-level directed graph root nodes as the root node from the intermediate-level directed graph, and use the extracted sub-directed graph as the first The second-level directed graph is used to determine the second-level compound operator based on the second-level directed graph.
24. The method according to claim 23, wherein the step of extracting comprises:

    By matching the label information in the attribute information of the root node of each intermediate-level directed graph with the label information in the attribute information of the left-value node of each intermediate-level directed graph, each intermediate-level directed graph root node set The position of the root node of the level directed graph corresponds to the position of the left value node of each intermediate level directed graph in the set of left value nodes of the intermediate level directed graph; and

    The sub-directed graph with the root node of the intermediate-level directed graph at the corresponding matching position as the root node is extracted as the second-level directed graph to determine the cell corresponding to the intermediate-level lvalue node according to the second-level directed graph The second-level compound operator.
25. The method according to claim 12, further comprising:

    The generated spreadsheet formula for each first cell of the one or more first cells is stored in a corresponding cell in the spreadsheet file.
26. The method of claim 4, wherein:

    The custom atomic operator is defined by combining the atomic operators preset by the system.
27. The method of claim 26, wherein:

    In the case that the custom atomic operator is included in the hierarchical formula used in the spreadsheet, the custom atomic operator is converted into a system preset atomic operator.
28. The method according to claim 27, wherein the step of unfolding comprises:

    Replacing the custom atomic operator in the original directed graph of the hierarchical formula with the root node of the directed graph representing the custom atomic operator; and

    Replace the leaf nodes in the directed graph of the custom atomic operator with the child directed graph in the original directed graph of the hierarchical formula with the custom atomic operator as the parent node.
29. The method according to claim 1, further comprising:

    Updating the knowledge base of intelligent suggestions based on the obtained hierarchy formula, the knowledge base of intelligent suggestions including information related to the hierarchy formula or hierarchy structure; and

    Based on the intelligent suggestion knowledge base, intelligent suggestions are made when a new level formula is about to be obtained.
30. The method according to claim 1, further comprising:

    Automatically detect defects in the obtained hierarchy formula; and

    Automatically generate debugging information based on the defect and prompt the debugging information,

    Wherein, the debugging information includes errors or warnings.
31. The method according to claim 1, further comprising:

    An electronic form model is stored, and the electronic form model includes one or more of the following: a hierarchical structure for the electronic form, a hierarchical calculation diagram for the electronic form, and an electronic form file.
32. The method of claim 31, further comprising:

    Import and/or export the spreadsheet model.
33. The method according to claim 3, wherein the step of parsing the text code to generate the hierarchical formula comprises:

    Perform word segmentation on the text code to obtain a word stream;

    Identifying the word segmentation related to the operator in the word segmentation stream to determine the operator;

    Identifying the word segmentation related to the one or more nodes in the one or more levels in the hierarchical structure of the spreadsheet in the word segmentation stream to determine the level reference; and

    The hierarchical formula is generated according to the determined operator and hierarchical reference.
34. The method according to claim 5, wherein the compound operator adopts one or more of the following to store:

    String

    The computer-implemented function pointed to by the function pointer; and

    Directed graph.
35. The method according to claim 34, wherein each node in the directed graph represents the operator in the hierarchical formula, and the directed edge between each node in the directed graph represents the The combinatorial relationship between the operators in the hierarchical formula.
36. The method according to claim 25, wherein the generated spreadsheet formula for each first cell of the one or more first cells is stored in the corresponding first cell The steps also include:

    Automatically naming a part or all of the cell names of the one or more first cells and the one or more second cells in the electronic table; and

    Utilize automatically named cell names to rewrite the spreadsheet formula and store the rewritten spreadsheet formula.
37. An apparatus for generating electronic form formulas, comprising: components for performing the steps of the method according to any one of claims 1-36.
38. A device used to generate spreadsheet formulas, including:

    At least one processor; and

    At least one storage device, the at least one storage device stores instructions, and when the instructions are executed by the at least one processor, the at least one processor is caused to execute the method according to any one of claims 1-36 method.
39. A non-transitory computer-readable storage medium storing instructions, which when executed by a processor, cause the method according to any one of claims 1-36 to be executed.
40. A device for generating an electronic form formula, the device comprising:

    A hierarchical formula editor configured to obtain a hierarchical formula for the electronic form, the hierarchical formula including an operator and a hierarchical reference, wherein the hierarchical reference corresponds to a hierarchical structure for the electronic form One or more nodes in one or more levels in each level, where each level has at least one node and has a corresponding level type, and each node corresponds to one or more cells in the spreadsheet, where all The hierarchical structure also includes the affiliation relationship between the one or more nodes;

    A hierarchical formula parser, the hierarchical formula parser is configured to determine the dependency relationship between the one or more nodes based on the correspondence between the hierarchical reference and the one or more nodes; the hierarchy The formula parser is further configured to determine the calculation relationship between the one or more nodes based on the operator and the dependency relationship; and

    A formula translator configured to generate the spreadsheet formula based on at least the hierarchical structure and the calculation relationship for the spreadsheet.
41. The apparatus of claim 40, wherein the hierarchical formula editor includes a graphical user interface editor, wherein the graphical user interface editor includes components for specifying nodes and/or operators of different hierarchies, and wherein The graphical user interface editor is also configured to:

    Receive input for components used to specify nodes and/or operators at different levels; and

    The hierarchical formula is generated based on the input.
42. The apparatus of claim 40, wherein the hierarchical formula editor comprises a text editor, and the text editor is configured to:

    Receive the text code entered by the user; and

    The text code is parsed to generate the hierarchical formula.
43. The device of claim 40, wherein the operator includes an atomic operator, and the atomic operator includes one or more of the following: mathematical operators, mathematical functions, constants, system-defined functions, User-defined atomic operators.
44. The device of claim 43, wherein the hierarchical formula parser is further configured to:

    A compound operator is constructed according to the atomic operator in the hierarchical formula, wherein the compound operator includes a combination of all the atomic operators in the hierarchical formula.
45. The device of claim 44, wherein the hierarchical formula parser is further configured to:

    The calculation relationship between the one or more nodes is determined based on at least the compound operator and the dependency relationship.
46. The device according to any one of claims 40 to 45, wherein the level reference includes a first level reference located on the left side of the equal sign in the level formula and a first level reference located on the right side of the equal sign in the level formula The second-level reference of, wherein the first-level reference corresponds to the first node of the one or more nodes, and the second-level reference corresponds to the second node of the one or more nodes.
47. The apparatus of claim 46, wherein the hierarchical formula parser is further configured to:

    The dependency relationship between the first node and the second node is determined based at least on the correspondence between the first-level reference and the first node and the correspondence between the second-level reference and the second node.
48. The device according to any one of claims 40 to 45, further comprising a hierarchical calculation graph memory, the hierarchical calculation graph memory being configured to:

    For each node of the one or more nodes, the calculation relationship between the node and other nodes is stored via a hierarchical calculation graph.
49. The apparatus of claim 48, wherein the hierarchical formula parser is further configured to:

    The calculation relationship between the first node and the second node is determined based on the operator and the dependency relationship between the first node and the second node.
50. The apparatus according to claim 49, further comprising a hierarchical calculation graph memory, the hierarchical calculation graph memory being configured to:

    For the first node, the calculation relationship between the first node and the second node is stored via the hierarchical calculation graph.
51. The device according to any one of claims 40 to 45, wherein the formula translator is further configured to:

    For each current node in the one or more nodes, one or more first nodes corresponding to the current node are determined based on the calculation relationship between the current node and other nodes in the one or more nodes. The calculation relationship between each first cell in the cell and each second cell in the one or more second cells corresponding to other nodes; and

    Based on at least the calculated relationship between each first cell in the one or more first cells and each second cell in the one or more second cells, the The spreadsheet formula for each of the one or more first cells.
52. The device of claim 51, wherein the formula translator is further configured to:

    Determine the operator corresponding to each first cell in the one or more first cells corresponding to the current node based at least on the operator corresponding to the current node in the one or more nodes; and

    At least based on the dependency relationship between the current node and other nodes in the one or more nodes, it is determined that each first cell of the one or more first cells corresponding to the current node is connected to other nodes. Corresponding to the dependency relationship between each second cell in one or more second cells.
53. The apparatus of claim 52, wherein the formula translator is further configured to:

    At least based on the operator corresponding to each first cell in the one or more first cells corresponding to the current node, and each first cell in the one or more first cells corresponding to the current node The dependency relationship between a cell and each second cell in one or more second cells corresponding to other nodes is generated for each first cell in the one or more first cells Spreadsheet formula for the cell.
54. The device of claim 53, wherein the formula translator is further configured to:

    The operator corresponding to the current node in the one or more nodes is a first-level compound operator corresponding to one of the one or more nodes in the hierarchical structure of the spreadsheet , The first-level compound operator includes one or more first-level atomic operators;

    The operator corresponding to each first cell in the one or more first cells is the second level corresponding to one cell in the one or more cells in the spreadsheet Compound operators, the second-level compound operators include one or more second-level atomic operators; and

    Based on at least the first-level compound operator corresponding to the current node in the one or more nodes, determine the corresponding one of the one or more first cells corresponding to the current node The second level compound operator.
55. The device of claim 54, wherein the formula translator is further configured to:

    The first-level compound operator uses the first-level directed graph for storage. Each directed graph node in the first-level directed graph represents each first-level atomic operator in the first-level compound operator, and the first-level The directed edges between each directed graph node in the directed graph represent the combination relationship between each first-level atomic operator in the first-level compound operator;

    The second-level compound operator uses a second-level directed graph for storage. Each directed graph node in the second-level directed graph represents each second-level atomic operator in the second-level compound operator, and the second-level The directed edges between each directed graph node in the directed graph represent the combination relationship between each second-level atomic operator in the second-level compound operator; and

    The second-level directed graph is determined by traversing the first-level directed graph corresponding to the first-level compound operator, and the second-level compound operator is determined according to the second-level directed graph.
56. The device of claim 55, wherein the formula translator is further configured to:

    Traverse the first-level directed graph in the order of post-order traversal, so that the child directed graph nodes in the first-level directed graph are traversed first, and then the parent directed graph nodes in the first-level directed graph are traversed.
57. The device of claim 56, wherein the formula translator is further configured to:

    When traversing to the current first-level directed graph node in one or more first-level directed graph nodes in the first-level directed graph, according to the first-level atom represented by the current first-level directed graph node Operator and the attribute information of the first-level child directed graph node of the current first-level directed graph node to determine the attribute information of the current first-level directed graph node. The attribute information includes one or more of the following items: the location information of the cells in the spreadsheet, the label information corresponding to the cells in the spreadsheet, and the location information of the cells in the spreadsheet, and the location information of the cells in the spreadsheet. Label information and intermediate nodes corresponding to the cells in, and intermediate nodes corresponding to the cells in the spreadsheet, wherein the intermediate nodes are used to store intermediate calculation results;

    According to the attribute information of each first-level directed graph node in the one or more first-level directed graph nodes in the first-level directed graph, each intermediate-level directed graph in the intermediate-level directed graph is determined The graph node set is determined according to the dependency relationship between the one or more first-level directed graph nodes in the first-level directed graph in each intermediate-level directed graph node set in the intermediate-level directed graph The dependency between each intermediate-level directed graph node in the intermediate-level directed graph and each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph.
58. The device of claim 57, wherein the first-level atomic operators are classified into one of element-wise atomic operators, dimensionality reduction atomic operators, misplaced atomic operators, and user-defined atomic operators.
59. The device according to claim 58, wherein the formula translator is further configured to: when traversed to the first-level directed graph, the current first-level directed graph node represents the first-level atomic operator When it is an element-wise atomic operator,

    If the attribute information of each first-level sub-directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, then the attribute information of each first-level sub-directed graph node The intersection of the label information contained in the attribute information sets the label information in the attribute information of the current first-level directed graph node, and sets the current first-level atomic operator represented by the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the first-level directed graph node is determined to be related to the current first-level based on the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The current intermediate-level directed graph node set corresponding to the directed graph node, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node The label information in the attribute information of the graph node and its first-level child directed graph node is used to determine each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the intermediate-level directed graph;

    If the attribute information of each first-level child directed graph node of the current first-level directed graph node does not contain label information, then the attribute information of the current first-level directed graph node does not include label information, according to The first-level atomic operator represented by the current first-level directed graph node sets the intermediate-level atomic operator in the attribute information of the current first-level directed graph node, at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the current first-level directed graph node is used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first-level The dependency relationship between the sub-directed graph nodes is used to determine the current intermediate-level directed graph node corresponding to the current first-level directed graph node in each intermediate-level directed graph node and the intermediate-level directed graph. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes;

    If the attribute information of a part of the current first-level directed graph node of the first-level child directed graph node contains the label information corresponding to the cell in the spreadsheet and the other part of the current first-level directed graph node is the first If the attribute information of the first-level child directed graph node does not contain label information, the current first-level directed graph node is set according to the intersection of the label information contained in the attribute information of the first-level child directed graph node containing the label information According to the label information in the attribute information of the current first-level directed graph node, the middle-level atomic operator in the attribute information of the current first-level directed graph node is set according to the first-level atomic operator represented by the current first-level directed graph node. The label information and intermediate atomic operators in the attribute information of the current first-level directed graph node are used to determine the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current The dependency relationship between the first-level directed graph node and its first-level child directed graph node is determined according to the label information in the attribute information of the current first-level directed graph node and its first-level child directed graph node Each intermediate-level directed graph node in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node and each intermediate-level directed graph node set in the intermediate-level directed graph The dependency relationship between the nodes of the hierarchical directed graph.
60. The device according to claim 58, wherein the formula translator is further configured to: when traversed to the first-level directed graph, the current first-level directed graph node represents the first-level atomic operator When it is a dimensionality reduction atomic operator,

    So that the attribute information of the current first-level directed graph node does not contain label information or includes a subset of the label information in the attribute information of the first-level child directed graph node of the current first-level directed graph node, Set the intermediate atomic operator in the attribute information of the current first-level directed graph node at least according to the first-level atomic operator represented by the current first-level directed graph node, and at least according to the current first-level directed graph node The intermediate-level atomic operator in the attribute information of the graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node, and at least according to the current first-level directed graph node and its first level The dependency relationship between the first-level sub-directed graph nodes is used to determine each intermediate-level directed graph node and the intermediate-level directed graph in the current intermediate-level directed graph node set corresponding to the current first-level directed graph node The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in.
61. The device according to claim 58, wherein the formula translator is further configured to: when traversed to the first-level directed graph, the current first-level directed graph node represents the first-level atomic operator When it is a misplaced atomic operator,

    In the case that the attribute information of the first-level child directed graph node of the current first-level directed graph node contains the label information corresponding to the cell in the spreadsheet, the attribute information of the first-level child directed graph node The label information contained in the information is set to the label information in the attribute information of the current first-level directed graph node, and the “equal” atomic operator is set to the current first-level directed graph node. The intermediate-level atomic operator in the attribute information of the directed graph node is determined to be relative to the current first-level directed graph node according to the label information and the intermediate-level atomic operator in the attribute information of the current first-level directed graph node. The corresponding set of current intermediate-level directed graph nodes, and at least according to the dependency relationship between the current first-level directed graph node and its first-level child directed graph nodes, and according to the current first-level directed graph node and its first level The label information in the attribute information of the first-level sub-directed graph node determines the current intermediate-level directed graph node set corresponding to the current first-level directed graph node. The dependency relationship between each intermediate-level directed graph node in the set of other intermediate-level directed graph nodes in the directed graph.
62. The device according to any one of claims 57 to 61, wherein the formula translator is further configured to:

    Extract the sub-directed graphs with each intermediate-level directed graph root node in the set of intermediate-level directed graph root nodes as the root node from the intermediate-level directed graph, and use the extracted sub-directed graph as the first The second-level directed graph is used to determine the second-level compound operator based on the second-level directed graph.
63. The device of claim 62, wherein the formula translator is further configured to:

    By matching the label information in the attribute information of the root node of each intermediate-level directed graph with the label information in the attribute information of the left-value node of each intermediate-level directed graph, each intermediate-level directed graph root node set The position of the root node of the level directed graph corresponds to the position of the left value node of each intermediate level directed graph in the set of left value nodes of the intermediate level directed graph; and

    The sub-directed graph with the root node of the intermediate-level directed graph at the corresponding matching position as the root node is extracted as the second-level directed graph to determine the cell corresponding to the intermediate-level left-value node according to the second-level directed graph The second level compound operator.
64. The apparatus according to claim 51, further comprising an electronic form formula writer, the electronic form formula writer being configured to:

    The generated spreadsheet formula for each first cell of the one or more first cells is stored in a corresponding cell in the spreadsheet file.
65. The device of claim 43, wherein:

    The custom atomic operator is defined by combining the atomic operators preset by the system.
66. The device of claim 65, wherein the formula translator is further configured to:

    In the case that the custom atomic operator is included in the hierarchical formula used in the spreadsheet, the custom atomic operator is converted into a system preset atomic operator.
67. The method of claim 66, wherein the formula translator is further configured to:

    Replacing the custom atomic operator in the original directed graph of the hierarchical formula with the root node of the directed graph representing the custom atomic operator; and

    Replace the leaf nodes in the directed graph of the custom atomic operator with the child directed graph in the original directed graph of the hierarchical formula with the custom atomic operator as the parent node.
68. The device according to claim 40, further comprising an intelligent suggestion module, the intelligent suggestion module being configured to:

    Updating the knowledge base of intelligent suggestions based on the obtained hierarchy formula, the knowledge base of intelligent suggestions including information related to the hierarchy formula or hierarchy structure; and

    Based on the intelligent suggestion knowledge base, intelligent suggestions are made when a new level formula is about to be obtained.
69. The device according to claim 40, further comprising a defect detection module configured to:

    Automatically detect defects in the obtained hierarchy formula; and

    Automatically generate debugging information based on the defect and prompt the debugging information,

    Wherein, the debugging information includes errors or warnings.
70. The device according to claim 40, further comprising:

    An electronic form model storage module, the electronic form model storage module is configured to store an electronic form model, the electronic form model includes one or more of the following: for the hierarchical structure of the electronic form, used for the electronic form Hierarchical calculation diagrams and spreadsheet files.
71. The device of claim 70, further comprising:

    An electronic form model import and export module, the electronic form model import and export module is configured to import and/or export the electronic form model.
72. The device of claim 42, wherein the text editor is configured to:

    Perform word segmentation on the text code to obtain a word stream;

    Identifying the word segmentation related to the operator in the word segmentation stream to determine the operator;

    Identifying the word segmentation related to the one or more nodes in the one or more levels in the hierarchical structure of the spreadsheet in the word segmentation stream to determine the level reference; and

    The hierarchical formula is generated according to the determined operator and hierarchical reference.
73. The device of claim 44, wherein the compound operator is stored using one or more of the following:

    String

    The computer-implemented function pointed to by the function pointer; and

    Directed graph.
74. The device according to claim 73, wherein each node in the directed graph represents the operator in the hierarchical formula, and the directed edge between each node in the directed graph represents the The combinatorial relationship between the operators in the hierarchical formula.
75. The device of claim 64, wherein the spreadsheet formula writer is configured to:

    Automatically naming a part or all of the cell names of the one or more first cells and the one or more second cells in the electronic table; and

    Utilize automatically named cell names to rewrite the spreadsheet formula and store the rewritten spreadsheet formula.

Images