WO2021129074A1

WO2021129074A1 - Method and system for processing reference of variable in program code

Info

Publication number: WO2021129074A1
Application number: PCT/CN2020/121830
Authority: WO
Inventors: 丛明舒; 瞿中明; 曲嘉宝; 曾凯; 唐来朋; 何毅良
Original assignee: 深圳逻辑汇科技有限公司
Priority date: 2019-12-26
Filing date: 2020-10-19
Publication date: 2021-07-01
Also published as: CN111158663A; CN111158663B

Abstract

A method and system for processing a reference of a variable in a program code. The method comprises: sequentially receiving a character stream included in a user input, wherein the character stream is part of a program code; identifying a first variable symbol from the received character stream, and storing information related to the first variable symbol, wherein the first variable symbol represents a first variable; matching the first variable symbol with at least one variable symbol previously identified from the program code, so as to determine whether a second variable symbol representing the first variable is present in the at least one variable symbol; in response to determining that there is at least one second variable symbol present, determining, according to an operation related to the first variable symbol and an operation related to the one or more second variable symbols, whether the first variable symbol involves an undefined reference; and in response to determining that the first variable symbol involves an undefined reference, providing visible assistance to a user to process the undefined reference.

Description

Method and system for processing variable reference in program code

Technical field

The present invention generally relates to the field of processing computer programming, and specifically, to a method and system for processing undeclared, undefined, or uninitialized variable references in programming language codes.

Background technique

Computer programs generally involve the processing of variables. In some programming languages, a variable is a placeholder corresponding to a piece of computer memory space; in an object-oriented programming language, a variable can also be represented as an object as an instance of a certain class. Operations on variables in a programming language may include, for example, declare, define, initialize, assign, access, destruct, and so on. Usually these operations on variables follow strict dependencies. For example, an uninitialized variable cannot be accessed, and an undefined variable cannot be destroyed. For ease of description, in this application, among the two variable operations that have a dependency on the same variable, the dependent operation is referred to as the "definition" of the variable, and the variable operation that depends on the "definition" is referred to as A "reference" to the variable. That is to say, the "define" in the present invention is not limited to a narrow definition operation, but may include various operations on which the "quoting" operation may depend. For example, for the reference operation "assignment" of a variable in a C language program, the "definition" operation it relies on includes the "declaration" operation in addition to the narrow "definition" operation.

Due to the existence of this dependency, most programming languages require strict positional order or input order between the code for variable definition and the code for variable reference. For compiled languages such as C++, the position of the code that requires the variable definition in the source file is before the code that refers to the variable; for interpreted languages such as Python, the variable is required to be defined. The code in the input sequence needs to be input before the code that references the variable. In the prior art, if the above-mentioned position order or input order is violated, an error will be reported during compilation or interpretation.

However, for certain domain-specific programming languages, such strict order requirements may cause difficulties for programmers. For example, in the domain-specific language "SMALL" proposed by Shenzhen Logic Technology Co., Ltd., the applicant of this application, to build a spreadsheet model, you can enter the code to build the rows of the spreadsheet and specify the calculations between different rows relationship. At this time, it is most intuitive and advantageous to enter the codes corresponding to these rows in the order of their positions in the spreadsheet, but this code input sequence cannot guarantee that the code that defines a row (variable) appears in this Line before the code that is referenced (for example, the variable is used as the rvalue of the equation). In real applications, there are often situations in the SMALL language where the variables that appear on the right side of the equation need to be parsed before all the variables are defined.

Summary of the invention

According to an embodiment of the present disclosure, a method for handling references of variables in program code is provided. The method includes sequentially receiving a stream of characters contained in user input. The character stream is part of the program code. The method also includes identifying the first variable symbol from the received character stream and storing information related to the first variable symbol. The first variable symbol represents the first variable. The method also includes matching the first variable symbol with at least one variable symbol previously identified from the program code to determine whether there is a second variable symbol representing the first variable in the at least one variable symbol. The method further includes, in response to determining that there is at least one second variable symbol, determining whether the first variable symbol involves an undefined reference based on an operation related to the first variable symbol and an operation related to the one or more second variable symbols . The method also includes in response to determining that the first variable symbol relates to an undefined reference, providing visual assistance to the user to process the undefined reference.

According to another embodiment of the present disclosure, a computer system is provided. The computer system includes one or more processors and a memory coupled to the one or more processors. The memory stores computer instructions that, when executed by the one or more processors, cause the one or more processors to perform the operations of the above-mentioned method.

According to yet another embodiment of the present disclosure, a computer-readable storage medium is provided. The computer-readable storage medium stores computer instructions that, when run by a processor, cause the processor to perform the above-mentioned method.

Description of the drawings

Through a more detailed description of the exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, the above and other objectives, features and advantages of the present disclosure will become more apparent. Among them, in the exemplary embodiments of the present disclosure, the same reference numerals generally represent The same parts.

Figure 1 shows a block diagram of an exemplary computer system/server 12 suitable for implementing embodiments of the present invention.

Fig. 2 shows a flowchart of a method for handling references of variables in program code according to an embodiment of the present disclosure.

Fig. 3 shows an example of the operation of a graphical user interface editor using SMALL language.

Fig. 4 shows an example of inputting code by a graphical user interface editor using SMALL language according to an embodiment of the present disclosure.

Fig. 5 shows an example of a variable symbol table according to an embodiment of the present disclosure.

Fig. 6 shows an example of the relationship between the program code, the variable symbol table, and the variable table according to an embodiment of the disclosure.

FIG. 7 shows an example of a process of establishing a variable table according to an embodiment of the present disclosure.

FIG. 8 shows an example of establishing a relationship between a variable symbol table and a variable table according to an embodiment of the present disclosure.

FIG. 9 shows an example of updating the variable symbol table and the variable table according to an embodiment of the present disclosure.

FIG. 10 shows another example of updating the variable table according to the variable symbol table according to an embodiment of the present disclosure.

FIG. 11 shows an example of providing visual assistance according to an embodiment of the present disclosure.

Fig. 12 shows an example of a strict matching prompt according to an embodiment of the present disclosure.

FIG. 13 shows an example of a prompt for rule-based matching according to an embodiment of the present disclosure.

Fig. 14 shows a hint example of fuzzy matching according to an embodiment of the present disclosure.

FIG. 15 shows an example in which a user selects a fuzzy matching result according to an embodiment of the present disclosure.

FIG. 16 shows an example of changing the name of a variable symbol according to a matching result according to an embodiment of the present disclosure.

FIG. 17 shows an example of an undefined reference table according to an embodiment of the present disclosure.

FIG. 18 shows a display example of an undefined reference table according to an embodiment of the present disclosure.

FIG. 19 shows a display example of an undefined reference table according to an embodiment of the present disclosure.

FIG. 20 shows an example of deleting a defined variable symbol from an undefined reference table according to an embodiment of the present disclosure.

FIG. 21 shows an example of performing a prior access using a subsequent definition according to an embodiment of the present disclosure.

FIG. 22 shows a display example of a variable symbol table and a variable table according to an embodiment of the present disclosure.

FIG. 23 shows a display example of a variable symbol table according to an embodiment of the present disclosure.

FIG. 24 shows an example of error correction according to an embodiment of the present disclosure.

FIG. 25 shows an example of displaying the adjusted program code to the user according to an embodiment of the present disclosure.

FIG. 26 shows an example of the correspondence between source program codes and adjusted program codes according to an embodiment of the present disclosure.

FIG. 27 shows an example in which a user manually adjusts the order of program statements according to an embodiment of the present disclosure.

Detailed ways

The inventor of the present invention proposes a system and method for handling undefined references in program code. The system and method can relax the limitation of the traditional programming language on the position sequence or input sequence of the code. For example, the present invention allows the user to first input a code that references an undefined variable, and then input the code that defines this variable at any position. The present invention also allows the program to be parsed and executed locally when not all variables have been defined. The present invention also allows assisting users to adjust the sequence of variable definition operation codes and variable reference operation codes so as to correctly complete program compilation and execution. In addition, with the technical solution of the present disclosure, the system will automatically match the definition and reference to the same variable.

The "definition" operation of the variable mentioned here also uses the broad meaning described above, that is, it includes various operations on which the "reference" operation depends, and is not limited to the narrow definition operation, depending on the type of the reference operation, for example, Including declaration, definition, assignment, etc. In a C language example, the "access" operation (referred to as reference) to the integer variable x depends on the "declaration", "definition" and "assignment" operations (referred to as definition for simplicity) of the variable x .

In the present disclosure, the "definition" and "reference" of a variable are relative terms. They are two operations on the same variable in the program code. The "reference" operation of a variable depends on the variable. "Define" operation. The definition and reference of a variable can be the following operations on the variable: declaration (declare), definition (define), initialization (initialize), assignment (assignment), access (access), destruction (destruct) and so on. The declaration of a variable is the program code telling the compiler the variable name and type of the variable and the variable will be defined. The definition of a variable means that the program code tells the compiler to create a variable and allocate a memory space for the variable. The initialization of a variable means that the program code tells the compiler to assign an initial value to the variable. Variable assignment refers to assigning a specified value to this variable as the value of this variable. Variable access refers to reading or using this variable, including assigning the value of the variable to other variables. The destruction of a variable refers to the release of the memory space occupied by the variable.

In some programming languages, the same code statement can complete one or more variable operations. For example, in the C language, "int a" completes the declaration and definition of the variable "a" at the same time; "int a = 1" completes the declaration, definition and initialization of the variable "a" at the same time; and "extern int a" Then the variable “a” is only declared in one file, and “a” needs to be defined in another file; “a=1” only initializes the variable “a”. For example, in the Python language, "a=1" simultaneously completes the declaration, definition and initialization of the variable "a". For example, in the SMALL language, the operation of adding a row named "Revenue" to a table simultaneously completes the declaration, definition and initialization of this row.

In addition, accessing a variable refers to reading the address or value of the variable and using it to perform certain operations. For example, in the C++ language, "b=a" means that the variable "a" is accessed. For example, in SMALL language, enter the formula "Revenue={USRevenue}+{ChinaRevenue}" for a variable named "Revenue", then the variables "USRevenue" and "ChinaRevenue" are accessed and can be used Perform the operation of calculating "Revenue".

In the present disclosure, since "definition" and "reference" are relative terms, when the reference objects are different, the same variable operation can be "definition" or "reference". For example, in the C++ language, the variable initialization operation "a=1" is a reference relative to the variable declaration and definition operation "int a", but it is a definition relative to "b=a+1".

In some domain-specific languages, sometimes it is not possible to satisfy the requirement of “defining” a variable before “quoting” the variable. For example, in the SMALL language, enter codes that define different rows in the order of rows in the spreadsheet to be generated, where each variable represents a row. At this time, if you want to enter the formula "Revenue={USRevenue}+{ChinaRevenue}" for the row named "Revenue", and the rows named "USRevenue" and "ChinaRevenue" need to be defined later, Then there will be cases where these two variables are referenced before the variables representing these two lines are defined.

This problem is expressed in another form in languages such as C++ and Python. In some special application scenarios, when writing a program in C++ language, for code readability, the definition of a variable may appear after the reference to the variable, and the prior art will report a compilation error at this time. For example, in the Python interpreter, when “b=a+1” is input first, and then “a=1” is input and executed, the prior art will also report an error.

In addition, in some scientific calculation programs, because the sequence of the mathematical formula is consistent, the sequence of performing the variable reference operation first and then performing the variable definition operation may be more in line with the thinking logic of the program writer, making it more readable.

Hereinafter, preferred embodiments of the present disclosure will be described in more detail with reference to the accompanying drawings. Although the drawings show preferred embodiments of the present disclosure, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided to make the present disclosure more thorough and complete, and to fully convey the scope of the present disclosure to those skilled in the art.

Those skilled in the art know that the present invention can be implemented as a system, a method or a computer program product. Therefore, the present disclosure can be specifically implemented in the following forms, namely: it can be complete hardware, complete software (including firmware, resident software, microcode, etc.), or a combination of hardware and software. This article generally Called "circuit", "module" or "system". In addition, in some embodiments, the present invention may also be implemented in the form of a computer program product in one or more computer-readable media, the computer-readable medium containing computer-readable program code.

Hereinafter, the present invention will be described with reference to flowcharts and/or block diagrams of methods, devices (systems) and computer program products of embodiments of the present invention. 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. These computer program instructions are executed by the computer or other programmable data processing devices to generate an implementation flow chart. And/or the function/operation device specified in the block in the block diagram.

Figure 1 shows a block diagram of an exemplary computer system/server 12 suitable for implementing embodiments of the present invention. The computer system/server 12 shown in FIG. 1 is only an example, and should not bring any limitation to the function and application scope of the embodiment of the present invention.

As shown in FIG. 1, the computer system/server 12 is represented in the form of a general-purpose computing device. The components of the computer system/server 12 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 connecting different system components (including the system memory 28 and the processing unit 16).

The bus 18 represents one or more of several types of bus structures, including a memory bus or a memory controller, a peripheral bus, a graphics acceleration port, a processor, or a local bus using any bus structure among multiple bus structures. For example, these architectures include, but are not limited to, industry standard architecture (ISA) bus, microchannel architecture (MAC) bus, enhanced ISA bus, Video Electronics Standards Association (VESA) local bus, and peripheral component interconnection ( PCI) bus.

The computer system/server 12 typically includes a variety of computer system readable media. These media can be any available media that can be accessed by the computer system/server 12, including volatile and nonvolatile media, removable and non-removable media.

The system memory 28 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 30 and/or cache memory 32. The computer system/server 12 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. For example only, the storage system 34 may be used to read and write non-removable, non-volatile magnetic media (not shown in FIG. 1 and generally referred to as a "hard drive"). Although not shown in FIG. 1, a disk drive for reading and writing to a removable non-volatile disk (such as a "floppy disk") and a removable non-volatile disk (such as CD-ROM, DVD-ROM) can be provided. Or other optical media) read and write optical disc drives. In these cases, each drive can be connected to the bus 18 through one or more data media interfaces. The memory 28 may include at least one program product, the program product having a set of (for example, at least one) program modules, and these program modules are configured to perform the functions of the embodiments of the present invention.

A program/utility tool 40 having a set of (at least one) program module 42 may be stored in, for example, the memory 28. Such program module 42 includes, but is not limited to, an operating system, one or more application programs, and other programs Modules and program data, each of these examples or some combination may include the realization of a network environment. The program module 42 generally executes the functions and/or methods in the described embodiments of the present invention.

The computer system/server 12 can also communicate with one or more external devices 14 (such as keyboards, pointing devices, displays 24, etc.), and can also communicate with one or more devices that enable users to interact with the computer system/server 12. And/or communicate with any device (such as a network card, modem, etc.) that enables the computer system/server 12 to communicate with one or more other computing devices. This communication can be performed through an input/output (I/O) interface 22. In addition, the computer system/server 12 may also communicate with one or more networks (for example, a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet) through the network adapter 20. As shown in the figure, the network adapter 20 communicates with other modules of the computer system/server 12 through the bus 18. It should be understood that although not shown in the figure, other hardware and/or software modules can be used in conjunction with the computer system/server 12, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, Tape drives and data backup storage systems, etc.

Fig. 2 shows a flowchart of a method for handling references of variables in program code according to an embodiment of the present disclosure. The method shown in FIG. 2 may be executed by, for example, the computer system or the server 12 shown in FIG. 1. The method shown in FIG. 2 includes steps 210 to 250, but this is only illustrative, and the method may also include more or fewer steps.

The method shown in FIG. 2 starts at step 210. In step 210, the character stream contained in the user input may be received sequentially. The character stream is a part of the program code, and the program code is written in a compiled language, an interpreted language, or a language used to build a spreadsheet model.

The user can input all or part of the program code through a text editor or a graphical user interface editor, or directly read all or part of the program code stored in the storage device. The "program code" in the present disclosure can be composed of plain text code, or can be composed of a set of operations of the user in the graphical user interface. For example, traditional programming languages such as C++ and Python only receive codes in plain text, but programs in SMALL language can either be codes in plain text or a set of user operations in a graphical user interface.

According to another embodiment of the present disclosure, the user input may include at least a part of program code generated by a user input action monitored by a text editor. In this embodiment, if the user inputs a plain text code through a text editor, step 210 is implemented as the text editor monitors the input operation of the input device, and stores all the characters that have been input, the position of the cursor, and the previous operation. In memory, for use in subsequent steps. For example, when the user sequentially inputs the following characters "i", "n", "t", "", "x", "=", "aa", "+", the text editor receives these characters and connects them into characters The string "int x=aa+" is saved, and the position of the cursor is also saved. If the user continues to input "b", "*", "2", the text editor saves the added character string "b*2" and saves the updated cursor position. If the user deletes "2" and "*2" from back to front, the text editor will save the string with "*2" deleted and save the updated cursor position. When the user manually saves (for example, by pressing the "Ctrl+S" shortcut key or clicking the save button of the text editor with the mouse), the text editor will dump the content stored in the memory to the hard disk. The subsequent steps (for example, step 220) can perform corresponding operations by reading the character string and the cursor position saved by the text editor.

In yet another embodiment according to the present disclosure, the user input may include at least a part of program code generated by a user's operation in a graphical user interface editor. In this embodiment, if the user uses a graphical user interface editor to input program code, for example, the graphical user interface editor for building a spreadsheet model as shown in FIG. 3, the editor monitors user operations in the graphical user interface For use in subsequent steps. Fig. 3 shows an example of the operation of a graphical user interface editor using SMALL language. As shown in Figure 3, as an application scenario of the present invention, the graphical user interface editor using SMALL language contains different components. The user can add the component "+row" 301 by clicking the row of the graphical user interface with the mouse. The component 302, the component 302 represents a row in the spreadsheet. If the row name "Revenue" 303 is entered in the component 302, the newly added row will be named "Revenue". In an embodiment according to the present disclosure, the system saves the user's operation of adding a row (for example, clicking on the component 301) and the character string input in the component 302 for use in subsequent steps.

According to an embodiment of the present disclosure, the user input may include at least a part of the program code edited and stored by the user. In this embodiment, the system can directly read all or part of the programs previously edited by the user and saved in the storage device. At this time, step 210 is implemented as the system reads all or part of the program codes saved by the user into the memory, and starts to read the program codes in the memory sequentially to form a character stream.

Referring again to FIG. 2, the method proceeds to step 220. In step 220, the first variable symbol is identified from the received character stream and information related to the first variable symbol is stored. Here, the first variable symbol represents the first variable.

According to an embodiment of the present disclosure, identifying the first variable symbol from the received character stream may include using one or more of a lexical analyzer or a machine learning classifier to identify the first variable symbol from the received character stream . In this embodiment, if the input program code is a text code, a lexer (Lexer) can be used to scan the text code character by character, and the text character stream can be decomposed into a sequence of individual characters, and then the representative can be identified according to the lexical rules The character string of the variable symbol. The lexical analyzer is implemented by a finite state machine. For example, when scanning a C language code sentence "int x=aa+b*2", after scanning "int", "x", "=", "aa", "+", "b", "* ", "2", the limited state opportunity returns "keyword", "identifier", "operator", "identifier", "operator", "identifier", "operator" respectively , "Constant" (constant) status. Among them, the character strings "x", "aa", and "b" corresponding to "identifier" are variable symbols.

In this embodiment, alternatively or in addition, a machine learning classifier may be used to identify variable symbols. In one embodiment, a machine learning classifier can be used to score substrings in the text code. If the score is greater than the predetermined threshold, the substring is considered to be a variable symbol. For example, in the SMALL language code, if you enter "Revenue=USRevenue+ChinaRevenue" in text mode, the classifier will give the substrings "Revenue", "USRevenue", and "ChinaRevenue" higher Score and recognize them as variable symbols.

According to an embodiment of the present disclosure, recognizing the first variable symbol from the received character stream may include recognizing the character stream received from a specific component of the graphical user interface editor as the first variable symbol. In this embodiment, if the user enters the program code through the graphical user interface, the process of identifying variable symbols may only partially use or not use lexical analysis. For example, the content entered by the user in a specific graphical user interface component can be recognized as a variable symbol. Fig. 4 shows an example of inputting code by a graphical user interface editor using SMALL language according to an embodiment of the present disclosure. As shown in FIG. 4, when the user enters "Revenue" in the column 402 in a row component 401, "Revenue" will be recognized as a variable symbol of the type "row". In the graphical user interface editor, you can also use a lexical analyzer or machine learning classifier to identify variable symbols. For example, if you enter "{US Revenue}+{China Revenue}" (403,404) in the formula input field to the right of the equal sign in the line component 401 shown in Figure 4, the lexical analyzer can convert the content in the braces Recognized as variable symbols; and if you enter "US Revenue+China Revenue" in the formula input column, the machine learning classifier can recognize "US Revenue" and "China Revenue" as variable symbols.

According to an embodiment of the present disclosure, the information related to the variable symbol may include one or more of the following information: the name of the variable symbol, the position of the variable symbol in the program code, the namespace of the variable symbol, and the role of the variable symbol Domains, types of variables represented by variable symbols, variables represented by variable symbols, and operations related to variable symbols.

The name of the variable symbol refers to the string representing the variable symbol. For example, in the above example, "x", "aa", "b", "Revenue", "US Revenue", and "China Revenue" are all variable symbols The name. When the variable symbol is recognized, the name of the variable symbol is obtained.

The position of the variable symbol in the program code refers to the information that can locate the variable symbol in the program code. For program code in text form, the position of a variable symbol in the program code can be represented by a tuple that represents the position of the variable symbol in the program code. For example, (8, 10, 3) represents that the variable symbol is the first in the program code. 3 characters from the 10th character on the 8th line. For the program code of the graphical user interface, the position of the variable symbol in the program code can be obtained by the position of the component to which the variable symbol is input.

According to an embodiment of the present disclosure, all variable symbols in a program can be grouped, and each group belongs to a namespace or a scope. Two variable symbols with the same name in different namespaces or different scopes actually The above represents different variables. For example, for C program code, if you enter "int a=1;" and then enter "int f(){int a=2}", there are two variable symbols named "a" in the program code, but The former belongs to the file scope, and the latter belongs to the scope of the "f()" function, so they represent two different variables. The concept of namespace is similar to scope, and it is also a way to refer to the grouping of variable symbols. For example, in the C language, namespaces can be used to further distinguish variable symbols with the same name in the same scope. For example, for the two namespaces "namespaceA" and "namespaceB" in the C language, the variable names referred to by the two variable symbols "namespaceA::a" and "namespaceB::a" are all "a", but because they belong In different namespaces, it represents two different variables. For example, in the program code of SMALL language, if a row “Revenue” is added to a table named “Revenue Breakup”, and a row “Revenue” is added to a table named “Income Statement”, then The two variable symbols whose names are both "Revenue" belong to different namespaces. That is, the former belongs to the namespace in the table "Revenue Breakup", and the latter belongs to the namespace in the table "Income Statement".

According to an embodiment of the present disclosure, for the program code in text form, the namespace can be obtained by grammatically analyzing the context of the variable symbol. The syntax analysis is to construct the token sequence (Tokens) obtained from the lexical analysis into at least one of a parse tree (Parse Tree) or an abstract syntax tree (Abstract Syntax Tree) or other hierarchical data structures according to grammatical rules. The data structure records the affiliation and dependency relationship between the variable symbols, as well as the name space and other information. In addition, the scope of the variable symbol and the type of the variable represented by the variable symbol can also be obtained by grammatically analyzing the context of the variable symbol.

According to an embodiment of the present disclosure, for the program code of the graphical user interface, the namespace can be obtained by the information of the graphical user interface component when the variable is created. For example, the name space of a variable symbol can be obtained according to the structural relationship between the component to which the variable symbol is input and other components. Or the namespace of the variable symbol can be obtained according to the path of the variable symbol specified by the user. Similar to the namespace of the variable symbol, the scope of the variable symbol can be obtained by the structural relationship between the component inputting the variable symbol and other components.

According to an embodiment of the present disclosure, operations related to variable symbols include at least one of the following: declaration, definition, initialization, assignment, access, and destruction. Operations related to variable symbols refer to operations on variables represented by variable symbols. For the program code in text form, the operations related to the variable symbol can be obtained by grammatically analyzing the context of the variable symbol. For example, in the C language, the "x" in "int x=aa+b*2" is preceded by the keyword "int", followed by an expression "=aa+b*2", so this line of code is right The variable represented by the variable symbol "x" has been declared, defined and initialized. For example, for the program code of the graphical user interface, the operations related to the variable symbols can be obtained through the user's corresponding operations in the graphical user interface editor. As shown in Figure 3, for example, by clicking on the row add component 301 and inputting "Revenue" 303 to add a row (namely variable) named "Revenue", this series of operations represents the declaration and definition of this row. As shown in Figure 4, the operation of entering "US Revenue" 403 and "China Revenue" 404 in the formula input box on the right side of the equal sign in row 401 represents the access to these two variables.

In addition, for the program code of the graphical user interface, the type of the variable represented by the variable symbol can be obtained from the information of the component when the variable is created. For example, as shown in Figure 3, when the row "Revenue" is created, since the row addition component 301 is clicked, the type of the variable "Revenue" is row.

Here, the first variable symbol refers to the variable symbol being recognized by the method at this time. Before the first variable symbol, other variable symbols located before the first variable symbol in the program code may have been identified. When storing the information related to the first variable symbol in step 220, the information related to the first variable symbol is stored in a data structure. In one embodiment, the data structure may be a table, which will be referred to as a variable symbol table in the following for ease of description. The variable symbol table stores information related to each recognized variable symbol in the program code.

The variable symbol table is used to store the variable symbols identified in step 220 and their related information. After identifying a variable symbol, the system stores the identified variable symbol and its related information in the variable symbol table. If the variable symbol table does not exist, first establish the variable symbol table, and then save the recognized variable symbol and its related information into the variable symbol table. In one implementation, the process of creating a variable symbol table is: request storage space from the operating system and establish a variable symbol table data structure in the storage space. During the operation of the variable symbol table, if the storage space of the variable symbol table is insufficient, more storage space is dynamically applied to the operating system to store the newly added content. According to an embodiment of the present disclosure, an index can be established in the variable symbol table through the hash value of the name of the variable symbol. Each variable symbol in the variable symbol table corresponds to a hash value, and a tree index is established according to the hash value and stored in the variable symbol table. Fig. 5 shows an example of a variable symbol table according to an embodiment of the present disclosure. In the variable symbol table, if the variable symbols representing the same variable appear multiple times in the program code, they correspond to multiple entries in the variable symbol table. For example, as shown in Figure 5, taking the program code on the left side of Figure 5 as input, the variable symbols "a", "a", "b", "a", and "c" can be sequentially identified and stored in Figure 5. The variable symbol table shown on the right. For example, the variable symbol "a" in Figure 5 appears three times in the program code, and it is correspondingly recorded three times in the variable symbol table. See the entries with

id

1, 2, and 4. Those skilled in the art can understand that the variable symbol table in FIG. 5 is only illustrative, and it may also include other columns, such as the position of the variable symbol in the program code, the namespace of the variable symbol, the scope of the variable symbol, and the variable symbol table. The type of the variable represented by the symbol, the variable represented by the variable symbol, and the operations related to the variable symbol. The same is true for the other illustrative variable symbol tables that appear below.

Although FIG. 5 shows a variable symbol table in the form of a table, the present invention should not be limited to this. For example, the variable symbol table can also adopt other data structures, such as linked lists, databases, and so on.

Now referring back to FIG. 2, in step 230, the first variable symbol is matched with at least one variable symbol previously identified from the program code to determine whether there is a first variable representing the first variable in the at least one variable symbol. Two variable symbol. The purpose of step 230 is to compare the currently recognized variable symbol with each previously recognized variable symbol to determine which previously recognized variable symbol or symbols represent the same variable as the currently recognized variable symbol. Here, the second variable symbol refers to one of the variable symbols that has been previously identified and recorded in the variable symbol table and also represents the first variable.

According to an embodiment of the present disclosure, in response to the information related to the variable symbol being stored in the variable symbol table, the variable symbol can be matched with the previously stored variable symbol through the index. For example, when the index is established by the hash value of the variable symbol name, the hash value of the currently recognized variable symbol name can be calculated, and the variable symbol name in the variable symbol table that is similar to the currently recognized variable symbol name can be searched through the index, and Make a match.

According to an embodiment of the present disclosure, in step 230, in response to the information related to the variable symbol being stored in the variable symbol table, the variable symbol is matched with the previously stored variable symbol one by one. That is, for the newly recognized first variable symbol, compare it with each entry in the variable symbol table to determine whether they represent the same variable. Such matching may be strict matching, rule matching, or fuzzy matching, for example.

According to an embodiment of the present disclosure, matching the first variable symbol with at least one variable symbol previously identified from the program code may include: when the stored first variable symbol and the second one of the at least one variable symbol When the names, namespaces, scopes, and types of variables represented by the variable symbols are all the same, it is determined that the first variable symbol and the second variable symbol represent the same variable. In this embodiment, strict matching can be used. If and only if the namespace, scope, name, and type of the two variable symbols are the same, it is determined that the two variable symbols match. For example, in the code of C language, if you enter "int a＝1;" and "void f(){int global a＝2};" at the same time, then the two variable symbols named "a" belong to the default Namespace and file scope, so they can be strictly matched. For example, in the SMALL language, first create three rows of "Revenue", "US Revenue", and "China Revenue" in the same form, and enter the formula "Revenue={USRevenue}+{ChinaRevenue}", then Two variable symbols named "US Revenue" belong to the same namespace, so they can be strictly matched.

According to an embodiment of the present disclosure, matching the first variable symbol with at least one variable symbol previously identified from the program code may include: when the first variable symbol and a plurality of second ones of the at least one variable symbol When the names of the variable symbols are the same, the first variable symbol and which second variable symbol represents the same variable are determined according to a predefined rule. In this embodiment, rule-based matching can be used. The predefined rule may include matching the first variable symbol and the nearest second variable symbol of the same name to represent the same variable. For example, in the SMALL language, if you enter the formula "={US Revenue}+{China Revenue}" in the "Revenue" row, but two rows named "US Revenue" have been created in the same namespace. Here, these three variable symbols are called "US Revenue[1]", "US Revenue[2]", and "US Revenue[3]" respectively. Then you can determine which of the rows represented by "US Revenue[2]" and "US Revenue[3]" is closer to the "Revenue" row, and determine the closer row as matching "US Revenue[1]". The foregoing rule example is based on the distance between rows, but the present invention is not limited to this, and other rules may also be specified, such as a rule based on the time sequence of row establishment, a rule based on fewer empty values, and so on.

According to an embodiment of the present disclosure, matching the first variable symbol with at least one variable symbol previously identified from the program code may include: when the information related to the first variable symbol is related to the at least one variable symbol When the similarity between the information related to the second variable symbol is higher than the threshold, the user is prompted to confirm whether the first variable symbol and the second variable symbol represent the same variable. In this embodiment, fuzzy matching can be used, so that even variable symbols with different names can be matched. For example, in the SMALL language, if the user creates a row named "Sales" and enters "={Revenue}" in the formula bar of other rows, based on the matching of natural language recognition, it is recommended to change the "Revenue" A variable symbol matches the variable symbol "Sales", and the user is prompted for confirmation. One implementation of fuzzy matching is to calculate the corresponding word vector for any variable symbol, and calculate the similarity between the two variable symbols according to the distance between the word vectors of the two variable symbols, and the similarity is higher than a threshold. The two variable symbols are determined to match. Another implementation is to calculate the similarity based on the edit distance between two variable symbols. For example, for the variable symbol "Revenue" and the variable symbol "revenue", only the first letter is different, and the difference between the first letter is only the difference between upper and lower case, then the variable can be obtained by comparing the ratio of the same characters in the two variable symbols The edit distance between the symbols to calculate the similarity. Therefore, the similarity between the above two variable symbols is relatively high, and the user can be prompted to confirm whether they match.

In the above example, the similarity is calculated based on the edit distance of the name of the variable symbol or the word vector distance. In another embodiment according to the disclosure, the similarity can be obtained by one or more of the following: edit distance between variable symbol names, semantic similarity between variable symbol names, and variable symbol namespaces The degree of similarity, the inclusion relationship between the scopes of variable symbols, and the distance between the positions of variable symbols in the program code.

Referring back to FIG. 2, the method continues to step 240. In step 240, in response to determining that there is at least one second variable symbol, according to an operation related to the first variable symbol and related to the one or more second variable symbols The operation of determining whether the first variable symbol involves an undefined reference.

According to an embodiment of the present disclosure, in order to identify which variables are in the program code, a variable table can also be established and the relationship between the variable symbol table and the variable table can be established. In another embodiment, there is no need to establish a separate variable table, but the same data structure can be used to store the variable symbols and variables, for example, a table, a linked list, etc. can be used. For ease of description, the following description is based on the embodiment of maintaining the variable table and the variable symbol table separately. The variable table is used to store the variables referred to by the variable symbols. If the variable table does not exist after step 220 is completed, the variable table is created first, and then the variable referred to by the variable symbol is stored in the variable table. Variable symbols and variables are different. In the program code, every variable is referred to by at least one variable symbol, but in this disclosure, not every variable symbol points to a variable. For example, in the C language, if only "x=1" is written but "x" is not declared, then the variable symbol "x" does not point to a variable. For the C language code, the memory address of the variable can be used to represent the variable; for the SMALL language, since each variable corresponds to a certain level in the hierarchy of the spreadsheet, the unique ID of this level can be used to represent the variable. Fig. 6 shows an example of the relationship between the program code, the variable symbol table, and the variable table according to an embodiment of the disclosure. As shown in Figure 6, the present invention sets a special variable type in the variable table, which is called an empty variable. If the variable represented by the variable symbol has not yet been defined, add a null variable in the variable table. For example, in the sentence "int b=a+c;" 601 in Fig. 6, the variable "c" is not defined, then the variable c 602 with an empty type is added to the variable table. There can be multiple empty variables in the variable table, and they have different ids. The id of the variable can be an automatically assigned serial number or the address of the variable.

According to an embodiment of the present disclosure, the variable table stores the state of the identified variable, and the state of the variable includes one or more of the following: the variable symbol representing the variable, the address of the variable in the memory, the operation performed by the variable, the variable Whether it is defined and whether the variable is referenced.

Those skilled in the art can understand that the variable table in Figure 6 is only illustrative, and it can also include other columns, such as the variable symbol representing the variable, the address of the variable in the memory, the operation performed by the variable, and whether the variable is defined , And whether the variable is referenced, etc. The same is true for the other illustrative variable tables that appear below.

The operation performed by the variable can be one or more of declaration, definition, initialization, assignment, access, and destruction. Since the same variable in the program code may be referred to by multiple variable symbols, these variable symbols may perform different operations in different positions in the program code, so "operation performed by variables" may be related to "operations related to variable symbols" "different. FIG. 7 shows an example of a process of establishing a variable table according to an embodiment of the present disclosure. As shown in Figure 7, for example, in the SMALL language, referring to the upper part of Figure 7, first enter "Revenue={USRevenue}+{ChinaRevenue}" 701, then for the "USRevenue" entry 702 in the variable symbol table And the "US Revenue" entry 703 in the variable table, "Operation" is "Access". However, referring to the lower part of Figure 7, after the line "US Revenue" 704 is created, there are two

variable symbols

705 and 706 named "US Revenue" in the variable symbol table, and the corresponding "operations" are "Access". As with "declaration, definition, assignment", the variables corresponding to these two variable symbols are the same, and they are both "US Revenue" 703 in the variable table. The "operation" of this variable is "declaration, definition, assignment, access" 707.

According to an embodiment of the present disclosure, the operation performed by one variable in the variable table is equal to the union of operations related to each of the at least one variable symbol representing the variable. That is, taking Fig. 7 as an example, the operation 707 in the entry 703 of the variable table is equal to the union of the operations related to each variable symbol representing the variable. That is, the operation 707 "declare, define, assign, access" in entry 703 is the union of the operation "access" of entry 705 and the operation "declare, define, assign" of entry 706. FIG. 10 shows another example of updating the variable table according to the variable symbol table according to an embodiment of the present disclosure. The operation of the variables in the variable table is determined by the operation of all variable symbols related to it. As shown in Figure 10, if the variable "a" 1007 corresponds to the

variable symbols

1001, 1002, 1003 with

ids

1, 2, and 4 in the variable symbol table, and the operations they perform are "declare, define" 1004, and "assign" respectively "1006, "Access" 1005, the operations performed by the variable "a" are "declaration, definition, assignment, access".

According to an embodiment of the present disclosure, it is possible to determine whether the variable is defined according to the operations included in the union. Since "definition" and "reference" are relative terms, the two states of "whether the variable is defined" and "whether the variable is referenced" need to correspond to a specific scenario. These two states are flag bits set according to the present invention and can be represented by Boolean values. In an embodiment, the following judgment methods for these two flags adapted to different scenarios may be specified.

Table 1

The operations in Table 1 refer to the operations of variables in the variable table. For example, for the C language program code, if the variable x contains "access" in the operation of the variable table, the flag bit variable is quoted as "true"; at this time, if the variable x is missing "declaration" in the operation of the variable table Any one of "", "definition" and "assignment" means that the variable is not ready (hereinafter referred to as undefined), then the flag bit "variable is defined" is "false". In the case where "variable is defined" is false and "variable is referenced" is true, it is determined that the variable x involves an undefined reference.

In step 240, it is assumed that at least one second variable symbol that represents the same variable as the first variable symbol is matched. In another embodiment according to the present disclosure, when it is determined that there is no second variable symbol, it is determined whether the first variable symbol involves an undefined reference according to an operation related to the first variable symbol. In this case, the first variable symbol is the first variable symbol identified to represent the first variable, and other variable symbols representing the first variable have not been identified before. For example, the variable symbol "US Revenue" 702 in FIG. 7 belongs to this case, because only the variable symbol "Revenue" with an id of 1 is recognized before the variable symbol. At this time, the operation of the variable "US Revenue" 703 in the variable table is the same as the operation of the variable symbol "US Revenue" 702 in the variable symbol table, both of which are access. As can be seen from Table 1 above, in the case of SMALL language, since the operation of the variable "US Revenue" 703 does not include definition but includes access, the flag bit "variable is defined" is false and the flag bit "variable is referenced" "Is true, thereby confirming that the newly recognized variable symbol "US Revenue" 702 involves an undefined reference.

According to an embodiment of the present disclosure, when the relationship between the variable symbol table and the variable table is established, for each variable symbol in the variable symbol table, the variable in the variable table represented by it is stored; for each variable symbol in the variable table Variables store the variable symbols in the variable symbol table that can represent it. In an implementation, if the variable referred to by a variable symbol A is empty, an empty variable B is established in the variable table, and the relationship between the variable symbol A and the empty variable B is established. For example, the position or ID of variable B in the variable table is stored in the "variable symbol represented by variable symbol" field of the entry of variable symbol A in the variable symbol table, and the entry of variable B in the variable table indicates the variable The "variable symbol" field stores the position or ID of the variable symbol A in the variable symbol table. For example, in the program code of C language, if "x" is not declared and "x=1" is directly input, then the variable symbol "x" points to an empty variable in the variable table. FIG. 8 shows an example of establishing a relationship between a variable symbol table and a variable table according to an embodiment of the present disclosure. As shown in Figure 8, in the SMALL language, if the line "US Revenue" is not constructed before, and "Revenue={US Revenue}+{China Revenue}" is directly entered, the variable symbol "US Revenue" also points to An empty variable in the variable table. In an embodiment according to the present disclosure, the characteristic of an empty variable is that the type of the variable in the variable table is empty, and all other attributes are the same as normal variables.

Referring back to FIG. 2, in step 250, in response to determining that the first variable symbol relates to an undefined reference, visual assistance is provided to the user to process the undefined reference.

According to an embodiment of the present disclosure, providing visual assistance to the user includes one or more of the following: in a text editor or a graphical user interface editor, displaying a prompt box near the first variable symbol, or highlighting the first variable symbol A variable symbol. When the state of the variable corresponding to the referenced variable symbol input by the user in the variable table is "undefined reference" (that is, the "variable is defined" flag is false and the "variable is referenced" flag is true), the system Prompt the user. In different implementations, the system can have different prompts. In one implementation, when the input cursor leaves the current input line and a referenced variable in the content of the input line is not defined, the system pops up a prompt box near the variable to prompt the user that the variable involves an undefined reference. The prompt box can disappear automatically within a certain period of time. After the prompt box disappears, the name of the variable symbol involved in the undefined reference can be displayed in a special way. For example, at least one of the color, font, size, and background of the variable symbol name is different from the name of the normal variable to distinguish normal Variable symbols and variable symbols involving undefined references. FIG. 11 shows an example of providing visual assistance according to an embodiment of the present disclosure. As shown in Figure 11, for example, the user enters "int x=aa+b*2;" 1102 in a certain line, and then the cursor moves to the next line, and the variable symbol "aa" in the variable table has not yet been defined. . At this time, the system pops up a prompt box in the upper right corner of the variable symbol "aa", prompting "undefined" 1101. For example, the prompt box disappears after three seconds, and the background color of the name "aa" of the variable symbol changes to light gray 1103, which is different from the normal variable symbol.

According to the present disclosure, the program code input by the user is sequentially recognized, so the method shown in FIG. 2 is executed cyclically to sequentially recognize each variable identifier in the program code.

According to an embodiment of the present disclosure, after determining that the first variable symbol relates to an undefined reference, the method in FIG. 2 may further include continuing to identify the third variable symbol from the received character stream and storing information related to the third variable symbol Information, where the third variable symbol represents the first variable. Take Figure 7 as an example for illustration. For example, after identifying the variable symbol "US Revenue" 702 that involves an undefined reference, the user continues to input "US Revenue=$567,890" 704, where "US Revenue" 702 corresponds to the first variable The symbol, "US Revenue" 704 corresponds to the third variable symbol.

The method also includes matching a third variable symbol with at least one variable symbol previously identified from the program code to determine whether there is a variable symbol representing the first variable in the at least one variable symbol. The matching process includes matching the third variable symbol with each previously identified variable symbol to determine whether there is a previously identified variable symbol representing the same variable. This is the same as the process of matching the first variable symbol, for example, it may be a strict match. , Rule matching, or fuzzy matching.

According to an embodiment of the present disclosure, when performing fuzzy matching, whether it is the process of matching the second variable symbol with the first variable symbol, or the process of matching the first variable symbol with the third variable symbol, when the user is prompted to confirm the two When the variable symbol represents the same variable, if the user confirms that it represents the same variable, the variable represented by the newly recognized variable symbol is stored in the variable symbol table as the same variable represented by the matched variable symbol. According to another embodiment of the present disclosure, when the user confirms that the same variable is represented, the names and namespaces of the two variable symbols are changed to be the same.

The method further includes finding at least a first variable symbol that both represents the first variable with the third variable symbol through the matching. Taking FIG. 7 as an example for description, for example, the variable symbol "US Revenue" 702 corresponding to the variable symbol "US Revenue" 704 is found through the above-mentioned matching. At this time, the entry 703 in the variable table is updated to modify its type from "null" to "row" and the operation 707 of this entry 703 is modified to the union of the operations of the two matched

variable symbols

702 and 704.

The method further includes performing the operation related to the first variable symbol using at least the operation related to the third variable symbol in a case where it is determined that the operation related to the first variable symbol depends on the operation related to the third variable symbol. It can be obtained from Table 1 that the operations related to the first variable symbol depend on the operations related to the third variable symbol including at least one of the following: access to the first variable symbol depends on the definition of the third variable symbol, The access of the first variable symbol depends on the declaration, definition or assignment of the third variable symbol, the assignment of the first variable symbol depends on the declaration or definition of the third variable symbol, and the destruction of the first variable symbol depends on The declaration or definition of the third variable symbol. According to an embodiment of the present disclosure, the recognition of the third variable symbol causes the state of the variable represented by the third variable symbol to change from false to true, so that the variable no longer involves undefined references. Therefore, it can be determined based on this that the operation related to the first variable symbol depends on the operation related to the third variable symbol. Take Figure 7 as an example for illustration. For example, since the "US Revenue=$567,890" input later gives the definition of the variable "US Revenue", the variable "US Revenue" no longer involves undefined references. FIG. 21 shows an example of performing a prior access using a subsequent definition according to an embodiment of the present disclosure. As shown in Figure 21, when the input line "Product Sales={iPhoneSales}+{iPadSales}+{Mac Sales}", due to the variable symbols "iPhone Sales", "iPad Sales", "Mac Sales" on the right side of the equation Sales" are not defined, so they all involve undefined references. After continuing to input the three lines "iPhoneSales=$23,456", "iPadSales=$23,456", and "MacSales=$23,456", the definition of the variables represented by the three variable symbols is completed. Here, the subsequent definition operation of the variable is used to perform the previous access operation, so that "Product Sales" can obtain the value "$70,368" through these access operations (see the table on the right in Figure 21).

According to an embodiment of the present disclosure, the variable represented by the variable symbol in the variable symbol table can be updated according to the matching of the new variable symbol. FIG. 9 shows an example of updating the variable symbol table and the variable table according to an embodiment of the present disclosure. As shown in Figure 9, if the variable symbol "c" 902 in the variable symbol table is successfully matched to the variable symbol "c" 901, and the variable symbol "c" 902 points to the variable "c" 904 in the variable table, the variable symbol "c" "901 points to an empty variable "c" 903 in the variable table, you can delete the empty variable "c" 903 in the variable table, and make the variable symbol "c" 901 in the variable symbol table point to the variable " c" 904, and make the variable "c" 904 in the variable table point to the variable symbol "c" 901 in the variable symbol table. According to another embodiment of the present disclosure, the variable symbol "c" 902 of the variable symbol table is a newly input variable symbol. When it is successfully matched to the variable symbol "c" 901, the variable symbol "c" 902 can be directly made to point to the variable The empty variable "c" 903 in the table and the empty variable "c" 903 point to the variable symbol "c" 902, in addition, the type of the empty variable "c" 903 is modified from "null" to "int". This embodiment does not need to create or delete any empty variables.

According to an embodiment of the present disclosure, for languages such as Python and C++ that have strong requirements on the order of execution, processing undefined references includes generating a second program code, and the second program code is adjusted relative to the original program code to include the first variable The position of one or more variable symbol statements in the program code is such that the sequence of operations on the variables in the adjusted second program code conforms to the sequence required by the programming language. According to this embodiment, after determining that the first variable symbol relates to an undefined reference, the method in FIG. 2 may further include continuing to identify the third variable symbol from the received character stream and storing information related to the third variable symbol, wherein The third variable symbol represents the first variable. The method further includes matching a third variable symbol with at least one variable symbol previously identified from the program code to determine whether there is a variable symbol representing the first variable in the at least one variable symbol. The execution of the above steps is the same as the corresponding steps described above. The method further includes finding at least the first variable symbol that represents the first variable with the third variable symbol through the matching, and in response to determining that the operation related to the first variable symbol depends on the operation related to the third variable symbol, adjusting The position of at least one of the statement containing the first variable symbol and the statement containing the third variable symbol in the program code is to eliminate the undefined reference. The following C language program code A is taken as an example for description.

int a;

a=1;

c++;

int b=a+c;

int c=0;

c=2;

For the above-mentioned original program code A, according to the method of the present disclosure, it is first determined that the "c" in "c++" and the "c" (first variable symbol) in "int b=a+c" involve undefined references, Then it will be determined that the "c" in "int c=2" and the "c" (the third variable symbol) in "c=2" match the above-mentioned variable symbols involving undefined references. In this case, you can use The operations "declaration, definition, assignment" related to the third variable symbol execute the operations "c++" and "int b=a+c" related to the first variable symbol, that is, "access".

At this time, it is necessary to adjust the positions of the statements "c++", "int b=a+c", "int c=0", and "c=2" in the program code that contain the variable symbol representing the first variable to Generate the following second program code B or C:

Table 2

According to an embodiment of the present disclosure, the adjusted program code can be compiled and executed or interpreted and executed. As shown in the above example, the sequence of operations on the variable c in the two adjusted program codes B and C conforms to the sequence required by the C language, so that they can be compiled and executed. According to an embodiment of the present disclosure, there is a one-to-one correspondence between the statements in the adjusted program code and the statements in the program code. In addition, the adjusted program code can also be displayed to the user through a graphical user interface. In one embodiment, on the graphical user interface, the first program code and the second program code can be displayed at the same time. FIG. 25 shows an example of displaying the adjusted program code to the user according to an embodiment of the present disclosure. As shown in FIG. 25, the original program code 2701 is adjusted to generate a second program code 2702, and each line in the second program code 2702 corresponds to a line with the same content in the original program code 2701 in a one-to-one correspondence. For example, the “int c=0;” row 2704 in the second program code 2701 corresponds to the “int c=0;” row 2703 in the original program code 2701.

According to an embodiment of the present disclosure, when the user selects a statement in the original program code, the corresponding statement in the second program code is highlighted; and when the user selects a statement in the second program code, the original program The corresponding statement in the code is highlighted. FIG. 26 shows an example of the correspondence between source program codes and adjusted program codes according to an embodiment of the present disclosure. As shown in Figure 26, when the user clicks the "int c=0;" line 2802 in the second program code, the corresponding "int c=0;" line 2801 in the original program code is highlighted.

According to an embodiment of the present disclosure, the adjustment is automatically performed according to a predefined rule or according to a prediction result of a machine learning model. In the embodiment of adjusting the position of the program code line according to the predefined rules, for example, the statement containing the operation of the declaration of the variable (for example, "int c=0") can be adjusted to all the statements containing the variable symbol representing the variable Before, that is, adjust to the previous line of "c=2;", "c++;", and "int b=a+c;". In the embodiment in which the position of the program code line is adjusted according to the prediction result of the machine learning model, a machine learning model that predicts the position of the undefined reference in the second program code can be constructed. For example, the machine learning model can be a recurrent neural network, which inputs each line of the original program code in order, extracts the variable symbol in each line of the sentence, the variable represented by the variable symbol, and the operation performed on the variable symbol , The location of the variable symbol, the location of the statement in the program code, whether the statement contains undefined references and other features, based on these features, predict the location of each line of the original program code in the second program code, and according to the machine The prediction result of the learning model generates a second program code. For example, in the above example, since the statement "int c=0;" defines and assigns the variable while declaring the variable, according to the results of machine learning, the operation of reassigning the variable "c" The probability of ="2" is smaller than the probability of the operation "c++" that accesses this variable. Based on this prediction, the above-mentioned program code C should be generated.

According to an embodiment of the present disclosure, the sequence of the displayed statements in the adjusted program code can be manually adjusted by the user. If the user is not satisfied with the automatic adjustment of the sequence of program statements by the system, the user can manually change the position in the second program code of the statements with undefined references on the interactive interface. Specifically, the original program code and the second program code can be displayed at the same time in the graphical user interface, and the original program code contains the statements that involve undefined reference variable symbols, and the user can manually Adjust the position of these highlighted sentences.

According to an embodiment of the present disclosure, when a sentence is selected when the user manually adjusts the sequence of the sentences in the adjusted program code, the user is prompted to at least one position in the program code to which the sentence can be moved . FIG. 27 shows an example in which a user manually adjusts the order of program statements according to an embodiment of the present disclosure. As shown in Fig. 27, suppose that the upper right corner of Fig. 27 is the second program code B automatically generated by the system, but the user is not satisfied with the adjustment result. At this time, the user selects the program sentence "c=2" 2902, and the sentence 2901 corresponding to "c=2" in the original program code is highlighted. According to an embodiment of the present disclosure, when the user selects a program statement in the second program code, the user is prompted to a possible position to which the program statement can be moved. For example, in FIG. 27, when "c=2" 2902 in the second program code is selected, multiple positions 2903 to which it can be moved are displayed. At this time, the user can drag the sentence "c=0" to manually adjust it to the target position 2904. Therefore, the program code B automatically generated by the system is manually adjusted to the program code C by the user.

According to an embodiment of the present disclosure, when there are multiple previous variable symbols whose similarity with the name of the newly recognized variable symbol is higher than a threshold, the multiple symbols are displayed to the user in the list in descending order of similarity. A preceding variable symbol. This process is the same for fuzzy matching of the first variable symbol with the second variable symbol and fuzzy matching of the third variable symbol with the first variable symbol. As mentioned above, if fuzzy matching is used when matching variable symbols, the user needs to be prompted. For example, when matching "Revenue" and "Sales", a prompt box needs to be shown to the user. In some implementations, when there are multiple fuzzy matching options, a prompt box may be displayed for the user to select. At this time, a temporary table can be created, and multiple variable symbols with a high degree of similarity (for example, similarity of names) to a variable symbol are added to the temporary table. In some implementations, a similarity threshold can be set, and when the similarity between the names of the variable symbols exceeds the threshold, the matched variable symbols are added to the temporary table. The system sorts all variable symbols in the temporary table. One way of sorting is to sort from high to low based on similarity. Then, some or all of the variable symbols of the ordered temporary table are shown to the user. For example, in an application scenario, the variable symbols that are highly similar to the variable symbol "Revenue" are "Total Revenue", "Revenue per User", "revenue", "Revenue", "Sales", "Cost of Revenue" , The sorted results in this temporary table are "Revenue", "Total Revenue", "revenue", "Revenue per User", "Sales", and "Cost of Revenue". If you choose to display only a part of the sorted temporary table to the user, the displayed part can be "Revenue", "Total Revenue", and "revenue".

In some implementations, the user can manually confirm or modify the variable symbol matching result. For fuzzy matching variable symbols, the user can select a fuzzy matching result in the prompt box of the fuzzy matching result to confirm that it matches the currently entered variable symbol. FIG. 15 shows an example in which a user selects a fuzzy matching result according to an embodiment of the present disclosure. As shown in Figure 15, for example, if the user enters the variable "Revenue", the variable symbols in the displayed fuzzy matching result 1501 include "Total Revenue", "revenue", "Revenue per User", "Sales", "Cost of Revenue" ". The user can move the cursor 1502 and press the "Enter" key to select a variable symbol, or use the mouse 1504 to click the variable symbol 1503 in the prompt box. When the user selects the variable symbol "revenue" 1503, the system will match "revenue" with the currently input variable symbol "Revenue".

According to an embodiment of the present disclosure, in response to the user selecting one of the plurality of matching variable symbols in the list, the name of the currently input variable symbol in the program code is modified to the selected matching variable The name of the symbol. According to another embodiment of the present disclosure, in response to the user selecting one of the plurality of matching variable symbols in the list, it is confirmed that the currently input variable symbol and the selected variable symbol represent the same variable, and the user is prompted to unify the current The input variable symbol and the name of the selected variable symbol. In some implementations, the system will prompt the user to modify the name of the variable symbol so that it can be strictly matched. FIG. 16 shows an example of changing the name of a variable symbol according to a matching result according to an embodiment of the present disclosure. For example, in Figure 16, if the user selects the variable symbol "revenue" 1603 in the prompt box, the "r" in "revenue" is highlighted 1602. The "R" in the currently entered variable symbol "Revenue" is also highlighted 1601. At this time, if the user presses the "Tab" key, the currently entered variable symbol is modified to "revenue" 1604; and if the user presses the "Shift+Tab" key, the selected variable symbol "revenue" will be modified This is the variable symbol "Revenue" 1605 currently entered.

When the variable symbol entered by the user matches other variable symbols in the variable table successfully, the system prompts the user. Depending on the matching method, the system prompts differently. According to an embodiment of the present disclosure, when it is determined that the currently input variable symbol and the previously recognized variable symbol represent the same variable, the user is prompted. When the matching result is a strict match, the system automatically points these two variable symbols to the same variable in the variable table, and prompts the user that the system has automatically matched the two variable symbols. Fig. 12 shows an example of a strict matching prompt according to an embodiment of the present disclosure. As shown in Figure 12, for example, the currently entered program code is "int x=aa+b*2;" the variable symbol "aa" in 1202 and the variable symbol "aa" in the previously entered "int aa=3;" When strictly matching, the system automatically points the two variable symbols in the variable symbol table to the same variable in the variable table. Then, a prompt box pops up near the currently entered variable symbol "aa", and the content in the prompt box is "match int aa=3;" 1201. The "aa" in the message box can be highlighted, for example, the message box can fade out and disappear after three seconds. When performing rule-based matching, the system can still automatically point these two variable symbols to the same variable in the variable table, and prompt the user that the system has automatically matched the two variable symbols according to the rules. FIG. 13 shows an example of a prompt for rule-based matching according to an embodiment of the present disclosure. As shown in Figure 13, for example, in the SMALL language, if you enter the formula "={US Revenue}+{China Revenue}" 1301 in the "Revenue" line on line 32, but two names have been created in the same namespace The line of "US Revenue" (the above three variable symbols are respectively called "US Revenue[1]" on line 32, "US Revenue[2]" on line 18, and "US Revenue[3]" on line 6 ), then determine which of the rows represented by "US Revenue[2]" and "US Revenue[3]" is closer to the row "US Revenue[1]" 1302. Match the most recent row with "US Revenue[1]". For example, when "US Revenue[2]" and "US Revenue[1]" are closer, point these two variable symbols to the same variable in the variable table. Then, a prompt box pops up near the variable symbol "US Revenue[1]", the content of the prompt box can be "Match US Revenue, line 18" 1303, for example, the message box can fade out and disappear after three seconds.

When performing fuzzy matching, the system will not automatically point the two matched variable symbols to the same variable in the variable table, but will prompt the user with the result of the fuzzy matching, reminding the user that the variable symbol currently entered may be in the variable symbol table. Some of the items match. Fig. 14 shows a hint example of fuzzy matching according to an embodiment of the present disclosure. As shown in Figure 14, for example, in the SMALL language, the fuzzy matching result of the variable symbol "Revenue" input by the user includes the variable symbols "Total Revenue", "revenue", "Revenue per User", "Sales", "Cost of Revenue" ". The system pops up a display box 1401 below the variable symbol "Revenue", and displays the result of fuzzy matching in the prompt box. The cursor can move between the variable symbols in the prompt box. When the cursor moves to a variable symbol, the variable symbol is displayed 1402 in a specific way to distinguish it from other variable symbols.

According to an embodiment of the present disclosure, providing visual assistance to the user may include displaying a list on a graphical user interface, the list showing the user all variable symbols related to undefined references in the program code and including the first variable symbol. The graphical user interface can provide the user with a visual variable symbol table and some key information in the variable table, so that the user can understand the dynamic change process of these key information. An undefined reference variable is a variable whose status is "undefined reference" in the variable table. The variable symbol corresponding to the undefined reference variable can be displayed in a table called "undefined reference table" in the graphical user interface. When the variable symbol table and the variable table change, the undefined reference table displayed in the graphical user interface also changes accordingly. In some implementations, there are multiple types of "undefined references". For example, in C++, there are "undeclared variable assignment", "uninitialized variable access", etc., and different types of undefined variables can be displayed in different formats. For example, when successively inputting "a=1;", "int c;" and "int b=d+c;", the system judges that the variable symbol "a" in "a=1;" is "undeclared variable assignment" ", "int b=d+c;" in the variable symbol "d" is "undeclared variable access", and the variable symbol "c" is "uninitialized variable access". These three types of undefined references can be displayed in different ways in the undefined reference table. FIG. 17 shows an example of an undefined reference table according to an embodiment of the present disclosure. As shown in FIG. 17, in the undefined reference table 1701, "undeclared variable assignment" is displayed 1702 in light gray, "undeclared variable access" is displayed 1703 in white, and "uninitialized variable access" is displayed 1704 in dark gray.

In some implementations of the present invention, the undefined reference table can be hidden at the edge of the editor, and the undefined reference table is displayed when the mouse moves to the edge of the editor. The user can also press the button to make the undefined reference list always displayed. FIG. 18 shows a display example of an undefined reference table according to an embodiment of the present disclosure. As shown in FIG. 18, the content shown in the undefined reference table 1801 is the variable symbol and its input location related to the undefined reference. When the mouse or cursor moves to the area 1802 where the variable symbol "Cash" in the undefined reference table is located, the area where the variable symbol is located is highlighted. When you click or select the variable symbol "Cash" 1802 in the undefined reference table, the edit cursor in the input area will jump to the position 1803 where the variable symbol is entered, and the variable symbol will be displayed in a specific way in the input area , To distinguish it from other variable symbols. When the input content involves an undefined reference variable, the undefined reference list will pop up, and the system will add the referenced undefined variable symbol and its location to the undefined reference list. After adding, the undefined reference table can be automatically hidden. FIG. 19 shows a display example of an undefined reference table according to an embodiment of the present disclosure. According to an embodiment of the present disclosure, in response to determining through the matching that both the third variable symbol and the first variable symbol represent the first variable, in the graphical user interface a list including the variable symbol involving an undefined reference Highlight the first variable symbol that matches successfully. As shown in Figure 19, when the undefined variable symbol is quoted again in the input content, for example, when "int x=aa" 1904 is input and then "int y=aa+c;" 1905 is input, and "aa" is not defined When entering "aa" for the second time, the undefined reference list 1901 will pop up. The previously entered variable symbol "aa" 1902 (corresponding to code 1904) is highlighted, prompting to match the variable symbol "aa" 1903 (corresponding to code 1905) entered later.

According to an embodiment of the present disclosure, in response to detecting from the variable table that the first variable represented by the first variable symbol becomes defined, the first variable is deleted from the list showing all variable symbols involved in undefined references in the program code. A variable symbol. In other words, when the displayed undefined reference variable is defined later, the system deletes the variable symbol from the undefined reference list of the graphical user interface. When the variable symbol in the input content includes the definition operation and is strictly matched to the previous variable symbol involving undefined reference, the undefined reference list pops up. The system deletes the variable symbol (which is defined at this time) involving undefined reference from the undefined reference table. FIG. 20 shows an example of deleting a defined variable symbol from an undefined reference table according to an embodiment of the present disclosure. As shown in Figure 20, after entering "int aa=3;" 2003, the variable symbol "aa" here strictly matches the two variable symbols "aa" involved in undefined references, and the system pops up the undefined reference table 2001 And the relevant "aa" variable symbol in the table is highlighted 2002, prompting it to match. Then, the system deletes 2004 both of the two "aa" variable symbols in the undefined reference table.

According to an embodiment of the present disclosure, providing visual assistance to the user may include displaying the variable table and the variable symbol table and the relationship between them on a graphical user interface. The variable symbols and variables in the variable symbol table and the variable table and their related information can be displayed in the graphical user interface, and the user can interact with the above two tables through the graphical user interface. FIG. 22 shows a display example of a variable symbol table and a variable table according to an embodiment of the present disclosure. Shown in Figure 22 is the input program code and the relationship between the variable symbol table, the variable table, and these two tables.

According to an embodiment of the present disclosure, providing visual assistance to the user may include displaying all the successfully matched variable symbols in the program code on a graphical user interface, and the displayed variable symbols that have been successfully matched can be modified by the user Its matching relationship. For strict matching and rule-based matching, the system allows users to modify the results of automatic matching, and match the currently entered variable symbol to other variable symbols. For example, if you enter the formula "={USRevenue}+{ChinaRevenue}" in the "Revenue" line on line 32, but two lines named "USRevenue" have been created in the same namespace (the above three variable symbols They are called "US Revenue[1]" on line 32, "US Revenue[2]" on line 18, and "US Revenue[3]" on line 6). The system automatically points "US Revenue[1]" on line 32 and "US Revenue[2]" on line 18 to the same variable in the variable table according to rule-based matching. The user can manually modify the variable symbol matched by "US Revenue[1]" to "US Revenue[3]" on the 6th line. The system can point the variable symbol "USRevenue[1]" to the same variable pointed to by "USRevenue[3]" in the variable table, and cancel USRevenue[2]" in the variable table pointed to by "USRevenue[1]" The variable pointed to.

According to an embodiment of the present disclosure, providing visual assistance to the user may include displaying the variable symbol table on a graphical user interface, and in response to the user selecting a variable symbol in the variable symbol table, the corresponding variable symbol in the program code is highlight. FIG. 23 shows a display example of a variable symbol table according to an embodiment of the present disclosure. As shown in Fig. 23, the graphical user interface 2301 displaying the variable symbol table displays information such as the names and positions of all variable symbols. When using the mouse or other selection methods to select a variable symbol 2302 in the variable symbol table in the graphical user interface, you can directly jump to the line where the variable symbol is entered in the program code, and change the corresponding variable symbol in the variable symbol table Entries are displayed 2302 in a special way (for example, using a different background color). At the same time, the area where the variable symbol is located in the input area can also be displayed 2304 in a special way.

According to an embodiment of the present disclosure, when the user inputs a wrong variable symbol name during input, the system can provide the user with an error correction function. When the user enters the wrong variable symbol name, the fuzzy matching function can still match the user with a variable symbol similar to the input variable symbol. The user can select a variable symbol in the fuzzy matching result and choose to correct the entered variable symbol name . The system automatically corrects the wrong variable symbol name to the name of the variable symbol selected by the user according to the user's selection. FIG. 24 shows an example of error correction according to an embodiment of the present disclosure. As shown in Figure 24, for example, when the user inputs the variable symbol name "Ravenue" 2401, the system detects that there may be an error in the user input, and highlights the "a" in "Ravenue" to prompt the input error. The result returned by fuzzy matching may be, for example, "Revenue", "Total Revenue", "revenue", "Revenue per User", and "Cost of Revenue" 2402. If the user selects "Revenue" 2403 in the fuzzy matching result, the system automatically corrects the wrong "Ravenue" variable symbol entered by the user to the "Revenue" 2404 selected by the user.

According to an embodiment of the present disclosure, the system can also provide variable naming specifications, and automatically correct variable symbol names according to the variable naming specifications. For example, in the SMALL language, because the programs written in this language are mostly used in the field of financial modeling, the variable names used are mostly accounting professional vocabulary, and the professional vocabulary has industry standards. The system and method of the present disclosure can provide users with specific naming conventions in accordance with relevant standards and specifications. When the variable name entered by the user does not conform to the specification, the system can give a prompt and recommend a variable name that conforms to the specification. If the user selects the recommended variable name, the system automatically replaces the variable name entered by the user with the selected variable name. For example, suppose a specification has the following rule: variable names should start with a capital letter. If the user enters the variable symbol "revenue", the system will prompt the user that the variable symbol does not conform to the naming convention, and recommend a variable symbol name that conforms to the naming convention, such as "Revenue". If the user selects the recommended "Revenue", the system replaces the previously entered "revenue" with "Revenue".

According to an embodiment of the present disclosure, according to the user's selection, the system does not perform real-time variable symbol matching when the user is inputting, and then batches matching variable symbols when the user completes the input. This method is also suitable for user input including loading all or part of the program from the storage device as user input. Users can modify the matching results in batches. For example, in the SMALL language, the user can save the entered program to a storage device such as a hard disk, and can later load the saved program from the storage device. When the program is loaded, the system batches match all variable symbols in the program, automatically recognize the variable symbols that meet strict matching and rule-based matching, and make them point to the same variable in the variable table. The system prompts the user with the result of the fuzzy matching, and assists the user to manually confirm whether it represents the same variable.

The method according to an embodiment of the present invention further includes parsing or executing a part of the program code, which does not include program statements that involve undefined references. The embodiments of the present disclosure support limiting the influence of undefined references on programs within a certain range, so that partial analysis of programs containing undefined references can be performed, and parts of programs not affected by undefined references can be processed normally. For example, in the SMALL language, if a row’s formula contains undefined references (for example, undefined access), in the generated spreadsheet, only the row’s formula is empty and the value is empty, but it does not affect the row’s The drawing in the spreadsheet and the format of the row do not affect the remaining rows in the spreadsheet. FIG. 21 shows an example of a partially executed program code according to an embodiment of the present disclosure. As shown in Figure 21, because 2101 refers to the undefined variable "China Revenue" 2102 in the row defined by the variable "Revenue", so in the generated spreadsheet 2103, except for the variable "Revenue" row 2104 and China Revenue" Except that the value of the row 2105 is empty, the rows of all other variables can be parsed and drawn normally.

The present invention can solve the problem that undefined variables cannot be referenced in the traditional technology. Using the method and system of the present invention to reference undefined variables is efficient and convenient for users. The reason for the efficiency is that the present invention can automatically record the undefined variable symbols referenced by the user, and automatically match the newly declared or defined variable symbols and their corresponding undefined references after the user's subsequent declarations or definitions of the variable symbols appear. Variable symbol. The reason for the convenience is that the present invention provides users with various input aids, undefined citation prompts, variable matching prompts, and other functions. In addition, with the present invention, when a part of the program code involves an undefined reference, the rest of the program code that does not involve an undefined reference can be interpreted and executed. In addition, with the present invention, in the case of undefined references in the program code, the user can be prompted to adjust the order of the statements in the code to make it conform to the compilation rules and thus can be successfully compiled and executed.

The present invention may be a system, a method and/or a computer program product. The computer program product may include a computer-readable storage medium loaded with computer-readable program instructions for enabling a processor to implement various aspects of the present invention.

According to an embodiment of the present disclosure, a computer system is provided. The computer system includes one or more processors and a memory coupled to the one or more processors. The memory stores computer instructions that, when executed by the one or more processors, cause the one or more processors to perform operations of the method in any of the above embodiments.

According to an embodiment of the present disclosure, a computer-readable storage medium is provided. The computer-readable storage medium stores computer instructions that, when executed by a processor, cause the processor to perform the method in any of the above embodiments.

The computer-readable storage medium may be a tangible device that can hold and store instructions used by the instruction execution device. The computer-readable storage medium may be, for example, but not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (non-exhaustive list) of computer-readable storage media include: portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM) Or flash memory), static random access memory (SRAM), portable compact disk read-only memory (CD-ROM), digital versatile disk (DVD), memory stick, floppy disk, mechanical encoding device, such as a printer with instructions stored thereon The protruding structure in the hole card or the groove, and any suitable combination of the above.

The computer-readable program instructions described herein can be downloaded from a computer-readable storage medium to various computing/processing devices, or downloaded to an external computer or external storage device via a network, such as the Internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, optical fiber transmission, wireless transmission, routers, firewalls, switches, gateway computers, and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network, and forwards the computer-readable program instructions for storage in the computer-readable storage medium in each computing/processing device .

The computer program instructions used to perform the operations of the present invention may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, status setting data, or in one or more programming languages. Source code or object code written in any combination, the programming language includes object-oriented programming languages such as Smalltalk, C++, etc., and conventional procedural programming languages such as "C" language or similar programming languages. Computer-readable program instructions can be executed entirely on the user's computer, partly on the user's computer, executed as a stand-alone software package, partly on the user's computer and partly executed on a remote computer, or entirely on the remote computer or server carried out. 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 connect to the user's computer) connection). In some embodiments, an electronic circuit, such as a programmable logic circuit, a field programmable gate array (FPGA), or a programmable logic array (PLA), can be customized by using the status information of the computer-readable program instructions. The computer-readable program instructions are executed to implement various aspects of the present invention.

Here, various aspects of the present invention are described with reference to flowcharts and/or block diagrams of methods, devices (systems) and computer program products according to embodiments of the present invention. It should be understood that each block of the flowcharts and/or block diagrams, and combinations of blocks in the flowcharts and/or block diagrams, can be implemented by computer-readable program instructions.

These computer-readable program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, or other programmable data processing device, thereby producing a machine that makes these instructions when executed by the processor of the computer or other programmable data processing device , A device that implements the functions/actions specified in one or more blocks in the flowcharts and/or block diagrams is produced.

The embodiments of the present invention have been described above, and the above description is exemplary, not exhaustive, and is not limited to the disclosed embodiments. Without departing from the scope and spirit of the illustrated embodiments, many modifications and changes are obvious to those of ordinary skill in the art. The choice of terms used herein is intended to best explain the principles, practical applications, or technical improvements of the technologies in the market, or to enable other ordinary skilled in the art to understand the embodiments disclosed herein.

Claims

A method for handling references to variables in program code, including:

Sequentially receiving the character stream contained in the user input, wherein the character stream is a part of the program code;

Identifying the first variable symbol from the received character stream and storing information related to the first variable symbol, where the first variable symbol represents the first variable;

Matching the first variable symbol with at least one variable symbol previously identified from the program code to determine whether there is a second variable symbol representing the first variable in the at least one variable symbol;

In response to determining that there is at least one second variable symbol, determining whether the first variable symbol involves an undefined reference according to operations related to the first variable symbol and operations related to the one or more second variable symbols; and

In response to determining that the first variable symbol relates to an undefined reference, visual assistance is provided to the user to process the undefined reference.
The method according to claim 1, further comprising: in response to determining that the second variable symbol does not exist, determining whether the first variable symbol involves an undefined reference according to an operation related to the first variable symbol.
The method according to claim 1, further comprising:

Continue to identify the third variable symbol from the received character stream and store information related to the third variable symbol, where the third variable symbol represents the first variable;

Matching the third variable symbol with at least one variable symbol previously identified from the program code to determine whether there is a variable symbol representing the first variable in the at least one variable symbol;

At least find the first variable symbol that represents the first variable with the third variable symbol through the matching; and

In the case where it is determined that the operation related to the first variable symbol depends on the operation related to the third variable symbol, at least the operation related to the third variable symbol is used to perform the operation related to the first variable symbol.
The method according to claim 1, further comprising parsing or executing a part of the program code that does not include the program statement including the first variable symbol.
The method according to claim 1, wherein the user input comprises one of the following inputs: at least a part of the program code edited and stored by the user, and at least a part of the program code generated by the user input action monitored by a text editor A part, and at least a part of the program code generated by the user's operation in the graphical user interface editor.
The method of claim 5, wherein providing visual assistance to the user includes one or more of the following: in a text editor or a graphical user interface editor, displaying a prompt box or highlighting near the first variable symbol The first variable symbol is displayed.
The method of claim 1, wherein identifying the first variable symbol from the received character stream comprises using one or more of a lexical analyzer or a machine learning classifier to identify the first variable from the received character stream symbol.
The method of claim 1, wherein identifying the first variable symbol from the received character stream comprises recognizing the character stream received from a specific component of the graphical user interface editor as the first variable symbol.
The method according to claim 1 or 3, wherein the information related to the variable symbol includes one or more of the following information: the name of the variable symbol, the position of the variable symbol in the program code, the namespace of the variable symbol, the variable The scope of the symbol, the type of the variable represented by the variable symbol, the variable represented by the variable symbol, and the operations related to the variable symbol.
The method according to claim 9, wherein information related to variable symbols is stored in a variable symbol table, and wherein the variable symbol table stores information related to each identified variable symbol in the program code.
The method according to claim 10, further comprising establishing a variable table and establishing a relationship between the variable symbol table and the variable table.
The method according to claim 11, wherein the variable table stores the state of the identified variable, and the state of the variable includes one or more of the following: a variable symbol representing the variable, the address of the variable in the memory, and the variable The operation performed, whether the variable is defined, and whether the variable is referenced.
The method according to claim 11, wherein establishing the relationship between the variable symbol table and the variable table comprises: for each variable symbol in the variable symbol table, storing the variable in the variable table it represents; for each variable symbol in the variable table Each variable stores the variable symbols in the variable symbol table that can represent it.
The method according to claim 9, wherein, in a graphical user interface editor environment, the position of the variable symbol in the program code is obtained by the position of the component where the variable symbol is input, and the namespace of the variable symbol is based on the input of the variable The structural relationship between the component of the symbol and other components or the path of the variable symbol specified by the user is obtained. The scope of the variable symbol is obtained by the structural relationship between the component of the variable symbol and other components. The type of the variable represented by the variable symbol is created by creating The information of the component when the variable is obtained, and the operation related to the variable symbol is obtained through the user's corresponding operation in the graphical user interface editor.
The method according to claim 9, wherein the position of the variable symbol in the program code is represented by a tuple representing the position of the variable symbol in the program code, and the namespace of the variable symbol, the scope of the variable symbol, and the variable symbol The type of the variable represented by the symbol and the operations related to the variable symbol are obtained by grammatically analyzing the context of the variable symbol.
The method according to claim 9, wherein matching the first variable symbol with at least one variable symbol previously identified from the program code comprises: when the stored first variable symbol and the at least one variable symbol When the name, namespace, scope, and type of the variable represented by the second variable symbol are all the same, it is determined that the first variable symbol and the second variable symbol represent the same variable.
The method according to claim 9, wherein matching the first variable symbol with at least one variable symbol previously identified from the program code comprises: when the first variable symbol and a plurality of the at least one variable symbol When the names of the second variable symbols are the same, the first variable symbol and which second variable symbol represents the same variable are determined according to a predefined rule.
The method according to claim 17, wherein the predefined rule comprises matching the first variable symbol and the nearest second variable symbol of the same name to represent the same variable.
The method according to claim 9, wherein matching the third variable symbol with at least one variable symbol previously identified from the program code comprises: when the stored third variable symbol and the name, naming of the first variable symbol When the space, scope, and types of the variables represented are the same, it is determined that the third variable symbol and the first variable symbol represent the same variable.
The method according to claim 9, wherein matching a third variable symbol with at least one variable symbol previously identified from the program code comprises: when the third variable symbol and a plurality of the at least one variable symbol When the names of the variable symbols are the same, the third variable symbol and which variable symbol represents the same variable are determined according to predefined rules.
The method according to claim 18, wherein the predefined rule comprises matching the third variable symbol with the nearest first variable symbol of the same name to represent the same variable.
The method according to claim 9, wherein matching the first variable symbol with at least one variable symbol previously identified from the program code comprises: when the information related to the first variable symbol is related to the at least one variable symbol When the similarity between the information related to the second variable symbol in the symbol is higher than the threshold, the user is prompted to confirm whether the first variable symbol and the second variable symbol represent the same variable.
The method of claim 9, wherein matching the third variable symbol with at least one variable symbol previously identified from the program code comprises: when the information related to the third variable symbol is related to the first variable symbol When the similarity between the information is higher than the threshold, the user is prompted to confirm whether the third variable symbol and the first variable symbol represent the same variable.
The method according to claim 22 or 23, wherein the similarity can be obtained by one or more of the following: edit distance between variable symbol names, semantic similarity between variable symbol names, variable symbol naming The similarity between the spaces, the containment relationship between the scopes of the variable symbols, and the distance between the positions of the variable symbols in the program code.
22. The method according to claim 22, wherein when the user confirms that the same variable is represented, the variable represented by the first variable symbol is stored as the same variable represented by the second variable symbol in the variable symbol table.
23. The method according to claim 23, wherein when the user confirms that the same variable is represented, the variable represented by the third variable symbol is stored as the same variable represented by the first variable symbol in the variable symbol table.
The method according to claim 22, wherein when the user confirms that the same variable is represented, the name and namespace of the first variable symbol and the second variable symbol are changed to be the same.
The method according to claim 23, wherein when the user confirms that the same variable is represented, the names and namespaces of the third variable symbol and the first variable symbol are changed to be the same.
The method of claim 13, wherein, in response to the information related to the variable symbols being stored in the variable symbol table, the variable symbols are matched with previously stored variable symbols one by one.
The method according to claim 13, wherein the index is established in the variable symbol table by the hash value of the name of the variable symbol, and wherein, in response to the information related to the variable symbol being stored in the variable symbol table, the The index matches the variable symbol with the previously stored variable symbol.
The method according to claim 3, wherein each of the operation related to the first variable symbol, the operation related to the second variable symbol, and the operation related to the third variable symbol includes at least one of the following: declaration , Definition, initialization, assignment, access, and destruction.
The method according to claim 31, wherein the operation related to the first variable symbol depends on the operation related to the third variable symbol comprises at least one of the following: access to the first variable symbol depends on the third variable symbol The definition of the first variable symbol depends on the declaration, definition or assignment of the third variable symbol, the assignment of the first variable symbol depends on the declaration or definition of the third variable symbol, and the access to the first variable symbol The destruction depends on the declaration or definition of the third variable symbol.
The method according to claim 1, wherein the program code is written in a compiled language, an interpreted language, or a language used to build a spreadsheet model.
22. The method according to claim 22, wherein when there are a plurality of second variable symbols whose similarity with the name of the first variable symbol is higher than a threshold, the user is displayed in the list in descending order of the similarity. Multiple second variable symbols.
The method according to claim 34, wherein, in response to the user selecting one of the plurality of second variable symbols in the list, the name of the first variable symbol in the program code is modified to the selected first variable symbol The name of the two variable symbol.
The method of claim 34, wherein, in response to the user selecting one of the plurality of second variable symbols in the list, confirming that the first variable symbol and the selected second variable symbol represent the same variable, and prompting The user unifies the names of the first variable symbol and the selected second variable symbol.
23. The method according to claim 23, wherein when there are a plurality of variable symbols containing the first variable symbol whose similarity with the name of the third variable symbol is higher than a threshold value, they are listed in descending order of the similarity. The user displays the plurality of variable symbols.
The method of claim 37, wherein, in response to the user selecting the first variable symbol in the list, the name of the third variable symbol in the program code is modified to the name of the selected first variable symbol, or The name of the first variable symbol in the program code is modified to the name of the third variable symbol.
The method according to claim 37, wherein, in response to the user selecting the first variable symbol in the list, confirming that the third variable symbol and the selected first variable symbol represent the same variable, and prompting the user to unify the third variable symbol and The name of the selected first variable symbol.
The method of claim 3, wherein providing visual assistance to the user includes displaying a list on the graphical user interface, the list showing the user all variable symbols in the program code that involve undefined references and include the first variable symbol.
40. The method according to claim 40, further comprising: in response to determining through the matching that the third variable symbol and the first variable symbol both represent the first variable, highlighting the successful matching in the list on the graphical user interface The first variable symbol.
The method of claim 11, wherein providing visual assistance to the user comprises displaying the variable table and the variable symbol table and the relationship between them on a graphical user interface.
The method according to claim 1, wherein providing visual assistance to the user comprises displaying all variable symbols in the program code that have been successfully matched on a graphical user interface.
The method according to claim 43, wherein the displayed variable symbols that have been successfully matched can be modified by the user.
The method according to claim 16 or 17, further comprising: prompting the user when it is determined that the first variable symbol and the second variable symbol represent the same variable.
The method according to claim 19 or 20, further comprising: prompting the user when it is determined that the third variable symbol and the first variable symbol represent the same variable.
The method according to claim 12, wherein the operation performed by one variable in the variable table is equal to a union of operations related to each of the at least one variable symbol representing the variable.
The method according to claim 47, further comprising: judging whether the variable is defined according to the operations included in the union.
The method according to claim 48, further comprising: in response to detecting from the variable table that the first variable represented by the first variable symbol becomes defined, displaying all variable symbols in the program code involving undefined references Delete the first variable symbol from the list.
The method according to claim 1 or 2, further comprising:

Continue to identify the third variable symbol from the received character stream and store information related to the third variable symbol, where the third variable symbol represents the first variable;

Matching the third variable symbol with at least one variable symbol previously identified from the program code to determine whether there is a variable symbol representing the first variable in the at least one variable symbol;

At least find the first variable symbol that represents the first variable with the third variable symbol through the matching; and

In response to determining that the operation related to the first variable symbol depends on the operation related to the third variable symbol, adjusting at least one of the statement containing the first variable symbol and the statement containing the third variable symbol in the program code Position to eliminate the undefined reference.
The method according to claim 50, wherein the adjustment is performed automatically according to a predefined rule or according to a prediction result of a machine learning model.
The method according to claim 50, further comprising displaying the adjusted program code, wherein there is a one-to-one correspondence between the statements in the adjusted program code and the statements in the program code.
The method according to claim 52, wherein the sequence of the displayed sentences in the adjusted program code can be manually adjusted by the user.
The method according to claim 53, wherein when a sentence is selected when the user manually adjusts the sequence of the sentences in the adjusted program code, the user is prompted to at least one of the program codes to which the sentence can be moved A location.
The method according to claim 52, wherein the adjusted program code can be compiled and executed or interpreted and executed.
The method according to claim 10, wherein providing visual assistance to the user comprises displaying the variable symbol table on a graphical user interface, and wherein in response to the user selecting a variable symbol in the variable symbol table, the corresponding in the program code The variable symbol is highlighted.
A computer system including:

One or more processors; and

A memory coupled to the one or more processors, the memory storing computer instructions that, when executed by the one or more processors, cause the one or more processors to execute according to the right The operation of the method described in any one of 1 to 56 is required.
A computer-readable storage medium storing computer instructions that, when run by a processor, cause the processor to execute the method according to any one of claims 1 to 56.