JPS6010341A - Table retrieval method - Google Patents

Table retrieval method

Info

Publication number
JPS6010341A
JPS6010341A JP58119186A JP11918683A JPS6010341A JP S6010341 A JPS6010341 A JP S6010341A JP 58119186 A JP58119186 A JP 58119186A JP 11918683 A JP11918683 A JP 11918683A JP S6010341 A JPS6010341 A JP S6010341A
Authority
JP
Japan
Prior art keywords
words
word
tables
section
search
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP58119186A
Other languages
Japanese (ja)
Inventor
Kiyoe Koyanazu
小柳津　清恵
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Fujitsu Ltd
Original Assignee
Fujitsu Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Fujitsu Ltd filed Critical Fujitsu Ltd
Priority to JP58119186A priority Critical patent/JPS6010341A/en
Publication of JPS6010341A publication Critical patent/JPS6010341A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9017—Indexing; Data structures therefor; Storage structures using directory or table look-up

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Devices For Executing Special Programs (AREA)

Abstract

PURPOSE:To retrieve a smaller number of tables corresponding to retrieval words by dividing tables by 2 kinds of retrieval symbols and designating them as the 1st and 2nd tables in retrieving a required word from the tables used for a compiler of a central processing device. CONSTITUTION:When a retrieved word is inputted to a retrieval section 2 as an input signal 1, a table 4 in which words are listed in the alphabetical order as capitals A, B or the like of words based on the capital and length of words and a quantity n1 classified by capitals or the like and a table 5 in which a quantity m1 by length of words or the like are retrieved. Further, the quantity of corresponding capitals, e.g., n2 and corresponding length of words m1 are retrieved, and when both are inputted to a quantity comparison section 6, a smaller value of the n2 and m1 is detected and fed to a table designation section 7. The table designation section 7 is operated so as to attain retrieval from a table having a smaller quantity. When no corresponding word exists on the table, the retrieved word is described on the table as a new word by a registration processing section 3.

Description

【発明の詳細な説明】 ＋ａ）　発明の技術分野 本発明は中央処理装置のコンパイラに用いるテーブルか
ら所要の単語を検索するテーブル検索方法に関するもの
である。DETAILED DESCRIPTION OF THE INVENTION +a) Technical Field of the Invention The present invention relates to a table search method for searching a table for use in a compiler of a central processing unit for a desired word.

（ｂ）　従来技術と問題点 中央処理装置が原始プログラムをコンパイルするのにテ
ーブルを盛んに用いている。此のテーブルは例えば、首
文字別に登録されている。即ちＡ・Ｂ−Ｃのアルファベ
ット順である。従って単語を検索しようとすると、同−
首文字に登録される単語の数が多く結果として所要単語
を検索するのに時間を要すると言った欠点があった。(b) Prior Art and Problems Central processing units extensively use tables to compile source programs. This table is registered, for example, by first letter. That is, it is in alphabetical order of A, B-C. Therefore, when you try to search for a word, the same -
There is a drawback that the number of words registered in the initial letters is large, and as a result, it takes time to search for the desired word.

（Ｃ１発明の目的 以上従来の欠点に鑑み本発明は、単語検索が能率良く短
時間で行えるテーブル検索方法を提供することを目的と
するものである。(C1 Purpose of the Invention) In view of the drawbacks of the prior art, it is an object of the present invention to provide a table search method that allows word searches to be performed efficiently and in a short time.

（ｄｌ　発明の構成 簡単に述べると本発明は、コンパイラの単語検索テーブ
ルを少なく共二種類の検索記号別に分割しそれぞれを第
一、第二のテーブルとすると共に、検索に際して前記両
テーブルの検索単語に対応する数の少ないテーブルを摘
出する手段を備え、数の少ない該テーブルを検索するよ
うにしたことを特徴とするものである。(dl Structure of the Invention Briefly stated, the present invention divides a word search table of a compiler into at least two types of search symbols, each as a first table and a second table, and uses search words in both tables during a search. The present invention is characterized in that it includes a means for extracting a table with a small number corresponding to , and searches for the table with a small number.

（ｅｌ　発明の実施例 以下本発明の実施例を図を用いて詳細に説明する。(el　Embodiments of the invention Embodiments of the present invention will be described in detail below with reference to the drawings.

図は本発明のテーブル検索方式を示す一実施例のブロッ
ク図である。The figure is a block diagram of an embodiment of the table search method of the present invention.

図に於いて、１は入力信号、２は検索部、３は登録処理
部、４と５はテーブル、６は数量比較部、７はテーブル
指定部をそれぞれ示す。テーブル４には単語の首文字Ａ
−Ｂ等のアルファベット順に単語が記載され、首文字別
の数量もｎｌ、ｎ２と記載されている。テーブル５には
単語長さ別に数量ｍｌ、ｍ２と上記したように記載され
ている。In the figure, 1 is an input signal, 2 is a search section, 3 is a registration processing section, 4 and 5 are tables, 6 is a quantity comparison section, and 7 is a table specification section. Table 4 shows the initial letter A of the word.
The words are listed in alphabetical order such as -B, and the quantities for each initial letter are also listed as nl and n2. Table 5 shows the quantities ml and m2 for each word length, as described above.

要つ検索単語は入力信号１として検索部２に入力される
。検索部２は首文字と単語長さに基づいてテーブル４と
５を検索し該当する首文字の数量例えばｎ２と、該当す
る単語長さｍｌを検索し、それぞれの数量ｎ２．ｍｌを
数量比較部６に入力する。数量比較部６はｎ２．ｍｌの
小さい方を検出しテーブル指定部７に伝える。テーブル
指定部７は数量の少ないテーブルから検索を行うように
動作を行う。若し検索部２がテーブル４と５とを検索し
該当する単語がなければ、検索部２は登録処理部３を作
動し新単語としてテーブル４と５に登録記載を行う、此
の記載により該当する数量を変更することは言うまでも
ない。The essential search words are input to the search section 2 as an input signal 1. The search unit 2 searches tables 4 and 5 based on the initial letter and word length, searches for the corresponding quantity of the initial letter, for example n2, and the corresponding word length ml, and searches for the respective quantities n2. ml is input to the quantity comparison section 6. The quantity comparison section 6 is n2. The smaller ml is detected and transmitted to the table specifying section 7. The table specifying unit 7 operates to search from tables with a small number of tables. If the search unit 2 searches tables 4 and 5 and does not find the corresponding word, the search unit 2 activates the registration processing unit 3 and registers and describes the new word in tables 4 and 5. Needless to say, the quantity to be used must be changed.

（「）発明の効果 以上詳細に説明したように本発明のテーブル検索方式は
単語検索が従来の検索数量の半分以下で行え、従って単
語検索が能率良く短時間で行えるものとなり、コンパイ
ル処理を行う」二で利点の多いものとなる。(") Effects of the Invention As explained in detail above, the table search method of the present invention allows word searches to be performed with less than half the number of searches in the conventional method. Therefore, word searches can be performed efficiently and in a short time, and compilation processing can be performed. ”The second option has many advantages.

【図面の簡単な説明】[Brief explanation of the drawing]

図は本発明のテーブル検索方式を示す一実施例のブロッ
ク図である。 図に於いて、１は入力信号、２は検索部、３は登録処理
部、４と５はテーブル、６は数量比較部、７はテーブル
指定部をそれぞれ示す。The figure is a block diagram of an embodiment of the table search method of the present invention. In the figure, 1 is an input signal, 2 is a search section, 3 is a registration processing section, 4 and 5 are tables, 6 is a quantity comparison section, and 7 is a table specification section.

Claims (1)

【特許請求の範囲】[Claims] コンパイラの単語検索テーブルを少なく共二種類の検索
記号別に分割しそれぞれを第一、第二のテーブルとする
と共に、検索に際して前記両テーブルの検索単語に対応
する数の少ないテーブルを摘出する手段を備え、数の少
ない該テーブルを検索するようにしたことを特徴とする
テーブル検索方法。The word search table of the compiler is divided into at least two types of search symbols, each of which is used as a first and second table, and means is provided for extracting tables that have a small number of correspondences to the search words in both of the tables during a search. , a table search method characterized in that a table with a small number of tables is searched.
JP58119186A 1983-06-29 1983-06-29 Table retrieval method Pending JPS6010341A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP58119186A JPS6010341A (en) 1983-06-29 1983-06-29 Table retrieval method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP58119186A JPS6010341A (en) 1983-06-29 1983-06-29 Table retrieval method

Publications (1)

Publication Number Publication Date
JPS6010341A true JPS6010341A (en) 1985-01-19

Family

ID=14755037

Family Applications (1)

Application Number Title Priority Date Filing Date
JP58119186A Pending JPS6010341A (en) 1983-06-29 1983-06-29 Table retrieval method

Country Status (1)

Country Link
JP (1) JPS6010341A (en)

Similar Documents

Publication Publication Date Title
EP0251594A3 (en) Database system for parallel processor
JPH0581327A (en) Information retrieval supporting processor
JPS6010341A (en) Table retrieval method
JPS58114275A (en) Pattern information retrieving system
JPS62147565A (en) Input device for japanese sentence
JPH01163826A (en) Coupling processing system for relational data base
KR890016470A (en) Related database system and processing method of column data in the system
Dietz The impact of the unification on the East German economy
KR900003791A (en) Transaction processing unit
JPH04303238A (en) Simple processing system for branch processing
JPS59117673A (en) Postprocessing system of character recognizing device
JPS62109160A (en) Kana code input system
JPS648441A (en) Character string retrieving system
JPS62241025A (en) Retrieving system for plural combinations of key word aggregate
JPH03260863A (en) Document editing system
JPH0795300B2 (en) Name management method in database
JPS63157266A (en) Forming system for word dictionary
JPH0269868A (en) Language dictionary retrieving device
JPH03245233A (en) Label retrieving system
JPS62237566A (en) Automatic forming system for index
JPS6462766A (en) Machine translation device
JPH04260172A (en) Data base retrieving system
CA2100956A1 (en) Text searching and indexing system
JPS62175824A (en) Document retrieving device
Budd Jr Video history: George Hammond on Carl Byoir.