JPS59125447A - Executing method of programming language - Google Patents

Abstract

PURPOSE:To allow anybody in a family to generate a program easily by converting document data into an executable interpreter language. CONSTITUTION:Blank data is detected rom the right end of a document data storage buffer 2 and codes up to the blank data are read out as basic predicate data. Then, whether coincident basic predicate data is registered in a basic predicate table 3 or not is judged, and when not, a converter 4 is informed that the data is erroneous data. Then, a code indicating a syntax error is generated in an interpreter data storage buffer 5. When the data is registered in the table 3, on the other hand, modifier data is read out of a modifier table 6 corresponding to the basic predicate data and whether there is corresponding modifier data in a buffer 2 or not is judged. When there is the modifier data in the buffer 2, a unit data extactor 7 extracts left and right term data of the modifier data from the buffer 2.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a method for executing a programming language that causes a slave computer such as a personal computer to perform various information processing.

Conventional configurations and their problems With 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 Japanese, including kana and kanji.

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 these are based on English syntax, so they are difficult for Japanese people to understand.Also, there are some programming languages developed for Japanese, but these are based on the C0BOL language. It is based on C0BOL grammar, and is not a Japanese written g-word that is close to the natural language that every Japanese person can use at home.

That is, according to the conventional method of executing a programming language, a program must be created based on a language and grammar that are not familiar to Japanese people, and it is difficult to execute a program that can be easily created by anyone. Also, -
This is not only a problem for Japanese people, but also for Chinese, Russians, etc.

Purpose of the Invention The present invention has been made in view of the above-mentioned problems, and provides a system that allows anyone at home to easily create programs that can process information using a programming language similar to natural language, such as Japanese notation. The purpose is to provide a method for executing Progeramink Calendar.

Structure of the Invention In order to achieve the above object, the present invention extracts predicate data from text data, extracts unit data corresponding to the extracted predicate data based on modifier data, and extracts the extracted predicate data and modifier data. , which converts text data into an executable interpreted language based on unit data.

Description of examples Examples will be described below with reference to the drawings.

FIG. 1 is a flowchart showing an embodiment of a method for executing a programming language according to the present invention.

A program written in Japanese is extracted and processed in units of sentence data separated by periods (-0).

First, the rightmost term data is extracted from the sentence data as basic predicate data.

Next, it is determined whether this basic predicate data exists in the basic predicate chifur, and if it does not exist, it is treated as a syntax error. The basic predicate data in the basic predicate table is judged whether it has modifier data corresponding to this basic predicate data, and if the text data does not have the corresponding modifier data, it is treated as a syntax error.

If there is corresponding modifier data, the term data on the left and right sides of this modifier data are extracted from the text data as intermediate data, converted according to the basic predicate data, and an executable interfilter language is created. The created interpreter word 'nn is successively interpreted and executed by an electronic measuring unit (OPU).

FIG. 2 shows a block diagram for carrying out the same embodiment. In FIG. 2, 1 is a terminal, and text data input from the terminal 1 is stored in a text data storage buffer 2.

Next, blank data is detected from the right end of the text data storage buffer 2, the code up to the blank data is extracted as basic predicate data, it is determined whether basic predicate data that matches the basic predicate data is registered in the basic predicate table 3, and the code is registered. If not, the converter 4 is notified that the data is incorrect, and a code is generated in the interpreter data storage buffer 5 that indicates a syntax error.

If the basic predicate data is registered in the basic predicate tape/L'3, the modifier data corresponding to the basic predicate data is extracted from the modifier tape/L/6, and the corresponding modifier data is stored in the sentence data storage buffer 2. It is determined whether there is data, and if there is no data, a code indicating a syntax error is generated in the interpreter data storage buffer 6, as in the case of basic predicate tape)v reference.

When the corresponding modifier data is found in the sentence data storage buffer 2, the unit data extractor 7 extracts the left and right term data of the modifier data from the sentence data storage buffer 2 and stores them as unit data. It is transferred to converter 4.

In the converter 4, code conversion is performed on 4i (modifier data corresponding to the tree dt1 data and unit data), and executable interpreter data is generated and transferred to the interpreter data storage buffer. The contents of the interpreter data storage buffer 5 are interpreted by the CPU 8,
It is actually completed.

Next, an explanation will be given using actual text data based on FIGS. 1 and 2. First, the following text data is input from the terminal 1. ``The area is [length*width].JThis sentence data is stored in the sentence data storage buffer 2, and is 1 of the basic predicate data'' is extracted.

Next, the modifier 6A data "wa" corresponding to this basic predicate data is retrieved from the modifier tape/L/6, and based on this modifier data, the sentence is written from the data storage buffer 2 to the unit data "wa". let J and ][length*width]" are taken out and sent to the converter 4.

Converter 4 uses these two degree data to convert 0PU
Interpret expressions that can be executed in B? ! 41 area=[vertical, horizontal and vertical]" is created and stored in the interpreter data storage buffer 5.

Similarly, one vertical line is 100. ”, “The width is 60.”
, and ``Calculate the area.'' The three text data items are each [vertical=1oc5. J [horizontal = 60,1
．． [Result 2 <Area>,'' is converted into three types of interpreter languages and stored in the interpreter data storage buffer 5.

The contents of this Inter 1 data storage buffer 5 are CP
Interpretation is executed successively by U8, and “Result = 50oO1”
The execution result is obtained.

By the way, in the above embodiment, the basic predicate tape/V3
The modifier table 6 can be constructed by storing basic predicate data and modifier data in correspondence with each other in a code in one storage device. Further, the converter 4 can be configured with a storage device that stores interpref data corresponding to basic predicate data and modifier data that constitute the text data. The unit data extractor 7 can be configured as a code extractor that extracts the codes of the term data on the left and right sides of the code of the modifier data.

In addition to the above embodiments, the basic predicate data and modifier data can be set as shown in Table 1.

Table '1' Furthermore, using these basic predicate data and modifier data, the Japanese programs shown in Table 2 can be created. In addition, in Table 2, A, B, N
, P, and Q indicate unit data.

Table 2 The basic predicates, modifiers, and basic form expressions of programs shown in Tables 1 and 2 are examples of the present invention, and various other expressions are possible.

Further, in the embodiment, Japanese notation has been described, but the present invention can also be applied to notation in various other languages such as Chinese and Russian.

Detailed Description of the Invention As described above, the present invention extracts predicate data from text data, extracts unit data corresponding to the extracted predicate data based on modifier data, and extracts the extracted predicate data, modifier data, It is necessary to convert text data into texts in an executable interpreted language based on unit data, and it is necessary to create programs in Japanese notation that is close to natural language and perform information processing.
It is easy to read, the grammar is simple and easy to learn, and it can be applied not only to large computers but also to personal computers.
Anyone can easily create a program even at home.

[Brief explanation of drawings]

FIG. 1 is a flowchart 1 showing an embodiment of the programming language execution method of the present invention, and FIG. 2 is a block diagram for carrying out the same embodiment. 1...Terminal, 2...Text data storage buffer 1.3...Basic predicate table, 4...
Converter, 6... Interpreter data storage buffer, 6... Modifier table, 7...
・CPU. Name of agent: Patent attorney Toshio Nakao and 1 other person
13 Figure 2!

Claims (1)

[Claims] A procedure for extracting predescriptive word data from sentence data in which unit data, predicate data, and modifier data are arranged, and extracting the unit data corresponding to the extracted predescriptive word data based on the modifier data. A method of executing a programming language, comprising: a step of converting the text data into an executable interpreted language based on the extracted unit data, predescriptive word data, and modifier data.