JP3003459B2 - Program creation support device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a program creation supporting apparatus for supporting creation and editing of a program interactively, and more particularly, to a program creation supporting apparatus capable of easily changing a grammar of a programming language targeted by the program. By doing so, it is possible to cope with multiple languages, and it is easy to cope with revision of a programming language.

[0002]

2. Description of the Related Art FIG.
It is a block diagram which shows the conventional program creation support apparatus shown by volume 8 page 1030. In the figure, 1 is a program editing means for interactively creating and editing a program,
2 is a program verification means for interactively verifying the operation of the created and edited program, 3 is a source code analyzing means for analyzing the source code of the created and edited program and converting it into an intermediate representation, and 4 is a program Source code generation means for generating source code, intermediate expression storage means for storing intermediate expressions, and source code of a program created by the program creation support device.

In this program creation support device, a user,
That is, the program creator is provided with an editing means in a format which is more efficient and easy to understand than by directly editing the source code 6 of the program by using a text editor by using the program editing means 1. The program verification means 2 is provided as means for verifying. The program created by the user with the program editing means 1 is temporarily stored in the intermediate expression storage means 5 in the form of a certain intermediate expression, and is converted by the source code generation means 4 into the source code 6 of the program. When editing the source code 6 of the program, the source code is converted into an intermediate representation by the source code
To be stored. The intermediate representation of the program stored in the intermediate representation storage means 5 is edited by using the program editing means 1 and the program verification means 2, and the source code generation means 4 obtains the source code 6 of the program again.

In such a program creation support device,
Usually, since the source code analysis means 3 and the source code generation means 4 are specialized for a specific programming language, it is necessary to provide similar program creation support to other programming languages, or When an improvement or the like occurs, it is necessary to change the source code analysis means 3 and the source code generation means 4 for another programming language or a new version of the programming language.

[0005] In order to reduce the work of changing the program creation support device to another programming language or a new version of a programming language, for example, a "compiler compiler" (Kenzo Inoue, published by Sangyo Tosho Co., Ltd., 1970) Authors) It is conceivable to apply the compiler and compiler technology described in Chapter 7.
FIG. 11 is an example in which a compiler / compiler technique is applied to facilitate change of a source code analysis unit.

In FIG. 12, a parser generating means 8
Reads a parsing rule 7 composed of vocabulary / grammar rules and semantic definitions for analysis, analyzes a source code 6 of a program described in a programming language specified in the parsing rule 7, and converts it into an intermediate representation. Automatically generate source code. As a result, the source code analysis means 3 only changes the syntax analysis rule 7 only.
It can be changed for another programming language or a new version of the programming language. However, on the other hand, regarding the change of the source code generation means, since there is no tool corresponding to the syntax analyzer generation means 8, it has conventionally been necessary to recreate it manually.

[0007]

As described above, the conventional program creation support apparatus has no means for easily creating the source code generation means as described above. There is a problem that labor is large and a problem that it is difficult to guarantee consistency of the vocabulary / grammar of the source code analysis unit 3 and the source code generation unit 4.

SUMMARY OF THE INVENTION The present invention has been made to solve the above-mentioned problems. By providing a means for creating a source code generation means, the source code generation means can be arbitrarily changed only by changing the code generation rules. Source code analysis means and source code generation means by making it possible to use the vocabulary / grammar rules in the parsing rules as they are for the vocabulary / grammar rules in the code generation rules. The goal is to get consistency assurance regarding the vocabulary / grammar of the

[0009]

According to a first aspect of the present invention, there is provided a program creation support apparatus having the following elements. (A) a program editing means for interactively creating and editing a program; and (b) a program verifying means for interactively verifying the operation of the program created and edited by the program editing means. Source code analysis means for analyzing a source code and converting it into an intermediate expression (d) Intermediate expression storage means for storing the intermediate expression (e) Parsing rules including vocabulary / grammar rules of a programming language (f) The syntax analysis (G) a code generation rule including a vocabulary / grammar rule of a programming language; and (h) a source code generation means that automatically generates a source code analysis means from the code generation rule. Code generator generating means to generate

[0010] A program support apparatus according to a second aspect of the present invention has the following elements. (A) a program editing means for interactively creating and editing a program; and (b) a program verifying means for interactively verifying the operation of the program created and edited by the program editing means. Source code analysis means for analyzing a source code and converting it into an intermediate expression (d) Intermediate expression storage means for storing the intermediate expression (e) Parsing rules including vocabulary / grammar rules of a programming language (f) The syntax analysis (G) a code generation rule including a vocabulary / grammar rule of a programming language; and (h) a source code generation means that automatically generates a source code analysis means from the code generation rule. Code generator generating means for generating (i) source code generating means from the syntax analysis rules Vocabulary / grammar rule extraction means for extracting the available vocabulary / grammar rule in the code generation rules for forming

[0011]

According to the first aspect of the present invention, there is provided a program creation support apparatus including a code generator generation means for automatically generating a source code generation means from a code generation rule including vocabulary / grammar rules. There is a feature in doing. Thus, when the programming language for writing the source code is changed, it can be easily handled by changing only the vocabulary / grammar rules.

According to a second aspect of the present invention, there is provided a program creation support apparatus for generating a source code generation unit from a syntax analysis rule for generating a source code analysis unit according to the first aspect of the invention. It is characterized in that a vocabulary / grammar rule extracting means for extracting a vocabulary / grammar rule that can be used in the generation rule is added. As a result, the source code analysis unit and the source code generation unit have a common vocabulary / grammar rule, and it is easy to obtain language consistency.

[0013]

【Example】

Embodiment 1 FIG. An embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a configuration diagram of a program creation support device according to an embodiment of the present invention. In the figure, the same components as those of the conventional example are denoted by the same reference numerals, and description thereof is omitted. Reference numeral 9 denotes a vocabulary / grammar rule of a programming language that describes the source code 6 of the program, and a code generation rule including a semantic definition for generating the program source code 7 from the intermediate expression stored in the intermediate expression storage unit 5. Source code generation means for reading the code generation rule 9 and outputting a program source code in accordance with the vocabulary / grammar of the programming language specified in the code generation rule from the intermediate expression stored in the intermediate expression storage means automatically Is a vocabulary / grammar rule extracting means for extracting a vocabulary / grammar rule usable in a code generation rule for generating a source code generating means from the syntax analysis rule 7.

Next, the operation will be described. First, the operation of creating the code generation rule 9 from the syntax analysis rule 7 using the vocabulary / grammar rule extraction means in FIG. 1 will be described. FIG. 2 shows a parsing rule when a parser generating means called, for example, "yacc / lex" is used. In the figure, 201 is a vocabulary rule for analysis, 202 is a terminal symbol string, 203 is an action corresponding to the terminal symbol string, 204 is a syntax rule for analysis, 205 is a definition of a typed token, and 206 is a typeless token , 207 is a nonterminal symbol type definition, 208 is a nonterminal symbol entry, 209 and 21
1 is the expansion rule of the non-terminal symbol 208, 210 is the semantic definition for analysis corresponding to the expansion rule 209, 212
Is a semantic definition for analysis corresponding to the expansion rule 211.

FIG. 3 shows an example of vocabulary / grammar rules extracted from the syntax analysis rules of FIG. 2 by the vocabulary / grammar rule extracting means 11 in FIG. In the figure, 31 is an output macro of a token with a type, 32 is an output macro of a token without a type, 33 is a type definition of a non-terminal symbol, 3
4 is a grammar rule.

FIG. 4 is a flowchart showing the operation of the vocabulary / grammar rule extracting means 11 of FIG. 4, in step 401, a character string is read from the syntax analysis rule shown in FIG. 2, and in step 402, it is checked whether the read character string is a typed token. If it is a typed token, create an output macro that matches the type and output it to a file. On the other hand, if the token is not a typed token, a terminal symbol string output macro is created with reference to the terminal symbol string 202 and the action 203 corresponding to the terminal symbol string in FIG. Here, the output macro created from the typed token is the output macro 31 of the typed token in FIG.
And the output macro created from the untyped token is the output macro 32 of the untyped token in FIG.

In FIG. 2, the processing of the typed token 205 and the typeless token 206 ends. Next, in FIG. 4, in step 405, it is checked whether or not the token definition is completed. If not, the process returns to step 401 and returns to steps 402, 403,
The process shown at 404 is repeated. In step 405, if the token definition is completed, step 40
Then, the process proceeds to step 6 to read a character string from the syntax analysis rule shown in FIG. In step 408, it is checked whether the read character string is a nonterminal symbol type definition. If the read string is a nonterminal symbol type definition, step 40
In step 7, the nonterminal symbol type definition is output to a file as it is, and the process returns to step 406 again. Step 408
If it is not the type definition of the non-terminal symbol, the flow advances to step 409 to read a character string from the parsing rule. The nonterminal symbol type definition output here is the nonterminal symbol type definition 33 in FIG. 3, and the process ends up to the nonterminal symbol type definition 207 in FIG. 2.

Next, in FIG. 4, it is checked in step 411 whether or not the syntax analysis rule has been completed for the character string read in step 409. If not finished, the part of the semantic definition as shown by 210 and 212 in FIG.
Output only 09 and 211 to a file. As a result, the syntax analysis rule shown in FIG. 2 is converted into the vocabulary / grammar rule format shown in FIG.

The vocabulary / grammar rule obtained by using the vocabulary / grammar rule extracting means 11 of FIG. 1 becomes the code generation rule 9 of FIG. 1 by adding a meaning definition for generation. FIG. 5 is a diagram showing an outline of the description of the code generation rule 9. In the figure, 51 is an entry of a non-terminal symbol, 52
Is an arbitrary C program, 53 and 55 are expansion rules corresponding to the nonterminal symbol entry 1, 54 is a semantic definition for generation corresponding to the expansion rule 53, and 56 is a semantic definition for generation corresponding to the expansion rule 55 It is.

The outline of the description of the code generation rule 9 in FIG. 5 will be described in detail. Non-terminal symbol 51, expansion rule 53
And 55 are the same as the grammar rules extracted by the vocabulary / grammar rule extraction means. Therefore, the portions to be added to the extracted vocabulary / grammar rules in order to create the code generation rule 9 in FIG. 1 are the arbitrary C program 52 in FIG. 5 and the meaning definitions 54 and 56 for generation. In the arbitrary C program 52, a program for copying source code, a program for extracting data from an intermediate expression, and the like are described in, for example, the C language.

Next, semantic definitions 54 and 5 for generation
6 describes three items: a conditional statement, an argument definition, and a line feed output. First, the conditional statement takes a conditional expression as an argument,
d]. The conditional statement is
A selection condition when there are a plurality of expansion rules of the non-terminal symbol entry 51 or an end condition for a recursive grammar rule in which the non-terminal symbol entry is included again in the expansion rule is described. If there are a plurality of expansion rules, an expansion rule that satisfies the conditional expression of the conditional statement is selected. In the case of a recursive grammar rule, the repetition rule is applied only while the conditional expression of the conditional statement is satisfied.

The argument definition is an assignment statement described in the form of “$ (number) = expression” and represents the assignment of a value to a non-terminal symbol in the expansion rule. For example, according to the semantic definition 54 for generation in FIG. 5, the value of the expression 1 is substituted for the non-terminal 1 in the corresponding expansion rule 53, and the expression 2 is substituted for the non-terminal 2
Is assigned. Finally, the line feed output is "end_o
This is an output macro represented by "f_line", and outputs a line feed code after applying a corresponding expansion rule for a fair copy. FIG. 6 shows an example in which a meaning definition for generation is added to the vocabulary / grammar rule shown in FIG.

Next, the operation of generating the source code generation means 4 from the code generation rule 9 in FIG. 1 using the code generator generation means 10 will be described. FIG. 7 is a C-language program of the source code generation means generated from the code generation rules shown in FIG. 5 using the code generator generation means. In the figure, 71 is a function entry, 72 is an arbitrary C program, and 73 and 74 are programs for code generation. Further, the example of the code generation rule shown in FIG. 6 is generated as a C language program shown in FIG.

FIGS. 9 and 10 are flowcharts showing the operation of the code generator generating means 10 in FIG. In the figure, in step 901, a character string is read from the code generation rule 9 shown in FIGS. 5 and 6, and in step 902, the character string "% token" is replaced with "#
It is converted to a character string "define" and output to a file. In step 903, it is determined whether or not the token definition has been completed.
Returning to step 904, if it has been completed, the process proceeds to step 904. In step 904, a character string is read from the code generation rule, and in step 905, it is checked whether or not a nonterminal symbol type is defined.

If it is a non-terminal symbol type definition, the non-terminal symbol and its type are stored in an internal table, and the process returns to step 904. Otherwise, go to step 907. Next, in step 907, the non-terminal symbol entry 51 shown in FIG. (See function entry 71 in FIG. 7). In step 908, the code generation rule is read continuously, and if there is any C program 52 in FIG. 5, it is output as it is (see the arbitrary C program 72 in FIG. 7).

The expansion rules 53 and 55 in FIG. 5 are processed in steps 909 to 918. In step 909, the code generation rule 9 is read, and if it is a conditional statement (cond statement), it is output as an if statement. In step 910, the character string of the expansion rule is read. Output as a function call.

If it is determined in step 913 that the terminal symbol is a typed terminal symbol, in step 914, a call in accordance with the argument definition is output using an output macro defined by the terminal symbol name in step 902. If the terminal symbol is determined in step 915, step 91 is executed.
In step 6, the output macro call of the terminal symbol name defined in step 902 is output.

In step 917, it is checked whether or not there is another expansion rule.
Output as an f statement, and return to step 910. If there is no other expansion rule, it is checked in step 919 whether there is another code generation rule, and if there is, the process returns to step 907;

[0029]

As described above, according to the present invention, the code generator generation means reads the code generation rules, and reads the program defined by the code generation rules from the intermediate expression stored in the intermediate expression storage means. Language vocabulary /
Since the source code generator that outputs the program source code according to the grammar is configured to be automatically generated, it can be used in combination with the parser generator so that only the parsing rules and code generation rules need to be changed. In addition, there is an effect that the program creation support device can be easily changed in response to a change in the programming language.

The vocabulary / grammar rule extracting means extracts the vocabulary / grammar rules usable in the code generation rules for generating the source code generating means from the syntax analysis rules. It is possible to obtain a guarantee of consistency regarding the vocabulary / grammar of the means.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of a program creation support device according to an embodiment of the present invention.

FIG. 2 is a diagram illustrating an example of a syntax analysis rule according to an embodiment of the present invention.

FIG. 3 is a diagram showing an example of vocabulary / grammar rules according to one embodiment of the present invention.

FIG. 4 is a flowchart of a vocabulary / grammar rule extracting unit according to an embodiment of the present invention.

FIG. 5 is an explanatory diagram of an outline of a code generation rule according to an embodiment of the present invention.

FIG. 6 is a diagram showing an example of a code generation rule according to an embodiment of the present invention.

FIG. 7 is an explanatory diagram of an outline of a source code generation unit according to an embodiment of the present invention.

FIG. 8 is a diagram showing an example of source code generation means according to one embodiment of the present invention.

FIG. 9 is a flowchart of a code generator generating means according to an embodiment of the present invention.

FIG. 10 is a continuation of FIG. 9;

FIG. 11 is a configuration diagram of a conventional program creation support device.

FIG. 12 is a configuration diagram in which a conventional program creation support device is improved.

[Explanation of symbols]

 REFERENCE SIGNS LIST 1 program editing means 2 program verification means 3 source code analysis means 4 source code generation means 5 intermediate representation storage means 6 program source code 7 syntax analysis rules 8 syntax analyzer generation means 9 code generation rules 10 code generator generation means 11 vocabulary / Grammar rule extraction means

Continuation of the front page (56) References JP-A-4-102919 (JP, A) JP-A-5-108318 (JP, A) "Automatic generation of a parser and an parser with internal structure conversion function for definite clause grammar" Method, ”Transactions of the Information Processing Society of Japan, (1990/11), Vol. 31, No. 11, pp. 1616-1626 Information processing (1990-8), Information Processing Society, vol. 31, No. 8, pp. 1013-1047 "Implementation of operator identification algorithm using yacc (2)", bit, (1993/1), Vol. 25, No. 1, pp. 95-97, "yacc-Yet Another Compiler-Compiler", Sun Microsystems, (1990) "Algebraic specification description and automatic generation of compiler", IEICE Transactions DI, (1990 / 12), Vol. J73-DI, p. 979-989 (58) Field surveyed (Int.Cl. ⁷ , DB name) G06F 9/06-9/46

Claims (2)

(57) [Claims] 1. A program creation support device having the following elements: (a) program editing means for interactively creating and editing a program; and (b) interactively verifying the operation of the program created and edited by the program editing means. (C) Source code analysis means for analyzing the source code of a created and edited program and converting it to an intermediate expression (d) Intermediate expression storage means for storing the intermediate expression (e) Vocabulary / grammar of programming language (F) a parser generating means for automatically generating source code analyzing means from the parsing rules; (g) a code generating rule including vocabulary / grammar rules of a programming language (h A) a code generator generating means for automatically generating source code generating means from the code generation rules; . 2. A program creation support device having the following elements: (a) program editing means for creating and editing a program interactively; and (b) interactively verifying the operation of the program created and edited by the program editing means. (C) Source code analysis means for analyzing the source code of a created and edited program and converting it to an intermediate expression (d) Intermediate expression storage means for storing the intermediate expression (e) Vocabulary / grammar of programming language (F) a parser generating means for automatically generating source code analyzing means from the parsing rules; (g) a code generating rule including vocabulary / grammar rules of a programming language (h A) a code generator generating means for automatically generating source code generating means from the code generation rules; (I) the syntax vocabulary / grammar rule extraction means for extracting the available vocabulary / grammar rules from the analysis rule in the code generation rules for generating a source code generating means.