Patent US1903952A successfully refreshed from Google Patents.
Patent US5530863A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5530863A Expired / Lapsed US ⏱️ 0.0 years remaining

Programming language processing system with program translation performed by term rewriting with pattern matching

Assignee: Fujitsu Ltd
•
Filing: 1990-05-18
•
Granted: 1996-06-25
•
Expires: 2010-05-18
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A programming language processing system for a computer language processing system wherein a program described in a high level programming language is translated into another program written in lower level programming language. In one embodiment of the invention, a specification of a programming language incorporates a concept of handling various basic words classified by parts-of-speech including nouns, adjectives, conjunctions, and various logic words. The program described by the programming language is converted into an internal expression form based on a sentence structure which can be converted to a binary tree. In accordance with a logic synthesis rule for term-rewriting based on a pattern collation, a logic expressed by the internal expression form is subject to conversion to a lower level program description wherein the parts-of-speech are deleted.

Inventors

  • 👤 Katsushige Hino

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-02 13:16
CPC Classifications
G; G06; G06F; G06F8/00; G06F8/30; G06F8/31; G06F8/311; G06F40/00; G06F40/20; G06F40/253

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 131 words
A programming language processing system for use as a computer language processing system wherein a program described in a high level programming language is translated into a program written in a low level programming language, comprising: means for inputting a program described according to a specification of a programming language in which basic words are classified by parts-of-speech including nouns, adjectives, conjunctions, and logic words; processing means for converting said program described according to said specification into an internal expression form based on a sentence structure of a type that can be converted to a binary tree, and for converting a logical meaning expressed by said internal expression form, according to program logic for term-rewriting based on pattern collation, to a low level program description in which said parts-of-speech are deleted.
Claim 2
Dependent Claim 131 words
A programming language processing system for use as a computer language processing system wherein a program described in a high level programming language is translated into a program written in a low level programming language, comprising: means for inputting a program described according to a specification of a programming language in which basic words are classified by parts-of-speech including nouns, adjectives, conjunctions, and logic words; processing means for converting said program described according to said specification into an internal expression form based on a sentence structure of a type that can be converted to a binary tree, and for converting a logical meaning expressed by said internal expression form, according to program logic for term-rewriting based on pattern collation, to a low level program description in which said parts-of-speech are deleted.
Claim 3
Dependent Claim 89 words
The programming language processing system as recited in claim 1, wherein said processing means includes: means for obtaining a logic synthesis result according to said program logic, from said internal expression form, said logic synthesis result comprises an intermediate sentence structure and an intermediate instruction, and means for generating a program procedure part from said intermediate sentence structure and said intermediate instructions, said program procedure part being formed by an object language, and for automatically generating a program declaration part required by said program written in said object language.
Claim 4
Dependent Claim 169 words
A programming language processing system for use as a computer language processing system wherein a first program described in a high level programming language is translated into a second program written in low level programming language, comprising: means for inputting a synchronization conjunction having a well-formed formula described on the basis of a propositional logic or a predicate logic written as a synchronization condition, said synchronization conjunction being used as a basic word in a programming language; and processing means for generating, when said synchronization conjunction is detected at a time of translating the high level programming language and according to a logic synthesizer rule, a row of statements comprising: a first statement for checking an establishment of said synchronization condition, a second statement for executing a specified process when said synchronization condition has been completed, and a third statement for holding wait while said synchronization condition has not yet been completed, said processing means converting said first program, based on said row of statements, to said second program.
Claim 5
Dependent Claim 169 words
A programming language processing system for use as a computer language processing system wherein a first program described in a high level programming language is translated into a second program written in low level programming language, comprising: means for inputting a synchronization conjunction having a well-formed formula described on the basis of a propositional logic or a predicate logic written as a synchronization condition, said synchronization conjunction being used as a basic word in a programming language; and processing means for generating, when said synchronization conjunction is detected at a time of translating the high level programming language and according to a logic synthesizer rule, a row of statements comprising: a first statement for checking an establishment of said synchronization condition, a second statement for executing a specified process when said synchronization condition has been completed, and a third statement for holding wait while said synchronization condition has not yet been completed, said processing means converting said first program, based on said row of statements, to said second program.
Claim 6
Dependent Claim 173 words
A programming language processing system for use as a computer language processing system wherein a first program described in a high level programming language is translated into a second program written in low level programming language, comprising: means for inputting logic quantifiers with a set operation, said logic quantifiers being used as a basic word of a programming language; and processing means for receiving said logic quantifiers, for converting a sentence including said logic quantifiers into a statement which is reduced to a basic operation when said logic quantifiers in said sentence are detected at the time of translating said high level programming language, in accordance with a logic synthesis rule for rewriting said programming language into a plurality of said basic operations formed by said low level programming language and for judging truth or falsehood by a propositional logic formula which represents a condition judgment and acting to provide a change of a state by an act logic formula, said judging and said acting being performed when the second program is run.
Claim 7
Dependent Claim 173 words
A programming language processing system for use as a computer language processing system wherein a first program described in a high level programming language is translated into a second program written in low level programming language, comprising: means for inputting logic quantifiers with a set operation, said logic quantifiers being used as a basic word of a programming language; and processing means for receiving said logic quantifiers, for converting a sentence including said logic quantifiers into a statement which is reduced to a basic operation when said logic quantifiers in said sentence are detected at the time of translating said high level programming language, in accordance with a logic synthesis rule for rewriting said programming language into a plurality of said basic operations formed by said low level programming language and for judging truth or falsehood by a propositional logic formula which represents a condition judgment and acting to provide a change of a state by an act logic formula, said judging and said acting being performed when the second program is run.
Claim 8
Dependent Claim 28 words
The programming language processing system as recited in claim 4, wherein said plurality of said basic operations include a repeating process for said sentence including said logic quantifiers.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-06-25 1999-12-25 2000-06-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-06-25 2003-12-25 2004-06-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-06-25 2007-12-25 2008-06-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag