CN116360788A - Compiling method, compiler and electronic device for structured text programming language - Google Patents

Abstract

The application is suitable for the technical field of language compiling, and provides a compiling method, a compiler and electronic equipment for a structured text programming language. The compiling method comprises the following steps: dividing a source program to be compiled into one or more segmentation words based on a preset lexical rule, carrying out grammar analysis on each segmentation word based on a preset grammar rule, and determining a target grammar tree with correct grammar based on the segmentation words with correct grammar; generating target codes corresponding to the source program based on the target grammar tree; determining first memory addresses of all the word segmentation based on a preset memory allocation algorithm, and performing memory optimization on all the first memory addresses; compiling the target code based on all the first memory addresses after the memory optimization to obtain a compiling result of the source program. The compiling method can compile the structured text programming language without converting the structured text programming language into the C language, can save the time for converting the structured text programming language into the C language, and improves the compiling efficiency of the structured text programming language.

Description

Compilation method, compiler and electronic device for structured text programming language

technical field

The application belongs to the technical field of language compiling, and in particular relates to a compiling method of a structured text programming language, a compiler and electronic equipment.

Background technique

The IEC61131-3 international standard formulated by the International Electrotechnical Commission (International Electrotechnical Commission, IEC) defines five standard programming languages, namely the Ladder (Ladder, LAD) programming language, the Function Block Diagram (Function Block Diagram, FBD) programming language, Sequential Function Chart (Sequential FunctionChart, SFC) programming language, instruction list (Instruction List, IL) programming language and structured text (StructuredText, ST) programming language. Among them, the ST programming language is similar to the C language, has the characteristics of simple syntax and compact code structure, and is very suitable for writing complex control logic.

At present, the commonly used compilation method of the ST programming language is to convert the ST programming language into C language, and then compile the C language into machine code through the GNU Compiler Collection (GCC). The conversion time of the ST programming language into the C language, thus resulting in low compilation efficiency of the ST programming language.

Contents of the invention

In view of this, the embodiments of the present application provide a method for compiling a structured text programming language, a compiler and an electronic device, so as to solve the existing technical problem of low compiling efficiency of the ST programming language.

In the first aspect, the embodiment of the present application provides a method for compiling a structured text programming language, including:

Divide the source program to be compiled into one or more word segmentations based on preset lexical rules;

performing grammatical analysis on each of the word segmentations based on preset grammatical rules, and determining a grammatically correct target syntax tree based on the analyzed grammatically correct word segmentation;

generating an object code corresponding to the source program based on the object syntax tree;

determining the first memory address of each of the word segments based on a preset memory allocation algorithm, and performing memory optimization on each of the first memory addresses;

Compile the target code based on all the first memory addresses after memory optimization to obtain a compilation result of the source program.

Optionally, the word segmentation type of the word segmentation includes comment symbols, identifier symbols, keywords, variables, numerical literals, arithmetic symbols, array symbols and/or end symbols;

Correspondingly, dividing the source program to be compiled into one or more word segmentations based on preset lexical rules includes:

performing lexical analysis on the source program based on a preset recognition function; the preset recognition function is constructed based on preset lexical rules;

Based on the result of the lexical analysis, the source program is divided into one or more word segmentation types including comment symbols, identifier symbols, keywords, variables, numerical literals, arithmetic symbols, array symbols and/or end symbols.

Optionally, the generating a correct target syntax tree based on the analyzed grammatically correct word segmentation includes:

generating a first syntax tree based on the grammatically correct word segmentation;

Perform semantic analysis on the first syntax tree, and determine the target syntax tree based on a result of the semantic analysis.

Optionally, performing semantic analysis on the first syntax tree, and determining the target syntax tree based on the semantic analysis result includes:

performing a type check on the first syntax tree based on a preset semantic analysis function, and determining semantically incorrect word segmentation and semantically correct word segmentation in the first syntax tree;

Based on all the semantically correct participles in the first grammatical tree, update the data type corresponding to each participle in the first grammatical tree;

Determine the target syntax tree based on all the semantically correct word segmentations in the first syntax tree and the updated data types corresponding to each of the word segmentations

Optionally, also include:

Semantic correction is performed on the word segmentation with semantic error in the first syntax tree, and the word segmentation with semantic error is corrected into a word segmentation with correct semantics.

Optionally, the preset memory allocation algorithm includes a static memory allocation algorithm and a dynamic memory allocation algorithm; determining the first memory address of each word segment based on the preset memory allocation algorithm includes:

Determining the first data type of each of the word segmentations; the first data type includes a directly specified address type and an indirect specified address type;

Each of the first data type is the preset memory address of the first participle of the directly specified address type respectively determined as the first memory address of each of the first participle; the preset memory address is pre-based on the The memory address allocated by the static memory allocation algorithm for each of the word segmentations;

Based on the dynamic memory allocation algorithm, each of the first data types is determined as a first memory address of a second word segment of the non-directly specified address type.

Optionally, based on the dynamic memory allocation algorithm, determining that each of the first data types is the first memory address of the second participle of the non-directly specified address type includes:

Determining the second data type of each of the second participle; the second data type includes a direct representation variable type and an indirect representation variable type;

Based on each of the second data types, determine the corresponding first memory address of the second participle for the memory address marker of the second participle that directly represents the variable type; each of the memory address markers corresponds to the corresponding a different area in the first memory address;

Determine the corresponding first memory address of the second participle based on the participle type of the second participle that each of the second data type is a second participle that does not directly represent the variable type; each participle type corresponds to the first memory address of a different region.

In the second aspect, the embodiment of the present application provides a compiler for a structured text programming language, including:

a first segmentation unit, configured to segment the source program to be compiled into one or more word segments based on preset lexical rules;

The first determining unit is configured to perform grammatical analysis on each of the word segmentations based on preset grammatical rules, and determine a grammatically correct target syntax tree based on the analyzed grammatically correct word segmentation;

a first generating unit, configured to generate an object code corresponding to the source program based on the object syntax tree;

The second determination unit is configured to determine the first memory address of each of the word segmentations based on a preset memory allocation algorithm, and perform memory optimization on each of the first memory addresses;

The first compiling unit is configured to compile the target code based on all the first memory addresses after memory optimization, and obtain a compiling result of the source program.

In a third aspect, an embodiment of the present application provides an electronic device, including a memory, a processor, and a computer program stored in the memory and operable on the processor, and the computer program is implemented when the processor executes the computer program. The steps in the compilation method are as described in any one of the above first aspects.

In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium. The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the compilation described in any one of the above-mentioned first aspects is implemented. steps in the method.

In the fifth aspect, the embodiment of the present application provides a computer program product, which, when the computer program product is run on the terminal device, enables the terminal device to execute the method described in the first aspect or any optional mode of the first aspect each step.

The compilation method, compiler and electronic equipment of the structured text programming language provided by the embodiment of the present application have the following beneficial effects:

The method for compiling a structured text programming language provided by the embodiment of the present application divides the source program to be compiled into one or more word segments based on preset lexical rules, performs grammatical analysis on each segment based on preset grammatical rules, and based on the analysis The grammatically correct word segmentation determines the grammatically correct target syntax tree; generates the target code corresponding to the source program based on the target syntax tree; determines the first memory address of each word segmentation based on the preset memory allocation algorithm, and performs memory for each first memory address Optimizing: compiling the target code based on all the first memory addresses after memory optimization, so as to obtain a compilation result of the source program. In this way, the method for compiling the structured text programming language provided by the embodiment of the present application can realize the direct compilation of the structured text programming language, without converting the structured text programming language into C language and then compiling it, thereby enabling The conversion time for converting the structured text programming language into the C language is saved, and the compilation efficiency of the structured text programming language is improved.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the accompanying drawings that need to be used in the descriptions of the embodiments or the prior art will be briefly introduced below. Obviously, the accompanying drawings in the following description are only for the present application For some embodiments, those of ordinary skill in the art can also obtain other drawings based on these drawings without paying creative efforts.

Fig. 1 is the implementation flowchart of a kind of compiling method of ST programming language that the embodiment of the application provides;

Fig. 2 is a kind of implementation flowchart that divides the source program to be compiled into one or more word segmentations provided by the embodiment of the present application;

FIG. 3 is an implementation flowchart of determining a grammatically correct target grammar tree based on the analyzed grammatically correct word segmentation provided by the embodiment of the present application;

FIG. 4 is a schematic diagram of a generated first syntax tree provided by an embodiment of the present application;

FIG. 5 is an implementation flow chart of determining the first memory address of each word segment based on a preset memory allocation algorithm provided by an embodiment of the present application;

FIG. 6 is a schematic structural diagram of a compiler for a structured text programming language provided by an embodiment of the present application;

FIG. 7 is a schematic structural diagram of an electronic device provided by an embodiment of the present application.

Detailed ways

It should be noted that the terms used in the embodiments of the present application are only used to explain the specific embodiments of the present application, and are not intended to limit the present application. In the description of the embodiments of the present application, unless otherwise specified, "plurality" refers to two or more than two, and "at least one" and "one or more" refers to one, two or more than two. The terms "first" and "second" are used for descriptive purposes only, and cannot be interpreted as indicating or implying relative importance or implicitly specifying the quantity of indicated technical features. Thus, the definition of "first" and "second" features may expressly or implicitly include one or more of these features.

Reference to "one embodiment" or "some embodiments" or the like in this specification means that a particular feature, structure, or characteristic described in connection with the embodiment is included in one or more embodiments of the present application. Thus, appearances of the phrases "in one embodiment," "in some embodiments," "in other embodiments," "in other embodiments," etc. in various places in this specification are not necessarily All refer to the same embodiment, but mean "one or more but not all embodiments" unless specifically stated otherwise. The terms "including", "comprising", "having" and variations thereof mean "including but not limited to", unless specifically stated otherwise.

The executing subject of the ST programming language compiling method provided in the embodiment of the present application may be an electronic device. Exemplarily, the electronic equipment may include a mobile phone, a tablet computer, a notebook computer, a desktop computer, and the like.

A compiler for the ST programming language may be installed in the electronic device. When the user wants to compile a source program of ST programming language, he can open the compiler in the electronic device, and input the source program of ST programming language to be compiled into the compiler of ST programming language, and trigger the compiler Compile button in . When the electronic device detects that the compiling button in the compiler is triggered, by executing each step of the compiling method of the ST programming language provided by the embodiment of the present application, the direct compiling of the ST programming language can be realized, so that there is no need to convert the ST programming language into The C language is then compiled to improve the compilation efficiency of the ST programming language.

Please refer to Fig. 1, Fig. 1 is the realization flow chart of a kind of ST programming language compiling method provided by the embodiment of the present application, the compiling method of this ST programming language may include S101～S105, detailed description is as follows:

In S101, the source program to be compiled is divided into one or more word segments based on preset lexical rules.

In a specific application, when the ST programming language needs to be compiled, the electronic device can obtain the source program of the ST programming language to be compiled.

Optionally, the manner in which the electronic device acquires the source program of the ST programming language to be compiled may be, for example, reading the source program of the ST programming language to be compiled from a compiler based on a character string.

After the electronic device obtains the source program of the ST programming language to be compiled, it can divide the source program to be compiled into one or more word segments based on preset lexical rules.

The preset lexical rules can be used to describe a segmentation strategy for segmenting the source code of the ST programming language into word segments. Exemplarily, the word segmentation type of the word segmentation may include comment symbols, identifier symbols, keywords, variables, numerical literals, four arithmetic operation symbols, array symbols and/or end symbols, and the like.

In a possible implementation manner, S101 can be implemented through S1011-S1012 as shown in Figure 2, and the details are as follows:

In S1011, perform lexical analysis on the source program based on a preset identification function.

Among them, the preset recognition function is constructed based on preset lexical rules, and is used to describe the relationship between characters and word segmentation in the ST programming language source program.

In this implementation, when the electronic device performs lexical analysis on the ST programming language source program based on the preset recognition function, it may sequentially determine whether each character in the ST programming language source program to be compiled is a null character. When a certain character is a non-null character, lexical analysis may be performed on the non-null character based on a preset recognition function to obtain a lexical analysis result of the non-null character. The lexical analysis results of non-null characters can be used to describe the word segmentation type of non-null characters.

In S1012, based on the result of the lexical analysis, the source program is divided into one or more word segmentation types including comment symbols, identifier symbols, keywords, variables, numerical literals, four arithmetic symbols, array symbols and/or end participle of symbols.

In this implementation, based on the lexical analysis result of each non-null character in the source program of the ST programming language to be compiled, all word segmentations corresponding to the source program can be obtained. Exemplarily, if the participle corresponding to the first non-null character in the source program of the ST programming language to be compiled is a comment symbol, then the first participle of the source program is determined to be a comment symbol; if the first participle in the source program If the word segmentation corresponding to non-null characters is an identifier symbol, then the first word segmentation of the source program is determined as an identifier symbol, and so on until all the word segmentation of the source program is obtained.

In S102, perform grammatical analysis on each participle based on preset grammatical rules, and determine a grammatically correct target syntax tree based on the analyzed grammatically correct participle.

Optionally, after the electronic device divides the source program to be compiled into one or more word segments, the electronic device can combine each word segment into a phrase based on preset grammar rules, and perform a grammar check on the combined phrase to obtain a correct grammar Word segmentation and grammatically incorrect word segmentation, and modify the grammatically incorrect word segmentation to grammatically correct word segmentation to ensure that all the word segmentation is grammatically correct.

Preset grammar rules can be used to describe the expression logic of correct grammar.

In a possible implementation, the step of determining a grammatically correct target syntax tree based on the analyzed grammatically correct word segmentation in S102 can be implemented through S1021-S1022 as shown in FIG. 3 , and the details are as follows:

In S1021, a first syntax tree is generated based on grammatically correct word segmentation.

Optionally, after the electronic device analyzes the grammatically correct word segmentation based on the result of the syntax analysis, the electronic device may generate the first syntax tree based on the grammatically correct word segmentation.

Exemplarily, it is assumed that the grammatically correct word segmentation is as follows:

CC:=AA+BB;

RET:=FUN_0(D1);

Then, the first syntax tree generated by the electronic device based on the above grammatically correct word segmentation may be as shown in FIG. 4 .

In S1022, semantic analysis is performed on the first syntax tree, and a target syntax tree is determined based on the result of the semantic analysis.

Optionally, after the electronic device generates the first syntax tree based on the grammatically correct word segmentation, it may perform semantic analysis on the first syntax tree to determine the semantically correct word segmentation and phonetically incorrect word segmentation in the first target syntax tree, and A target syntax tree is generated based on all semantically correct word segmentations in the first syntax tree. That is, the target syntax tree consists of all syntactically correct and semantically correct tokens.

Among them, the semantically correct word segmentation refers to the word segmentation that conforms to the preset language specification. The default language specification can be set based on actual applications.

In a possible implementation manner, S1022 may include the following steps:

Step a: Perform a type check on the first syntax tree based on a preset semantic analysis function, and determine semantically incorrect word segmentation and semantically correct word segmentation in the first syntax tree.

Optionally, the preset semantic analysis function may be used to determine whether each word segment in the first syntax tree has an operand allowed by the preset language specification, and if the word segment has an operand allowed by the preset language specification, then determine the word segment is a semantically correct word segment, and if the word segment does not have an operand allowed by the preset language specification, it is determined that the word segment is a semantically incorrect word segment. In practical applications, the electronic device may traverse each word segment in the first syntax tree to determine all semantically correct word segments and semantically incorrect word segments in the first syntax tree.

In the embodiment of the present application, after determining all semantically correct word segments and semantically incorrect word segments in the first syntax tree, the electronic device may further perform error management on semantically incorrect word segments. A specific manner of error management may be, for example: perform semantic correction on the word segmentation with semantic error in the first syntax tree, so as to correct the word segmentation with semantic error into a word segmentation with correct semantics.

Step b: Based on all the semantically correct word segments in the first syntax tree, update the data type corresponding to each word segment in the first syntax tree.

Optionally, the electronic device needs to update the symbol table information synchronously after correcting the word segmentation with incorrect semantics in the first syntax tree to the word segmentation with correct semantics. Specifically, the symbol table information of word segmentations with wrong semantics may be deleted, and the corrected symbol table information of word segmentations with correct semantics may be added.

Step c: Determine the target syntax tree based on all the semantically correct word segments in the first syntax tree and the updated data types corresponding to each word segment.

Optionally, after the electronic device corrects the word segmentations with incorrect semantics in the first syntax tree to word segmentations with correct semantics and updates the data types corresponding to each word segmentation, based on all the word segmentations with correct semantics and the updated symbol table information, Determine the target syntax tree.

In S103, an object code corresponding to the source program is generated based on the object syntax tree.

Optionally, after the electronic device obtains the target syntax tree, it can traverse the entire target syntax tree and convert the target syntax tree into target code that can be recognized and compiled by the compiler. In practical applications, the target code can be a list of preset instructions ( Unimat Instruct List, UIL) format codes. Among them, UIL is a low-level instruction list format with a single symbol.

Exemplarily, the target code corresponding to the source program generated by the electronic device based on the target syntax tree may be:

In S104, the first memory address of each word segment is determined based on a preset memory allocation algorithm, and memory optimization is performed on each first memory address.

In this embodiment of the present application, the preset memory allocation algorithm may include a static memory allocation algorithm and a dynamic memory allocation algorithm.

Optionally, the step of determining the first memory address of each word segment based on the preset memory allocation algorithm in S104 can be realized through S1041-S1042 as shown in Figure 5, and the details are as follows:

In S1041, determine the first data type of each participle;

Wherein, the first data type includes directly specified address type and non-directly specified address type.

Exemplarily, the word segmentation types are comment symbols, identification symbols, keywords, numeric characters, four arithmetic operation symbols, array symbols, end symbols, and direct expression variables. The first data type of the word segmentation can be a directly specified address type, and the word segmentation type is The first data type of the word segmentation of variables (such as user data) may be an indirect specified address type.

In S1042, the preset memory address of each first participle whose first data type is a directly specified address type is respectively determined as the first memory address of each first participle.

Wherein, the preset memory address is a memory address pre-allocated for each word segmentation based on a static memory allocation algorithm. The static memory allocation algorithm is used to describe the specific method of pre-allocating memory addresses for word segmentation, and there is no special limitation here.

In practical applications, fixed ranges can be defined for each memory area in advance, and corresponding memory address identifiers can be set for each area, wherein each memory address identifier corresponds to a different memory area in the first memory address respectively , the memory area corresponding to the first memory address may be determined first according to the memory address marker, and then the first memory address may be determined based on the offset. In practical applications, the memory area corresponding to the first memory address corresponding to the memory address marker can be determined based on the first column and the second column of Table 1.

Table 1

Among them, the M area is the auxiliary relay, the S area is the status register, the D area is the data register, and the R area is the file register.

Exemplarily, when the memory address identifier of the word segmentation is X, it can be determined that the area corresponding to the first memory address is the output location element; when the memory address identifier of the word segmentation is M or B, it can be determined that the area corresponding to the first memory address The memory area is the auxiliary relay, and so on.

After the memory area corresponding to the first memory address is determined, the first memory address may be determined based on the offset. Exemplarily, if "%X5" in the third column in Table 1 indicates that the memory address identifier is X and the offset is 5, the fifth bit of the output area element can be determined as the first memory address; For example, "%M3" in the third column in Table 1 indicates that the memory address identifier is M and the offset is 3, then the third bit of the auxiliary relay can be determined as the first memory address, and so on.

In S1043, based on the dynamic memory allocation algorithm, determine the first memory address of the second participle whose first data type is the non-directly specified address type.

Optionally, S1043 may include the following steps:

Step d: Determine the relationship between the required memory capacity value of each second participle and the preset memory threshold.

Wherein, the preset memory threshold may be determined based on actual requirements, which is not limited here.

Step e: If the required memory capacity value of the second participle is smaller than the preset memory threshold, then determine the first memory address of the second participle based on a preset fixed allocation rule.

Exemplarily, the preset fixed allocation rule can be: when searching for a free partition, add a pointer to indicate the address of the free area to start querying next time, after each search, calculate the capacity between the starting position and the pointer, and now When you need to find a free partition, if the required memory capacity value is less than the recorded maximum capacity, you can start searching from the start position to determine the first memory address of the second participle, if the required capacity is greater than the recorded maximum capacity, then Start searching from the position of the pointer to determine the first memory address of the second participle.

Step f: If the required memory capacity value of the second participle is greater than the preset memory threshold, then determine the first memory address of the second participle based on the required memory value of the second participle.

In the embodiment of the present application, when the required memory value of the second participle is greater than the preset memory threshold, the first memory address of the second participle may be determined according to the actual required memory of the second participle.

Optionally, after the electronic device determines the first memory address of each word segment, memory optimization may be performed on each first memory address. Specifically, the electronic device may traverse the first memory address corresponding to each word segment, determine the redundant memory in the first memory address, and delete the redundant memory. The electronic device can also traverse each participle, determine redundant variables and participles with complex logic, and delete redundant variables. Simplify logically complex word segmentation. In addition, the electronic device can also perform calculations on the word segments that can be pre-calculated in each word segment, and optimize the instructions corresponding to each word segment to improve the overall compilation efficiency.

In S105 , the target code is compiled based on all the memory-optimized first memory addresses to obtain a compilation result of the source program.

Optionally, after the electronic device obtains the target code and the memory-optimized first memory address, it can compile the target code based on all the memory-optimized first memory addresses, so as to obtain the compilation of the ST language source program to be compiled result.

It can be seen from the above that the method for compiling a structured text programming language provided by the embodiment of the present application divides the source program to be compiled into one or more word segmentations based on preset lexical rules, and then executes each word segmentation based on preset grammatical rules. Grammar analysis, and determine the grammatically correct target syntax tree based on the analyzed grammatically correct word segmentation; generate the target code corresponding to the source program based on the target syntax tree; determine the first memory address of each word segmentation based on the preset memory allocation algorithm, and assign performing memory optimization on the first memory address; compiling the target code based on all first memory addresses after memory optimization, so as to obtain a compilation result of the source program. In this way, the method for compiling the structured text programming language provided by the embodiment of the present application can realize the direct compilation of the structured text programming language, without converting the structured text programming language into C language and then compiling it, thereby enabling The conversion time for converting the structured text programming language into the C language is saved, and the compilation efficiency of the structured text programming language is improved.

Based on the compilation method of the structured text programming language provided by the above embodiment, the embodiment of the present application further provides a compiler for implementing the structured text programming language of the above method embodiment, please refer to Fig. 6, which is provided by the embodiment of the present application A schematic diagram of the structure of a compiler for a structured text programming language. As shown in FIG. 6 , the structured text programming language compiler 60 may include a first segmentation unit 61 , a first determination unit 62 , a first generation unit 63 , a second determination unit 64 and a first compilation unit 65 .

in:

The first segmentation unit 61 is used to segment the source program to be compiled into one or more word segments based on preset lexical rules.

The first determining unit 62 is configured to perform grammatical analysis on each of the word segments based on preset grammatical rules, and determine a grammatically correct target syntax tree based on the analyzed grammatically correct word segments.

The first generating unit 63 is configured to generate an object code corresponding to the source program based on the object syntax tree.

The second determination unit 64 is configured to determine the first memory address of each of the word segmentations based on a preset memory allocation algorithm, and perform memory optimization on each of the first memory addresses;

The first compiling unit 65 is configured to compile the target code based on all the first memory addresses after memory optimization, to obtain a compiling result of the source program.

Optionally, the word segmentation type of the word segmentation includes comment symbols, identifier symbols, keywords, variables, character strings, numerical literals, arithmetic symbols, array symbols, and/or end symbols; correspondingly, the first segmentation unit 61 may include A lexical analysis unit and a second segmentation unit. in:

The lexical analysis unit is used to perform lexical analysis on the source program based on a preset recognition function; the preset recognition function is constructed based on preset lexical rules.

The second division unit is used to divide the source program into one or more word segmentation types based on the result of the lexical analysis, including comment symbols, identifier symbols, keywords, variables, numerical literals, four arithmetic symbols, array symbols and/or or the participle of the ending symbol.

Optionally, the first determining unit 62 may further include a second generating unit and a third determining unit. in:

The second generation unit is used to generate the first syntax tree based on the grammatically correct word segmentation.

The third determining unit is configured to perform semantic analysis on the first syntax tree, and determine the target syntax tree based on a result of the semantic analysis.

Optionally, the third determining unit may further include a fourth determining unit, a first updating unit, and a fifth determining unit. in:

The fourth determining unit is configured to perform a type check on the first syntax tree based on a preset semantic analysis function, and determine semantically incorrect word segmentation and semantically correct word segmentation in the first syntax tree.

The first updating unit is configured to update the data type corresponding to each participle in the first grammatical tree based on all the semantically correct participles in the first grammatical tree.

The fifth determining unit is configured to determine the target syntax tree based on all the semantically correct word segments in the first syntax tree and the updated data types corresponding to each of the word segments.

Optionally, the third determining unit may further include a first correcting unit.

The first correction unit is configured to perform semantic correction on the word segmentation with semantic error in the first syntax tree, and correct the word segmentation with semantic error into a word segmentation with correct semantics.

Optionally, the second determining unit 64 may further include a sixth determining unit, a seventh determining unit, and an eighth determining unit. in:

The sixth determination unit is used to determine the first data type of each word segment; the first data type includes a directly specified address type and an indirect specified address type.

The seventh determining unit is used to determine the preset memory addresses of the first participle whose first data type is the directly specified address type respectively as the first memory address of each of the first participle; the preset memory The address is a memory address pre-allocated for each of the word segmentations based on the static memory allocation algorithm.

The eighth determining unit is configured to determine the first memory addresses of the second participles where each of the first data types is the non-directly specified address type based on the dynamic memory allocation algorithm.

Optionally, the eighth determining unit may further include a ninth determining unit, a tenth determining unit, and an eleventh determining unit. in:

The ninth determining unit is configured to determine a second data type of each of the second participles; the second data type includes a direct representation variable type and an indirect representation variable type.

The tenth determination unit is configured to respectively determine the corresponding first memory address of the second word segmentation based on each of the second data types being the memory address marker of the second word segmentation directly representing the variable type; each of the memory The address markers respectively correspond to a different area in the first memory address.

The eleventh determining unit is used to respectively determine the corresponding first memory address of the second word segmentation based on the word segmentation types of the second word segmentation that each of the second data type is not directly representing the variable type; each of the word segmentation types corresponds to A different region within the first memory address.

It should be noted that, since the information interaction and execution process between the above units are based on the same idea as the method embodiment of the present application, its specific functions and technical effects can refer to the method embodiment part for details, and will not be discussed here. Let me repeat.

Please refer to FIG. 7 . FIG. 7 is a schematic structural diagram of an electronic device provided in an embodiment of the present application. As shown in FIG. 7 , the electronic device 7 provided in this embodiment may include: a processor 70 , a memory 71 , and a computer program 72 stored in the memory 71 and operable on the processor 70 . For example, a program corresponding to a compilation method of a structured text programming language. When the processor 70 executes the computer program 72, it realizes the steps in the embodiment of the compiling method applied to the structured text programming language, such as S101-S105 shown in FIG. 1 , S1011-S1012 shown in FIG. 2 , and S1021 in FIG. 3 ~ S1022 and S1041 ~ S1043 shown in FIG. 5 . Alternatively, when the processor 70 executes the computer program 72, it realizes the functions of the modules/units in the embodiments corresponding to the electronic device 7, for example, the functions of the units 61-65 shown in FIG. 6 .

Exemplarily, the computer program 72 can be divided into one or more modules/units, and one or more modules/units are stored in the memory 71 and executed by the processor 70 to complete the present application. One or more modules/units may be a series of computer program instruction segments capable of accomplishing specific functions, and the instruction segments are used to describe the execution process of the computer program 72 in the electronic device 7 . For example, the computer program 72 can be divided into a first division unit, a first determination unit, a first generation unit, a second determination unit, and a first compilation unit. For the specific functions of each unit, please refer to the related section in the embodiment corresponding to FIG. 6 . description, not repeated here.

Those skilled in the art can understand that FIG. 7 is only an example of the electronic device 7, and does not constitute a limitation to the electronic device 7. It may include more or less components than shown in the figure, or combine certain components, or different components. .

The processor 70 may be a central processing unit (central processing unit, CPU), and may also be other general-purpose processors, digital signal processors (digital signal processors, DSPs), application specific integrated circuits (application specific integrated circuits, ASICs), off-the-shelf Programmable gate array (field-programmable gate array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor, or the processor may be any conventional processor, or the like.

The storage 71 may be an internal storage unit of the electronic device 7 , such as a hard disk or memory of the electronic device 7 . The memory 71 can also be an external storage device of the electronic device 7, such as a plug-in hard disk equipped on the electronic device 7, a smart memory card (smart media card, SMC), a secure digital (secure digital, SD) card or a flash memory card (flash memory card). card) etc. Further, the memory 71 may also include both an internal storage unit of the electronic device 7 and an external storage device. The memory 71 is used to store computer programs and other programs and data required by the electronic device. The memory 71 can also be used to temporarily store data that has been output or will be output.

Those skilled in the art can clearly understand that for the convenience and brevity of description, only the division of the above-mentioned functional units is used as an example for illustration. In practical applications, the above-mentioned function allocation can be completed by different functional units according to needs. The internal structure of the compiler of the structured text programming language is divided into different functional units to complete all or part of the functions described above. Each functional unit in the embodiment can be integrated into one processing unit, or each unit can exist separately physically, or two or more units can be integrated into one unit, and the above-mentioned integrated units can be implemented in the form of hardware , can also be implemented in the form of software functional units. In addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the present application. For the specific working process of the units in the above system, reference may be made to the corresponding process in the foregoing method embodiments, and details are not repeated here.

The embodiment of the present application also provides a computer-readable storage medium, where a computer program is stored in the computer-readable storage medium, and when the computer program is executed by a processor, the steps in the foregoing method embodiments can be implemented.

An embodiment of the present application provides a computer program product, which enables the terminal device to implement the steps in the foregoing method embodiments when the computer program product is run on the terminal device.

In the above-mentioned embodiments, the descriptions of each embodiment have their own emphases, and for parts that are not detailed or recorded in a certain embodiment, reference may be made to relevant descriptions of other embodiments.

Those skilled in the art can appreciate that the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein can be implemented by electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are executed by hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may use different methods to implement the described functions for each specific application, but such implementation should not be regarded as exceeding the scope of the present application.

The above-described embodiments are only used to illustrate the technical solutions of the present application, rather than to limit them; although the present application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that: it can still implement the foregoing embodiments Modifications to the technical solutions described in the examples, or equivalent replacements for some of the technical features; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions of the various embodiments of the application, and should be included in the Within the protection scope of this application.

Claims (10)

1. A compiling method of a structured text programming language, characterized in that, comprising: Divide the source program to be compiled into one or more word segmentations based on preset lexical rules; performing grammatical analysis on each of the word segmentations based on preset grammatical rules, and determining a grammatically correct target syntax tree based on the analyzed grammatically correct word segmentation; generating an object code corresponding to the source program based on the object syntax tree; determining the first memory address of each of the word segments based on a preset memory allocation algorithm, and performing memory optimization on each of the first memory addresses; Compile the target code based on all the first memory addresses after memory optimization to obtain a compilation result of the source program. 2. the compiling method of structured text programming language according to claim 1, it is characterized in that, the participle type of described participle comprises comment symbol, identification sign, keyword, variable, numerical literal, four arithmetic operation symbol, array symbol and / or end symbol; Correspondingly, dividing the source program to be compiled into one or more word segmentations based on preset lexical rules includes: performing lexical analysis on the source program based on a preset recognition function; the preset recognition function is constructed based on preset lexical rules; Based on the result of the lexical analysis, the source program is divided into one or more word segmentation types including comment symbols, identifier symbols, keywords, variables, numerical literals, arithmetic symbols, array symbols and/or end symbols. 3. The compiling method of structured text programming language according to claim 1, is characterized in that, described based on the correct described participle of analyzed grammar generation correct target syntax tree, comprising: generating a first syntax tree based on the grammatically correct word segmentation; Perform semantic analysis on the first syntax tree, and determine the target syntax tree based on a result of the semantic analysis. 4. The compilation method of structured text programming language according to claim 3, it is characterized in that, described described first syntax tree is carried out semantic analysis, and based on described semantic analysis result, determine described target syntax tree, comprising : performing a type check on the first syntax tree based on a preset semantic analysis function, and determining semantically incorrect word segmentation and semantically correct word segmentation in the first syntax tree; Based on all the semantically correct participles in the first grammatical tree, update the data type corresponding to each participle in the first grammatical tree; The target syntax tree is determined based on all the semantically correct word segments in the first syntax tree and the updated data types corresponding to each of the word segments. 5. The compilation method of structured text programming language according to claim 4, is characterized in that, also comprises: Semantic correction is performed on the word segmentation with semantic error in the first syntax tree, and the word segmentation with semantic error is corrected into a word segmentation with correct semantics. 6. according to the compiling method of the structured text programming language described in any one of claim 1-5, it is characterized in that, described preset memory allocation algorithm comprises static memory allocation algorithm and dynamic memory allocation algorithm; The memory allocation algorithm determines the first memory address of each of the word segmentations, including: Determining the first data type of each of the word segmentations; the first data type includes a directly specified address type and an indirect specified address type; Each of the first data type is the preset memory address of the first participle of the directly specified address type respectively determined as the first memory address of each of the first participle; the preset memory address is pre-based on the The memory address allocated by the static memory allocation algorithm for each of the word segmentations; Based on the dynamic memory allocation algorithm, each of the first data types is determined as a first memory address of a second word segment of the non-directly specified address type. 7. The method for compiling a structured text programming language according to claim 6, wherein, based on the dynamic memory allocation algorithm, it is determined that each of the first data types is the first data type of the non-directly specified address type. The first memory address of the binary word, including: Determine the relationship between the required memory capacity value of each of the second participle and the preset memory threshold; If the required memory capacity value of the second participle is less than the preset memory threshold, then determine the first memory address of the second participle based on a preset fixed allocation rule; If the required memory capacity value of the second participle is greater than the preset memory threshold, then determine the first memory address of the second participle based on the required memory value of the second participle. 8. A compiler for a structured text programming language, comprising: a first segmentation unit, configured to segment the source program to be compiled into one or more word segments based on preset lexical rules; The first determining unit is configured to perform grammatical analysis on each of the word segmentations based on preset grammatical rules, and determine a grammatically correct target syntax tree based on the analyzed grammatically correct word segmentation; a first generating unit, configured to generate an object code corresponding to the source program based on the object syntax tree; The second determination unit is configured to determine the first memory address of each of the word segmentations based on a preset memory allocation algorithm, and perform memory optimization on each of the first memory addresses; The first compiling unit is configured to compile the target code based on all the first memory addresses after memory optimization, and obtain a compiling result of the source program. 9. An electronic device, comprising a memory, a processor, and a computer program stored in the memory and operable on the processor, characterized in that, when the processor executes the computer program, the computer program according to claim 1 is realized. Each step in the compilation method described in any one of 1 to 7. 10. A computer-readable storage medium, the computer-readable storage medium storing a computer program, characterized in that, when the computer program is executed by a processor, the compiling method according to any one of claims 1 to 7 is implemented each step.

Images