JPS60120433A - Execution processing device of programming language - Google Patents

Abstract

PURPOSE:To make information processings of Japanese language or the like possible by inputting language data predicate verb and a postposition word (functioning as an auxiliary to a main word) at least and referring to predicate verbs and postpositional words having correct relations to them, which are held in a table, to detect an input error. CONSTITUTION:A character string of Japanese language from an input means is stored temporarily in a character string storage means 10, and it is detected whether a character code in a storage means 12 where this character string is shifted by one character and is stored is a symbol code or not by detecting circuits 13 and 15, and character codes which do not include symbol codes are stored in a sentence code storage means 16 successively. When the symbol code is detected by the detecting circuit 13, contents of the storage means 16 are transferred to a coincidence detecting circuit 18, and the circuit 18 refers to a predicate verb table 19a and a postpositional word table 19a to check whether these contents belong to a fundamental language system or not, and the result is reported to a CPU21 and is transmitted to a storage means 20. The CPU21 determines precedence or the like to control the storage means 10 and a decoding means 6, and an error is displayed on a display means 5.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to an execution processing device for a programming language that allows an electronic computer such as a personal computer to perform various information processing.

2be; Conventional configuration and its problems With the recent advances in semiconductor technology, the performance of personal computers has improved significantly, and it has become possible to express various types of data in kana and Japanese mixed with kanji. There is.

Furthermore, recently there has been a movement to apply this Japanese information processing to the field of programming.

Programming languages that have been developed so far include RA
There are SIC, FORTRAN, C0BOL, etc., but since these are based on English syntax, they are difficult for Japanese people to understand, and there are still some programming languages developed for Japanese, but these are based on the C0BOL language. It was based on the C0BOL grammar, and was not a Japanese written language close to a natural language that every Japanese person could use at home.

In other words, according to the conventional method of executing a programming language, a program must be created based on a language and grammar that is unfamiliar to Japanese people, and it is difficult to execute a program that can be easily created by anyone. Ta. However, this is not only a problem for Japanese people, but also for Chinese and Russian people.

Purpose of the Invention The present invention has been made in view of the above-mentioned problems, and aims to make it possible to process information using programming languages such as Japanese notation, which are close to natural languages, and to enable anyone at home to easily create programs. SUMMARY OF THE INVENTION The present invention provides an input means into which language data to be at least predicate verbs and particles are input, and correct predicates of the basic syntactic system as language data in advance. A predicate verb table that holds verbs, a particle table that holds particles that have a correct connection relation to the predicate verbs that are held in the predicate verb table, and linguistic input data input by the input means. However, by providing a detecting means for detecting syntactic errors in the linguistic input data by referring to the predescriptive word table and the particle table, the present invention achieves a "routing" feature.

DESCRIPTION OF EMBODIMENTS An embodiment of the present invention will be described below with reference to the drawings.

FIG. 1 shows a block configuration of a programming language execution processing device in an embodiment of the present invention.

In FIG. 1, reference numeral 1 denotes an input means such as a typewriter, into which Japanese characters are sequentially input. Reference numeral 2 denotes a sentence priority order determining means that uses "[, ]" to form one unit from the Japanese character string inputted from the input means 1. 3 is a word/phrase inspection means that uses a dictionary 4 to check whether a Japanese character string is consistent with a predetermined basic language system as described below; if an error is found, an error display means 6 displays A message to that effect is displayed, and if it is correct, the decoding means 6 is notified of the fact and starts decoding. When the decoding means 6 receives an instruction to start decoding from the word checking means 3, it converts it into an interpreter language that can execute six pages, and then sends it to the calculation/execution means 7 for execution.

In the above configuration, it is assumed that a Japanese program is first inputted from the input means 1 in the step order shown in FIG.

At this time, the highest priority of the Japanese language program shown in FIG. 2 is from step 4 in FIG. So step 4~
If 9 is set to 1, the Japanese program will be as shown in Figure 3.

The next highest priority is the second half of step 1, steps 2, 3, and 10. Therefore, if we define these steps as ■, we will get a Japanese program as shown in Figure 4.

Therefore, the sentence priority determining means 2 sends information to the word/phrase checking means 3 using a systematic program as shown in FIG. 6 based on "[, ]".

Next, the word/phrase inspection means 3 temporarily stores the input sentence. Then, the phrase inspection means 3 uses the dictionary 4 to inspect whether each sentence has a predetermined basic language system as shown in the table below. As a result of the inspection, since the Japanese program shown in FIG. 6 complies with the basic language system shown in the table below, no error message is sent to the error display means 5, and the decoding means 6 is notified of the fact. Start decoding. When the decoding means 6 receives an instruction to start decoding from the word/phrase checking means 3, it sequentially inputs the Japanese programs temporarily stored in the word/phrase checking means 3 as shown in FIG. After conversion, it is sent to calculation/execution means 7 for execution processing.

The following margins are 1 o page.Next, while referring to Figure 6, text search means 2. word inspection means 3. The configuration of the main parts of the dictionary 4 will be explained in more detail.

FIG. 6 shows sentence priority order determining means 22 word inspection means 3. and shows the main block configuration of the dictionary 4.

In FIG. 6, reference numeral 10 denotes a character string storage means for sequentially storing character strings inputted from the input means 1 in the form of JIS code or ASCII code;
A clock signal of 1 causes a shift to the left. Reference numeral 12 denotes a storage means for storing a code for one character shifted from the character string storage means 1o, and 13 a detection circuit for detecting whether or not the code stored in the storage means 12 is the code of "]". , 14 detect whether the code stored in the storage means 12 is a code of ".".

A detection circuit 15 detects whether or not the code stored in the storage means 12 is the code "["].
Each detection circuit 13, 14.15 is a clock signal generator 11
Detection is started at the same time as 11 and 11 by the clock signal generated by . Reference numeral 16 denotes a text code storage means that sequentially stores the contents of the storage means 12 whose detection has been completed. When the detection circuit 16 detects " 17 is a gate that allows the content to be transferred from the text code storage means 16 to the match detection circuit 18 when the detection circuit 13 detects the symbol ``]''. Referring to the verb table 19a and the particle table 19b, it is possible to determine whether the predicate in the sentence code string sent from the gate 17 belongs to the basic language system as shown in the table, and whether the particle in the predicate is Check whether the connection with the predicate also belongs to the basic language system. Then, the predicate test result, which is the basis of the language system, is notified to the CPU, which will be described later, and the sentence code string is sent to the storage means 20. 21 controls the character string storage means 1o so that the next priority order can be determined after determining the highest priority order, and also an error display means when the predicate and the connection relation between the predicate verb and the particle are inputted incorrectly and there are 12 pages. This is a CPU that displays an error message via 5.

The operation of the above configuration will be explained below.

When a Japanese program as shown in FIG. 2 is sent from the input means 1 in JIS code or ASCII code, the character string storage means 10 sequentially stores the character codes.

Next, the character string storage means 10 sends the character code for one character to the storage means 12. Then, each detection circuit 13.15 detects that the character code sent to the storage means 12 is "(,)".
It is detected whether the symbol code is or not. For example, the character code up to "Sales Calculation" in Step 1 shown in FIG.
The symbol code of "°" is detected by the detection circuit 16. Therefore, the character code of "Sales Calculation wa" stored in the text code storage means 16 is reset by the reset signal of the detection circuit 16.

In the same way, the sentence code from step 1 to step 3 has "[" at the beginning of step 4, so
The contents are reset by the detection circuit 16. Next, the codes from step 4 to step 9 are stored in the sentence code storage means 16.

At the end of step 9, the detection circuit 13 detects
Since the symbol code of
7 and stored.

The coincidence detection circuit 18 is as follows. The detection circuit 14 detects among the codes stored in the storage means 12. Since the code `` is detected, the detection circuit 14 is informed of the code that should be predicated in the code from step 4 to step 9 sent from the gate 17. Predicate verb table 19 that stores codes
By referring to the contents of a, the match detection circuit 18 checks the predicate verbs up to step 9. ! , the coincidence detection circuit 18 determines the particle in the predicate in the Stella 14 page 9''i1 from step 4 by referring to the contents of the particle table 19b that stores the particle code to be connected to the predicate verb. Check connections.

As a result of these two tests, it was detected that there were six correct sentences from step 4 to step 9, and the CP
Notify U21 of this. The coincidence detection circuit 18 then sends the held information to the storage means 20 and stores it therein.

Next, when the character code string is sent to the storage means 2o, the CPU 21 compares it with the contents of the character string storage means 10, and sets the corresponding content part as I as shown in FIG. After updating the contents, the code string with the contents shown in FIG. 3 is stored again. Then, the next highest priority is examined in the same way, and the priority is finally determined using the system shown in Figure 5. After checking the subject and modifiers in the same way, the decoding means 6 Information is sent and decrypted.

As described above, according to this embodiment, the order of processing in a Japanese program is determined by the means shown in FIG. This makes it possible to quickly process Japanese programs.

Effects of the Invention The present invention, as described above, can easily determine the processing order of a program even in a programming language such as Japanese notation by performing processing based on predicates such as Japanese. Information processing can be performed using programming languages similar to Japanese notation, which is of great value.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a programming language execution processing device according to an embodiment of the present invention; FIGS. 2, 3, and 4 are diagrams showing part of a program executed by the processing of the device; FIG. 6 is a diagram showing the program processing system of the device, and FIG. 6 is a block diagram of main parts of the device.

Claims (1)

[Claims] An input means into which linguistic data to be at least predicate verbs and particles are input, a predicate verb table that holds correct predicate verbs in the basic syntactic system as linguistic data, and predicates held in the pre-descriptive verb table. Syntactic errors in the language input data can be detected by referring to the particle table that holds particles that have a correct connection relation to the verb, and the preceding descriptor table and the particle table for the language input data input by the input means. A programming language execution processing device comprising a detection means for detecting.