http://rdf.ncbi.nlm.nih.gov/pubchem/patent/EP-0529049-A1

Outgoing Links

Predicate Object
assignee http://rdf.ncbi.nlm.nih.gov/pubchem/patentassignee/MD5_05060720d78cc9178696073231d89834
classificationCPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F8-437
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F8-443
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F8-433
http://rdf.ncbi.nlm.nih.gov/pubchem/patentcpc/G06F8-447
classificationIPCInventive http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F-
http://rdf.ncbi.nlm.nih.gov/pubchem/patentipc/G06F9-45
filingDate 1992-02-18-04:00^^<http://www.w3.org/2001/XMLSchema#date>
inventor http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_eef76fdeb2a522e22aa53e36699b1d55
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_9f72c2b8009df1f3661a843451af796e
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_36ffce2763b3a16fc22d5d1c36e0415c
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_2fc95b98c80b0bb6be6b1e9dadf83068
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_dc4f488319daa64c58b743ae480eb94b
http://rdf.ncbi.nlm.nih.gov/pubchem/patentinventor/MD5_3fe5f515bd27dbdcb3f59452daaa0043
publicationDate 1993-03-03-04:00^^<http://www.w3.org/2001/XMLSchema#date>
publicationNumber EP-0529049-A1
titleOfInvention Multilanguage optimizing compiler using templates in multiple pass code generation
abstract "Framework" compiler program using a generic expert system or throttling and ranking mechanism, and a generic back-end processor (for which the code generator is recipient-specific). The generic backend processor encompasses optimization, memory register allocation, and code generation functions. The generic expert system may be implemented on various mainframes and the code generation function of the back end processor may be targeted to any of multiple computer architectures. A front-end processor is suitable for each source language, such as Cobolt, Fortran, Pascal, C, C++, Ada, etc. The front-end processor scans and parses the source code modules and constructs therefrom an intermediate language ("IL") representation of the programs expressed in the source code. This IL language is constructed to represent any of the source code languages universally, so that the interface between the front-end processor and the back-end processor is in a standard form and does not need to be rewritten for each language-specific front-end processor. The IL representation built by the front-end processor is based on a tuple as a building block, where each tuple represents a single operation to be performed - load, store, add, label, branch, etc. A data structure is created by the front-end processor for each tuple, with fields for different information needed. One of the characteristics of the invention consists of a mechanism for representing effects and dependencies in the interface between front-end processor and back-end processor; a tuple having an effect if it writes to a memory and having a dependency if it reads from a location to which another node can write. A source-language-independent mechanism is provided to describe the effects of executing the
isCitedBy http://rdf.ncbi.nlm.nih.gov/pubchem/patent/EP-2977892-A1
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-10061567-B2
http://rdf.ncbi.nlm.nih.gov/pubchem/patent/US-10657044-B2
priorityDate 1991-02-27-04:00^^<http://www.w3.org/2001/XMLSchema#date>
type http://data.epo.org/linked-data/def/patent/Publication

Incoming Links

Predicate Subject
isDiscussedBy http://rdf.ncbi.nlm.nih.gov/pubchem/anatomy/ANATOMYID181185
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID6992654
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419502926
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419520940
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID5572
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID5480431
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID419506174
http://rdf.ncbi.nlm.nih.gov/pubchem/substance/SID426285409
http://rdf.ncbi.nlm.nih.gov/pubchem/taxonomy/TAXID181185
http://rdf.ncbi.nlm.nih.gov/pubchem/compound/CID5371562

Total number of triples: 33.