GB2130408A

GB2130408A - Computer programmed for changing its natural language

Info

Publication number: GB2130408A
Application number: GB08330357A
Authority: GB
Inventors: Georges Zakharia
Original assignee: Individual
Current assignee: Individual
Priority date: 1982-11-19
Filing date: 1983-11-14
Publication date: 1984-05-31
Also published as: GB8330357D0; FR2536555A1; FR2536555B1

Abstract

A computer has an interpreter which replaces key words expressed in a first natural language (e.g. English) by a code in machine language. The key words are recorded in a given order in a first memory region. In order to enable the computer to operate in a second natural language (e.g. French), the key words in the second language are recorded corded in the same order in a second memory region, which is then substituted for the first memory region.

Description

SPECIFICATION Computer programmed for changing its base language The present invention relates to methods for changing the base language of a computer, and to computers programmed for changing their base language, and more specifically relates to the invention of a process for changing the language from which the key words of a language for programming a computer, especially a mirocomputer, are chosen.

It is known that the programming of a computer can be done only by using a programmable language which includes a certain number of key words chosen from a particular language, most frequently English.

Each key word specifies an instruction which has to be performed by the computer.

When a computer which includes an "interpreter" is being programmed, instructions are fed into the latter by means of a key board and these instructions, which are stored in a buffer memory, are analysed by the computer's interpreter. This analysis consists of identifying the different key words contained in these instructions in order to replace each of them by machine code which enables the computer to carry out the instructions. This identification is obtained by a comparison of the various words read in the instructions fed into the computer with the various words on a list of key words pre-recorded in a given order in a region of memory which is either a read-only memory unit of the computer or a medium such as a disc, the contents of which are intended to be transferred automatically to one of the computer's random-access memories.Then the computer's interpreter replaces each of the key words recognised in the instructions fed in by its machine code, i.e., by a binary number which is characteristic of this key word, in order to enable the computer to carry out the instructions.

In the reverse process, when decoding in order to display a result, the interpreter replaces all numbers which represent a letter, a figure or an instruction respectively by such letter, figure or key word corresponding to this instruction, and the information which has been decoded is displayed, for example on a screen, as it appears in the recorded list of the key words.

This has the disadvantage of allowing the computer to be used only by persons who have a certain knowledge of the language from which the key words are chosen or, at least, of discouraging potential users whose mother tongue is not that from which the key words have been chosen, particularly since the error messages displayed by the computer to notify the user of any error in programming also consist of words chosen from the key words language. This may upset a user who is not sufficiently acquanted with the said language even more, and possibly does not allow him to understand his programme errors.

It is proposed, by means of the present invention, to remedy these disadvantages by a very simple and inexpensive operating process.

Accordingly, the purpose of the invention is to provide a method making it possible to change the language from which the key words of a computer programming language have been chosen so that any user who does not wish to converse with the computer in the said language may change the language.

For this purpose, the method according to the invention is characterised by the fact that it consists in recording, in a second memory region which can replace the first storage region, in which there are recorded in series and in a given order the key words chosen from a first language, the list of the same key words expressed in a second language and taken in the same order and then of substituting the second memory region for the first.

The invention also comprehends a computer provided with an interpreter which replaces by a code in machine language each of the key words expressed in a first language, the list of which words is recorded in a a given order in a first memory region, in which the computer is programmed to record in a second memory region, which can be substituted for the first memory region, the list of the same key words expressed in a second language, taken in the same order and associated with the same codes in machine language, and then to substitute the second memory region for the given first memory region.

In addition to the low cost and ease of putting such a process into effect, it has the basic advantage of not calling for any alteration of the programmes themselves.

When it is intended for a computer, whose interpreter is contained in a read-only memory unit of the computer, the process according to the invention is preferably characterised by the fact that it consists of replacing this read-only memory unit by a like read-only memory unit in which the list of key words chosen from the second language has been recorded. On the other hand, if the interpreter is on a medium such as a disc and is intended to be loaded automatically into one of the computer's random-access memories, the process according to the invention is preferably characterised by the fact that it consists of replacing this medium by a similar medium on which there is an interpreter modified by the recording of the list of key words expressed in the second language.

The present invention woll be understood better by means of an embodiment of the invention which is described below, purely by way of example and not by way of limitation.

The programme is entered line by line, using a keyboard, into a microcomputer which has initially been programmed with a programming language, the key words of which have been expressed in English. Each line is a series of a maximum of 255 characters, including the spaces between the words, the letters or the numbers and this line is stored, as it is recorded, in a buffer memory region, in which the line is analysed.

This analysis consists of looking for the key words in the programming language used, which appear in the line.

This search is done by the computer's interpreter which, after identifying the key words contained in each line, replaces them by their code in machine language.

For example, if the line "10 NEXT I" is entered, this is recorded in the buffer memory in the form of a sequence of 9 characters: 1101 INJEIXITI Ill Since the first letter which appears in this line, reading from left to right, is an N, the computer searches for the key words or words beginning with an N in the first memory region in which the list of key words in English has been recorded in series in a given order. If such words exist, the check continues in respect of the letter following the N in the first word to be found on the line which is read and so on until the correspondence is complete, thereby ensuring identification of the key word.

If the list appears in the following way: EINIDIFIOIRINIEIXITIDIAITIAI in this first memory region in which the list of key words in English has been recorded in series in a given order,the word "NEXT" which is the first word to appear in the line stored in the buffer memory is recognised as being the key word in the third position in the list of key words.

The interpreter allocates to it a code number which is equal to the rank of the key word in the list, in this example 3, increased by a constant, for example 128, so that the number 128 + 3 = 131 represents the word NEXT in the memory.

The above input line is then coded into machine language as follows: 49 48 131 73 in which 49 is the internal code of the "1" 48 is the internal code of the "0" 131 is the internal code of "NEXT" (128 + 3).

73 is the internal code of "I" Since in the list, the keywords follow each other without a break, to indicate a word end, the last letter of each keyword is coded differently, by the sum of the code of the letter and of the constant, which is 128 in this example.

When decoding takes place, it is obvious that any internal code of less than 128 corresponds to a letter or a figure while any code greater than 128 corresponds to an instruction key word, the rank of which is found in the list by deducting the value of the constant, i.e., 128, from this code. For example, if the code is 131, the rank of the keyword corresponding to this code in the list of key words is 131 - 128 = 3; consequently, in recording the list of key words, starting from the beginning, (3-1) = 2 end-of-word codes (greaterthan 128) will be counted and the following key word will be read. Referring to the list this corresponds to the key word NEXT which may then be displayed on the screen as it appears in the list.

If it is desired to converse with the computer in French, the list of the corresponding key words in French is drawn up in the same order and is recorded in a second memory region, which can replace the one on which the list of key words in English is recorded.

For example, in order to correspond to the list shown previously, this list in French would be: FI I INIPIOIUIRIRIEIPIEI TIEIDIOININIEIEISI Consequently, when decoding the series of internal codes stored in the previous example, namely: 49 48 131 73 it is found that: 39 is still the codefor"1" 48 is still the code for "0" 131 corresponds to the third key word on the list of key words in French, i.e., REPETE 73 corresponds to the code for the letter "I" Thus, the instruction previously entered in English is decoded in French as follows:: 10 REPETE 1 The internal coding process is the same for a programme in French as for a programme in English, and it is obvious that a programme written in French is coded in machine language so that it can still be decoded in English on a computer which has not been modified, by substituting the read-only memories in which the list of the key words is recorded. The same result is obtained if the list of key words is on a medium, for example, a disc, which cooperates with the computer.

It is an advantage if the list of key words also includes all the words used in composing error messages in order that these latter may also be translated so that a French user can see this error reported in French.

In the microcomputers on the market at present, it is frequently the case that the programming language interpreter is in the read-only memory of the said microcomputer. The modification to be made according to the invention consists, therefore, of replacing the read-only memories concerned in the micro-computer by new memories which can replace them in which the list of key words has been recorded in French, in Spanish or in any other language and which therefore, enable programming to be done in the corresponding language.

However, in certain embodiments of microcomputers, the interpreter is on a disc and it is loaded automatically into a random-access memory which is reserved for it. In this case, the modification to be made according to the invention consists of preparing discs on which an interpreter appears which is modified by the recording of the list of key words in French, in Spanish or in any other language and which are such that the substitution of one of these discs for another enables the programming language to be changed correspondingly.

Claims

1. A computer provided with an interpreter which replaces by a code in machine language each of the key words expressed in a first language, the list of which words is recorded in a given order in a first memory region, in which the computer is programmed to record in a second memory region, which can be substituted for the first memory region, the list of the same key words expressed in a second language taken in the same order and associated with the same codes in machine language, and then to substitute the second memory region for the given first memory region.

2. A computer as claimed in claim 1, wherein the interpreter is in a read-only memory unit, in which the read-only memory allocated to the interpreter and pre-programmed to work in the first language is replaced by a similar read-only memory unit in which the list of key words expressed in the second language has been recorded.

3. A computer as claimed in claim 1, wherein the interpreter is on a medium such as a disc and is intended to be loaded automatically into a random-access memory in the computer, in which this medium is replaced by a similar medium on which there is an interpreter modified by the recording, in the same sequential order, of the list of key words expressed in the second language.

4. A method of changing the language from which there are chosen the key words of a programming language of a computer provided with an interpreter which replaces by a code in machine language each of the key words expressed in a first language, the list of which is recorded in a given order in a first memory region, which method consists of recording in a second memory region, which can be substituted for the first memory region, the list of the same key words expressed in a second language, taken in the same order and associated with the same codes in machine language, and then of substituting the second memory region for the given first memory region.

5. A method as claimed in claim 4, intended for a computer the interpreter of which is in a read-only memory unit, in which the read-only memory allocated to the interpreter and pre-programmed to work in the first language is replaced by a like similar read-only memory unit in which the list of key words expressed in the second language has been recorded.

6. A method as claimed in claim 4, intended for a computer in which the interpreter is on a medium such as a disc and is intended to be loaded automatically into a random-access memory in the computer, in which the method consists in replacing this medium by a similar medium on which there is an interpreter modified by the recording, in the same sequential order, of the list of key words expressed in the second language.

7. A method of changing the base language of a computer substantially as hereinbefore described.