JPH02224148A - Test program forming processor - Google Patents

Abstract

PURPOSE:To improve the description property of attribute grammar description by describing the repeating description of a non-terminal symbol to be described in the attribute grammar description and abbreviating description as a pair with a terminal code. CONSTITUTION:The repeating description of a non-terminal symbol to be described in the attribute grammar description 10 and abbreviating description are described as a pair with a terminal code. The repeating description means the description for repeating a described non-terminal symbol by the number of times determined in accordance with a random number value generated from a random number generating part 24 and the abbreviating description means the description for determining whether the described non-terminal symbol is to be abbreviated or not in accordance with the random number value generated from the generating part 24. Since the repeating description of the non- terminal code forming a pair with the terminal code is accepted, the need for describing the sentence of one line can be eliminated and the description property of the attribute grammar description can be improved.

Description

[Detailed Description of the Invention] [Summary] The present invention relates to a test program creation processing device that automatically creates a test program for a language processing program from attribute grammar descriptions, and is capable of improving the descriptive properties of attribute grammar descriptions. The purpose is to call a test routine to check the random number statement generated by random number selection processing for the processing target statement written according to the attribute grammar description and the execution result of the random number statement.
A test program creation processing device that creates a test program paired with an I-approved sentence, and is configured so that descriptions of non-terminal symbols whose attribute grammar description is repetition and abbreviation are described as a pair with a terminal symbol. In addition, a structure variable management unit that structurally manages the attributes of non-terminal symbols, and manages the terminal symbols as printing attributes for those to which terminal symbols are added, and outputs the created test program. , when outputting the text of a non-terminal symbol, when the non-terminal symbol has a print attribute, the writer is configured to output the text of the terminal symbol having the print attribute before the non-terminal symbol appears.

[Industrial application field]

The present invention relates to a test program creation processing device that automatically creates a test program for a language processing program from attribute grammar descriptions, and particularly relates to a test program creation processing device that can improve the descriptive properties of attribute grammar descriptions. It is something.

Created language processing program (COBOL, FORTl)
? In order to inspect the functionality of a program (not limited to compilers such as AN, but also programs that process commands), create a verification test program based on the manual and compare the execution results with the expected ones. The following approach will be taken.

However, since the number of functions of a language processing program is large (and even combinations of multiple functions must be checked, the number of functions that must be checked becomes extremely large. The current situation is that a great deal of effort is expended on creating test programs required for functional inspection.Based on this background, automatic creation of test programs for language processing programs has been developed. Providing processing equipment is desired.

[Conventional technology]

Conventionally, test programs for language processing programs have been created manually. In other words, a programmer or the like performs factor analysis from a manual that describes various grammar rules and their meanings, sets test items, and creates a test program that describes the execution of functions that match the test items and the procedure for verifying the results. It was created.

[Problem to be solved by the invention]

However, since this factor analysis and setting of test items requires an extremely large amount of effort, the conventional technology has a problem in that an extremely large number of man-hours are required to create a test program.

Furthermore, since there is a limit to the content of the test program that can be created using manual methods, there is also the problem that the functions of the language processing program are not sufficiently tested in the conventional technology.

Therefore, the present applicant has previously filed the application for “Japanese Patent Application No.
No. 10 (filed on February 29, 1988, ``Language Processing Program Verification Method''), he devised an invention for a processing device for automatically creating test programs for language processing programs. Next, the outline of the invention of this patent application will be explained with reference to FIG.

In the figure, 1 is a syntactic/semantic description, which describes the sentence to be processed by the language processing program according to an attribute grammar description consisting of expansion rules and semantic descriptions, and 2 is a TP automatic creation unit, which is a syntactic/semantic description. 3 is a production rule selection unit provided in the automatic TP creation unit 2, which automatically creates a test program from the description 1, and processes the expansion rules in the syntactic/semantic description 1 by performing random number selection processing. 4 is a confirmation sentence insertion section provided in the automatic TP creation section 2, which is a test for confirming the execution result caused by the execution of the created random number statement. 5 is a symbol table provided in the TP automatic creation unit 2, which inserts a confirmation statement that calls a routine in association with a random number statement;
6 is a series of verification programs created by the automatic TP creation section 2 and constitutes a test program for the language processing program; 7 is an automatic judgment section which is a verification program; A device that automatically determines whether the execution result when a language processing program executes the random number statement of No. 6 is correct according to a test routine called by a confirmation statement associated with the random number statement; 8 is a result list, in which the automatic judgment section 7
The judgment results are printed out.

In the invention of the earlier patent application structured in this way,
The production rule selection unit 3 creates a random number sentence, which is an aspect of the sentence to be processed, by performing a random number selection process on the expansion rule of the sentence to be processed in the syntactic/semantic description 1, and generates a random number sentence, which is an aspect of the sentence to be processed, and sends it to the confirmation sentence insertion unit. 4
will automatically generate a test program for the language processing program by inserting confirmation statements that take the correct execution result of the random number statement as an argument.

In order to improve the practicality of the invention of the earlier patent application, it is necessary to improve the descriptive nature of the attribute grammar description prepared for creating a test program. This is because if the attribute grammar description becomes difficult to write, it will take time and effort to create the attribute grammar description, and the productivity in creating the test program will drop significantly.

The present invention has been made in view of the above circumstances, and involves taking measures to improve the descriptive nature of attribute grammar descriptions in the test program creation processing device of the earlier patent application filed by the present applicant. The purpose of this patent is to improve the practicality of the test program creation processing device disclosed in the previous patent application and to make it even more effective.

[Means to solve the problem]

FIG. 1 is a diagram showing the principle configuration of the present invention.

In the figure, IO is an attribute grammar description, which describes the attribute grammar of the processing target statement of the language processing program to be tested, and is used to call a test routine that checks the execution result of this processing target statement. This is to write a confirmation statement. In this attribute grammar description 10, non-terminal symbols regarding repetition and abbreviation are described as pairs with terminal symbols. 11 is an expansion rule forming the attribute grammar description 10, which describes the expansion rule of the sentence to be processed; 12 is a semantic description forming the attribute grammar description 10, which describes the semantic content in the sentence to be processed;
20 is a test program creation processing device having the present invention, which automatically creates a test program for a language processing program; 21 is a league, which converts the attribute grammar description 10 into an internal format; An expansion processing unit 23, which is a translation processor, expands the internal format converted by the reader 21 and creates an internal format test program.
and a semantic description processing requesting unit 26 that requests execution of the semantic description 12 necessary for creating an internal format test program. 24 is a random number generation unit included in the expansion processing unit 23, and 24 is a random number generation unit provided in the expansion processing unit 23, which generates a 25 is a structure variable management unit included in the expansion processing unit 23 that generates random numbers necessary for selection processing, and structurally manages variable data required for expansion processing of the internal format test program. In addition, for non-terminal symbols paired with terminal symbols, 27 is a semantic description interpreter that manages the added terminal symbol as a print attribute, and 27 is a semantic description interpreter that responds to the activation request from the semantic description processing request unit 26. 28 is a writer that executes the semantic description 12 with a processing request;
It outputs the internal format test program created by the translation processor 22 as an executable test program to a file, etc. 29 is a print attribute output unit that is a function of the LIKE 28, and it outputs information about non-terminal symbols to be output. When outputting the text of the test program, if the non-terminal symbol has a terminal symbol with a print attribute, processing is performed to output the text of the terminal symbol with the print attribute prior to outputting the text of the non-terminal symbol; This is the output test program. Here, the non-terminal symbol described in the attribute grammar description 10 refers to a symbol that is expanded according to the expansion rule 11 and becomes the text of the test program 30, and the terminal symbol refers to a symbol that is expanded when creating the test program 30. It refers to a symbol without a .

[Effect]

In the present invention, according to the processing of the reader 21, the attribute grammar description IO is converted into an internal format that is easy for the translation processor 22 to interpret. After receiving this internal format, the expansion processing unit 2
3 executes expansion into an internal format test program by recursively executing expansion according to expansion rule 11. If it is necessary to execute the semantic description 12 during this expansion, the semantic description processing requesting unit 26 sends the semantic description interpreter 27
The semantic description interpreter 27 activated in this way executes a process of updating the variable values of the structure variable management unit 25 to new ones. and,
The expansion processing unit 23 executes the expansion to the internal format test program while referring to the updated variable values, and regarding the selectivity rules included in the expansion rules ll necessary for this expansion, Selection of selection targets and selection of values are executed in accordance with random numbers generated by the random number generation section 24.

When the expansion process to the internal format test program is completed, a value related to the execution result of the translated random number sentence is set as one aspect of the processing target sentence in the parameter part of the confirmation sentence described in the attribute grammar description IO. This completes the creation of an internal format program corresponding to the basic unit of a test program for a language processing program. When the creation of the internal format program is completed, the writer 28 outputs the internal format test program as an executable test program 30 and ends the process.

In this automatic test program creation process, the present invention allows repeated descriptions and abbreviated descriptions of non-terminal symbols described in the attribute grammar description 10 to be described in pairs with terminal symbols. . Here, this repeated description is a description that repeats a non-terminal symbol, which is a number of times determined according to the random number generated by the random number generator 24, and the abbreviated description is:
This is a description in which it is determined whether or not to omit a non-terminal symbol in accordance with a random number generated by the random number generator 24.

To explain this using an example of repeated description, the program description for a subroutine call includes multiple parameters that are repeated, such as CALL sub 1 tochin name (parameter 1, parameter 2, etc.), and parameters that are added for ease of viewing. "," will be written in between.

When it is necessary to create a test program 30 that supports such repetition, in the attribute grammar description IO,
This program description is called subroutine call → 'CALL' subroutine name"('parameter(",
'Parameter)#Describe it as follows. here,"
The part separated by `` (...)'' indicates that it will be repeated a number of times determined by a random value, and the symbol ``,'' separated by ``'' becomes the text of the test program 30 as it is. Represents a terminal symbol. That is, it describes the repetition of a pair consisting of a terminal symbol "," and a non-terminal symbol "parameter."

Also, to explain using an example of an abbreviated description, when it is necessary to create a test program 30 that corresponds to an IF statement where the ELSE statement can be omitted, in the attribute grammar description 10, IF statement → 'IF'condition'TIIEN' statement ['E[,SE' statement]
It is written as "END-IF". here,"(
. . .)” indicates that the presence or absence of omission is determined according to a random value. In other words, it is stated that the description of the pair consisting of the terminal symbol "BIELSE" which becomes text as is and the non-terminal symbol "sentence" can be omitted.

When the reader 21 reads a non-terminal symbol paired with such a terminal symbol, the internal format of the paired terminal symbol is added to the variable printing attribute of the corresponding non-terminal symbol name in the structure variable management unit 25. Substitute. Through this process, the structure variable management unit 25 manages the terminal symbol as a pair as a printing attribute for a non-terminal symbol to which a terminal symbol is added. When the expansion processing unit 23 completes the creation of the internal format program, the text of the test program 30 corresponding to the non-terminal symbol is obtained. The text obtained in this way is managed by the value attribute of the variable with the corresponding non-terminal symbol name in the structure variable management unit 25. For non-terminal symbols in the attribute grammar description 10, the writer 28 outputs the text of this value attribute managed by the structure variable management unit 25 (thereby outputting the text of the value attribute in the test program 30).
However, at this time, for non-terminal symbols that have print attributes, the print attribute output unit 29 of the writer 28 outputs the text of the terminal symbol managed as the print attribute before outputting the text of the non-terminal symbol. Process to output.

In this way, when repeated descriptions of non-terminal symbols paired with terminal symbols are not allowed, attribute grammar description 10
Now, subroutin call → CALL” saputin name” (“parameter (comma and parameter)’) 0 comma and parameter →”, whereas it had to be written as ’parameter, this type of description format is now allowed. Then, subroutine call → ``CALL' saputin name'' (``parameter same,'
Since the parameter ) ``) m is sufficient, it is no longer necessary to write a one-line description, and the descriptive nature of the attribute grammar description can be improved.

In addition, when the abbreviated description of a non-terminal symbol paired with a terminal symbol is not allowed, in the attribute grammar description IO, IF statement → '1bi condition "T)IEII" statement fBLsE statement)"END
-1 PELSE statement → "ELSE" statement had to be written, but by allowing such a description format, IF statement → "IF'condition"THEN' statement 1 "ELSE"statement)"EN
Since "D-IF" is sufficient, there is no need to write a one-line sentence description, and the descriptive nature of the attribute grammar description can be improved.

As described above, according to the present invention, it is possible to improve the descriptive nature of the attribute grammar description in the test program creation processing device for the earlier patent application filed by the present applicant, and it is possible to efficiently produce test programs. This is what happens.

〔Example〕

Hereinafter, the present invention will be explained in detail according to examples.

FIG. 2 shows an explanatory diagram of how to use a test program automatically created according to the present invention. In the figure, the same parts as those explained in FIG. 1 are indicated by the same symbols.

Reference numeral 40 denotes a language processing program to be inspected, which executes the compilation process of the processing target sentence to be described in the attribute grammar description IO, and 41 is a test object program, which is executed by the language processing program 40. 42 is an object program of the compiled test program 30; 42 is a linker for linking the test object program 41 with the program in the library 43; 44 is a linker 42;
The CHECK program 45 is a test routine that is linked to the test object program 41 and is a test routine for checking the execution results of random number statements written in the test program 30. The load module 46 is an execution result output representing the execution result of the load module 45.

As shown in this figure, a test program creation processing device 20 according to the present invention is prepared for creating a test program 30 necessary for verifying the function of a language processing program 40, and The test program 30 is automatically created from the attribute grammar description IO written in accordance with the manual.

FIG. 3 shows an example of the attribute grammar description 10 regarding "assignment statement". This attribute grammar description 10 is created by creating a plurality of "assignment statements" in various formats, and then using the language processing program 40.
It is created by a programmer or the like to test whether or not a correct numerical value is calculated when the calculation process is performed on those "assignment statements". FIG. 4 shows an example of a test program 30 that will be automatically created from this attribute grammar description 10.
is a random number statement (generated by random number selection processing for the expansion rule of "assignment statement"), which is the − aspect of "assignment statement".
and a confirmation statement for calling the CHECK program 44 as a basic unit, and a plurality of these basic units are connected.

To explain specifically, AAE=-2991448 CALL CHECK(1, AAE, -133952
) constitutes the basic unit of the test program 30. What this basic unit means is AAE=-299
When the random number statement *44B is processed by the language processing program 40, -133952 (=
If the value of -299 lines 448) is sent, it means that correct processing has been performed, so call the CHECK program 44 using this variable name and value as arguments.
A L L CHE CK (1, A A E, -
133952) is created by pairing it with this random number statement.

Before entering into a detailed explanation of the present invention, the automatic creation process of the test program 30 that will be executed by the test program creation processing device 20 according to the present invention will be explained using the attribute grammar description IO of FIG. 3 as an example. . Here, the system configuration of the test program creation processing device 20 is the same as that described in FIG.

When the reader 21 reads the attribute grammar description 10 shown in FIG. 3, it converts the read attribute grammar description 10 into an internal format. Upon receiving this converted attribute grammar description IO, the translation processor 22 uses the variable name "Item number value" of the system variable according to the starting symbol "\ Grammar description" (setting item number value l). In this setting process, when the translation processor 22 interprets the symbol "setting", it activates a function named "setting" managed by the semantic description interpretation r&27. This will cause it to be executed. Specifically, this semantic description interpreter 27 is constructed of, for example, a LISP system, and when a defined function is called, it executes the processing of the function and transfers the processed value to the translation processor 22.
It will be processed so that it is returned to

The translation processor 22 generates a predetermined number (in this example, specified by a random number between 5 and 10) of "assignment statements" using the following <'aNL" assignment statement 5 10>&. Test program for 30
I learned that it is necessary to create each line with a new line.

This "assignment statement" is not delimited by "", so it is a non-terminal symbol that cannot be converted into text as is. For such non-terminal symbols, the translation processing unit 22 has a description of how to expand them into text in another position.
executes the expansion process according to the expansion rule 11.

In this example, the variable ′= expression and the "assignment statement" are then defined, and the definition of the "variable" in this definition is expanded at the 0 part in the diagram, and the "expression" is expanded. The definition is expanded in the 0 part of the diagram. The symbols ■ and rN in the 0 part indicate that one of them is selected according to a random number. From now on, the translation processor 22 selects, for example, the variable name rAAEJ as the "variable" of the "1 assignment statement" according to random number processing, and selects the variable name of "1 assignment statement" as the "variable", and
For example, select 2 of ``Number 1 and Number 2'' as the expression. Specifically, in the process of selecting a selection target using random numbers executed at this time, the random number generation unit 24 generates a total sum (in this example, all "100") of selection values written before the selection target ( In this example, this is done by generating a random number within the range of "500" and selecting the selection target to which the generated random number belongs. Furthermore, for items that are further expanded, such as "number 1 and number 2," expansion continues according to the expansion rules. In this example,
The number 1 and the number 2 are further expanded at the 0 part, so according to that expansion, for example, as the ``number 1'', we can write ``-299''.
” and “448′” as “Number 2”.

In this way, AAE=-299*4, which is one aspect of the assignment statement located at the beginning of the test program 30 in FIG.
48 will be created.

By "assignment variable (value expression) J" written following the definition of "assignment statement", the translation processor 22 activates a function named "assignment" managed by the semantic description interpreter 27, The value of the "expression" is set in the "variable" of the language variable to be tested. In this case, rAAEJ is selected as the "variable", so the value of the "formula" is set in the variable name rAAEJ. This "Ni"
Specifically, the value of [Math 1 * Math 2
It is calculated using the r value setting (*(value number 1) (value number 2)) j written following J. This calculation process is also executed by the meaning description interpreter 27, and in this case, the value of “numeric value 1” is “-29”.
9'' and "448", which is the value of "Numerical value 2", "-133952" is calculated as the value of this "formula". From now on, "-133952" will be set in the variable name rAAEJ.

At the end of the definition of "assignment statement", it is required to expand "confirmation". The nature of this "rII recognition" is shown in the 0 part of the figure. from now,
The translation processor 22 follows the expansion rule for the 0 part and reads “
Use CHEC with the value "1" of "Item number", rAAEJ of "Variable", and "-133952" of "Variable value" as arguments.
CALL CHECK (1, AAE, -133952
) is executed. In this way, A
AE=-299*448 CALL CHECK(1, AAE, -133952
) The creation of the internal format test program will be completed. Finally, according to the update rule for the 0 part, the semantic description interpreter 27 is activated and the value of the variable name of the "item number value" of the system variable is incremented by one step for the next random number statement. Process to advance the process.

The translation processor 22 then repeats the same process to create an internal format test program as shown in FIG. 4. And attribute grammar description I
When the creation of the internal format test program corresponding to O is completed, the writer 28 outputs the created internal format test program as an executable test program, and ends the creation process of the test program 30.

In this way, the translation processor 22 executes expansion into an internal format test program by recursively executing expansion according to the expansion rule 11 in the attribute grammar description 10. During this expansion, if it is necessary to execute the semantic description 12 in the attribute grammar description 10, the semantic description interpreter 27 is activated, and the activated semantic description interpreter 27 is configured as a structure. A process of updating variable data in the variable management unit 25 to new data is executed. Then, the translation processor 22 executes the expansion into the internal format test program while referring to this updated variable data, and also regarding the selectivity rules included in the expansion rules 11 necessary for expansion. This is performed by selecting the selection target according to the random number value generated by the random number generation section 24.

Next, the features of the present invention will be explained. In the present invention, as explained in the [Operation] section, the attribute grammar description 10
The repeated descriptions and abbreviated descriptions of non-terminal symbols described in the above are characterized in that they are described in pairs with terminal symbols.

That is, if we take an example of a repeated description, which is a description that repeats a non-terminal symbol, which is a number of times determined according to the random number generated by the random number generation unit 24, then ! Buttotin call → 'CALL'' Saputin name'(''parameter('','
Parameter) ``)'' is written by repeating a pair consisting of a terminal symbol ``,'' and a non-terminal symbol ``parameter''. In addition, the random number generator 24
To explain this using an example of an abbreviation description, which is a description that determines whether to omit or not according to the generated random value, 1F statement → IF" condition "THEN" statement ("f!LSEs statement]"EN
As shown in D-11, the description of a pair consisting of a terminal symbol "ELSE" and a non-terminal symbol "sentence" can be omitted.

Next, how the present invention processes such a description format will be explained according to the flowcharts shown in FIGS. 5 and 6. Here, the flowchart in FIG. 5 is a flowchart executed by the reader 21, and the flowchart in FIG. 6 is a flowchart executed by the writer 28.

As shown in step 1 of the flowchart in FIG. 5, the reader 21, when reading the characters of the attribute grammar description IO and converting them into the internal format, determines whether the read characters are the first characters of the abbreviated description. to judge. To explain according to the example above, it is determined whether the read character is "(" or not. When it is determined that the read character is the first character of the abbreviation description, the corresponding function is started. Then, the processes of steps 2 and 3 are executed.In other words, as shown in step 2, the reading process up to the last character of the abbreviated description (in the above example, it is []'') is executed, and the The characters are converted into an internal format and processed to be passed to the translation processor 22. At this time,
As shown in step 3, processing is performed to register the paired terminal symbols in the variable printing attribute of the corresponding non-terminal symbol name in the structure variable management unit 25. With this process, if we explain using the above example, "(......)"
The terminal symbol described in the part delimited by "[...]" will be registered in the printing attribute of the variable of the non-terminal symbol name described in the part delimited by "[...]".

On the other hand, when it is determined that the read character is not the first character of the abbreviated description, as shown in step 4, it is determined whether the read character is the first character of the repeated description. To explain according to the example above, it is determined whether the read character is "(" or not. When it is determined that the read character is the first character of the abbreviation description, the corresponding function is started. Then, the processes of steps 5 and 6 are executed.In other words, as shown in step 5, the reading process up to the last character of the repeated description (in the above example, ``mouth'') is executed, and the read characters are It converts it into an internal format and passes it to the translation processor 22.At this time, as shown in step 5, a set is added to the print attribute of the variable with the corresponding non-terminal symbol name in the structure variable management unit 25. Process to register the terminal symbol that is specified.

By this process, if we explain using the example above, "(...
The terminal symbol written in the part delimited by "(......)" is registered in the printing attribute of the variable of the non-terminal symbol name written in the part delimited by "(......)". will be done.

When it is determined in step 4 that the character is not the first character of the repeated description, the reading process is performed as is, and the read character is converted into an internal format and passed to the translation processor 22. Then, following steps 3, 6, and 7, in step 8, it is determined whether or not reading of the attribute grammar description 10 has been completed, and when it is determined that reading has not been completed, processing returns to step 1. It turns out.

Upon receiving the internal format of the attribute grammar description 10, the translation processor 22 executes the expansion process by performing the random number selection process as explained in the example of the attribute grammar description 10 in FIG. , execute the creation of an internal format test program. When the creation of the internal format test program is completed, the text to be output is assigned to the value attribute of the variable of each non-terminal symbol name in the structure variable management unit 25. In creating this internal format test program, the expansion processing unit 23
For the abbreviated description, by comparing the random number generated by the random number generator 24 with the specified probability value, it is determined whether or not the non-terminal symbol targeted by the abbreviated description is omitted, and the process is repeated. Regarding the description, the number of repetitions of the non-terminal symbol that is the object of the repeated description is determined according to the random number generated by the random number generator 24.

In this way, the test program 30 to be output
When the creation of the text is completed, the writer 28 determines whether or not a terminal symbol is registered in the print attribute of the non-terminal symbol of the text to be output, as shown in step 11 of the flowchart of FIG. 6, when outputting the text. Check.

When it is determined by this check that a terminal symbol is registered in the printing attributes, as shown in step 12,
The text of the pair of terminal symbols is output, and then, as shown in step 13, the text of the expansion result of the corresponding non-terminal symbol is output. At this time, for repeated descriptions, a set of terminal symbols is output for each repetition.

From now on, when ('', 'parameter) is repeated three times, the text will be output as if it were defined as ``, 'harameta', 'parameter', 'parameter'.

On the other hand, if it is determined through the check in step 11 that the terminal symbol is not registered in the printing attributes, the text resulting from the expansion of the corresponding non-terminal symbol is output immediately according to the process in step 13 without performing the process in step I2. Process it so that it does.

Then, in step 14, it is determined whether or not all the text has been output, and if there is any remaining text that has not been output, the process returns to step 11. Note that in the abbreviated description, when it is decided to omit, no substantial text is output.

As explained above, the present invention is characterized in that repeated descriptions and abbreviated descriptions of non-terminal symbols are described as a pair with a terminal symbol, and when such a description is made, It is characterized by processing to output the text of the original description content.

From now on, if we define the repetition of the non-terminal symbol 1A'' using the symbol system A*-(A), then subroutine call → ``CAL pi subroutine name'' (m parameter (comma and parameter) ``)'' comma and parameter → #, ' In contrast, in the present invention, subroutine call → 'CALL'' subroutine name'' (``parameter ('',
The description ``parameter) ``)'' is sufficient.

This reduction in the number of definitions by one also applies to abbreviated descriptions, as explained in the [Operation] section.

Also, the repetition of the non-terminal symbol “A” is expressed as A*→A
A* e However, if e is written as an empty symbol, there will be a problem that it will be difficult to control the number of repetitions and interpret the generated tree, but if the present invention is used, such problems will not occur.

〔Effect of the invention〕

As described above, according to the present invention, in a test program creation processing device that automatically creates a test program for a language processing program from an attribute grammar description, the number of expansion rule definitions that must be defined in the attribute grammar description can be reduced. can be reduced by one, and attribute grammar descriptions can also be made easier to read. From now on, the efficiency of creating test programs will be significantly increased, and the quality of testing will also be improved.

[Brief explanation of the drawing]

Figure 1 is a diagram showing the principle configuration of the present invention, Figure 2 is an explanatory diagram explaining how to use a test program automatically created by the present invention, Figure 3 is an example diagram of an attribute grammar description, and Figure 4 is an illustration of an example of attribute grammar description. Figure 3 is an explanatory diagram of a test program created from the attribute grammar description, Figure 5 is a flowchart executed by the reader, Figure 6 is a flowchart executed by the writer, and Figure 7 is an explanatory diagram of the invention previously filed. It is. In the figure, 10 is an attribute grammar description, 11 is an expansion rule, l2 is a semantic description, 20 is a test program creation processing device, 21 is a league, 22 is a translation processor, 23 is an expansion processing unit, 24 is a random number generation unit, 25 2 is a structure variable management unit, 26 is a semantic description processing request unit, 27 is a semantic description interpreter, 28 is a writer, and 2
9 is a print attribute output unit, and 30 is a test program.

Claims (1)

[Claims] The processing is performed by performing random number selection processing regarding the expansion rules on a sentence to be processed by a language processing program written according to the attribute grammar description (10) consisting of expansion rules and semantic descriptions. A confirmation statement for calling a test routine that generates a random number sentence that is one aspect of the target sentence and confirms the execution result of the random number statement is written in association with the target sentence in the attribute grammar description. A test program creation processing device that generates a test program for a language processing program by generating a pair with the random number sentence by The description is structured so that pairs with terminal symbols are described as a set, and the attributes of non-terminal symbols described by the above attribute grammar description (10) are managed structurally, and the attributes of non-terminal symbols that are paired with terminal symbols are managed structurally. Regarding non-terminal symbols, a structure variable management unit (25
) and output the above created test program,
When outputting the text of non-terminal symbols forming the test program, the non-terminal symbols are stored in the structure variable management section (25).
) is managed as having a print attribute by a writer (28) that processes to output the text of the terminal symbol with the print attribute prior to outputting the text of the non-terminal symbol. , a test program creation processing device characterized by: