WO2002039647A2 - A multi-language execution method - Google Patents
A multi-language execution method Download PDFInfo
- Publication number
- WO2002039647A2 WO2002039647A2 PCT/US2001/046928 US0146928W WO0239647A2 WO 2002039647 A2 WO2002039647 A2 WO 2002039647A2 US 0146928 W US0146928 W US 0146928W WO 0239647 A2 WO0239647 A2 WO 0239647A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- code
- language
- programming language
- section
- statements
- 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.)
- Ceased
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/30—Creation or generation of source code
- G06F8/31—Programming languages or programming paradigms
Definitions
- the present invention relates to the field of data processing. More specifically, the present invention relates to the employment of multiple programming languages interleaved within a single source file for data processing operations.
- Each programming language has its strength and weakness, and is often suitable for certain applications over other applications. It is often desirable to be able to employ instructions or statements of different programming languages to solve a problem or implement an application. However, few programming languages offer such support. To the extent that mixed language execution is supported, the approach is often proprietary and not extendable to other programming languages. Thus, an improved mixed multi-language method, especially, one that is extensible to multiple programming languages is desired.
- a data processing representation is expressed in the form of code sections, which may be nested, using multiple programming languages.
- the representation is read by an execution engine.
- the execution engine identifies the programming language of each code section, and a corresponding language specific processing unit is invoked to process the code section.
- the language specific processing unit reads that section of the representation, identifying sub-sections specified in it's associated language and other subsections specified in unknown languages. It executes the sub-sections specified in its associated language with the intended semantics and in the appropriate order. When a sub-section specified in an unknown language is encountered, it delegates processing of that sub-section back to the execution engine, which repeats this process for the unknown sub-section.
- the execution engine coordinates execution of the unknown sub-section, using one or more appropriate language specific processing units, and returns the result back to the requesting language specific processor, which will continue processing where it left off.
- a header section comprising directive and/or declarative statement is also supported for one or more of the languages.
- the corresponding language specific processing unit imports data packages enumerated by the directive statement, as directed, or instantiate methods/variables enumerated by the declarative statement, for code sections of the language, as declared.
- the mixed usage of at least three programming languages is supported. The first language is an XML-like declarative language, the second language is the Java language and the third language is XML.
- FIG 1 illustrates an overview of the multi-language execution method of the present invention, in accordance with one embodiment
- Figure 2a illustrates the relevant operational flow of the execution, engine of Fig. 1, in accordance with one embodiment
- Figure 2b illustrates the relevant operational flow of a language specific processing unit of Fig. 1, for processing a code section of the language, in accordance with one embodiment
- Figure 2c illustrates the relevant operational flow of a language specific processing unit of Fig. 1, for processing a header section of the language, in accordance with one embodiment
- FIG. 3 illustrates a computer system suitable for use to practice the present invention, in accordance with one embodiment
- Figure 4 illustrates a multi-language data processing representation of Fig. 1 , in further detail in accordance with one embodiment.
- the present invention includes a method for specifying data processing operations using programming instructions of multiple programming languages, and for executing the multi-language data processing representation.
- a computing environment 102 is provided with an execution engine 104, supplemented with a number of language specific processing units 105, to facilitate execution of data processing representations 106 expressed with programming instructions of multiple programming languages.
- execution engine 104 supplemented with a number of language specific processing units 105, to facilitate execution of data processing representations 106 expressed with programming instructions of multiple programming languages.
- computing environment 102 is also provided with function libraries 112 of the programming languages.
- a multi-language data processing representation 106 includes one or more language namespace declarations 108 declaring language or languages employed, and one or more code sections 110 of the declared languages. In other embodiments, other non-namespace means may also be employed to declare the languages involved. As will be described in more detail below, each code section 110 may include sub-sections written in one or more other languages, that is code sections 110 of the different programming languages may be interleaved. Each sub-section may in turn have sub-sub-sections written in other languages, and so forth.
- data processing representation 106 may also include one or more language specific header sections 109 specifying various "preliminary" matters for subsequent code sections 110 of the language.
- Execution engine 104 is endowed with logic to anticipate that data processing representations 106 may include code sections of different programming languages, and with the assistance of language specific processing units 105 be able to handle and facilitate execution of these code sections of different programming languages. Moreover, execution engine 104 is endowed with logic to anticipate and handle inter-mixing of code sections of the different programming languages. For the embodiment, upon encountering a code section/statement of a language, execution engine 104 invokes the corresponding language specific processing unit 105 to augment and provide the language specific processing required to process and facilitate execution of the code section/statement.
- Language specific processing units 105 are endowed with logic to identify sub-sections written in unknown programming languages, and delegate the processing of those sub-sections back to the execution engine 104.
- the execution engine 104 will pass the sub-section to an appropriate language specific processor and return the result to the requesting language specific processing unit 105.
- execution engine 104 and language specific processing units are endowed with logic to identify sub-sections written in unknown programming languages, and delegate the processing of those sub-sections back to the execution engine 104.
- the execution engine 104 will pass the sub-section to an appropriate language specific processor and return the result to the requesting language specific processing unit 105.
- data processing representations 106 are intended to represent a broad range of data processing representation methodologies known in the art, and execution engine 104 is intended to represent a broad range of the corresponding engines in support of these methodologies.
- computing environment 102 may be disposed in a single or multi-processor system, or a collection of networked systems. In the case of networked systems, the systems may be networked locally, or across a number of private and/or public networks, including the Internet.
- FIG. 4 a block diagram illustrating a mixed language data process representation 106 of Fig. 1 in further details, in accordance with one embodiment is shown. As illustrated, and described
- data processing representation 106 includes one or more language namespace declarations 108 declaring one or more languages employed.
- declarations 108 are expressed in accordance with the following exemplary syntax:
- xl://crossgain.net/lang/xsheet/ is a namespace using a specially formed URI identifying one language that may be used in this source.
- the execution engine uses this URI to locate an appropriate language specific processing unit for sections written in this language.
- "xl://crossgain.net/lang/java/” is a specially formed URI identifying a second language that may be used in this source (an extension of the well known Java language in this example).
- the execution engine uses this URI to locate an appropriate language specific processing unit for sections written in this language.
- xs is a namespace prefix used to identify sections of the source written in the language identified by the associated namespace, "xl://crossgain.net/lang/xsheet/"
- data processing representation 106 further includes a number of language specific header sections 109 of selected supported languages.
- each header section 109 may include one or more directive statements 402 directing one or more preliminary or preparatory actions, such as importing of data packages, to be performed, and one or more declarative statements 404 declaring one or more processing methods or instance variables to be instantiated for use by subsequent code sections 110 of the language.
- a header section 109 may be declared in accordance with the following exemplary syntax:
- the above example directive directs the import of W3C's definition of the document object model for use by subsequent Java code sections.
- data processing section 106 further includes language specific as well as mixed language code sections 110a and 110b.
- statements of a second language may be intermixed among statement of a first language, employing one or more sets of delimiting language tag pairs 442a-442b and 444a-444b as shown.
- the Java specific processing unit asks the execution engine to evaluate the xsheet code 10 times. Each time, the results returned by the execution engine are appended to the output of the delimited code section.
- statements within the delimited code section may also invoke one or more local, remote or built-in library functions of the language.
- the built-in library functions supported for the example Java language include a) an emit() function for converting Java Objects to XML form and appending the resulting value of the function to output of the delimited code section; b) a push(element) function to append a copy of a specified element to the output of the delimited code section and reposition the insertion point for the delimited code section inside the element such that subsequent output of the delimited code section is appended as children of this element; c) a pop() function to "back up" the current insertion point for the delimited code section such that subsequent output of the delimited code section is appended as children of the parent of the element containing the current insertion point; and d) a getDocument()function to retrieve and return a W3C document object for the delimited code section, for use as a space in which new nodes may be created.
- Figure 2a illustrates the operational flow of the relevant aspects of execution engine 104 in accordance with one embodiment; more specifically, the operational flow of execution engine 104 for processing data processing representation 106.
- execution engine 104 like other conventional execution engines of prior art data processing representations, upon invocation, would parse and interpret the statements of data processing representation 106.
- execution engine 104 first locates and processes the declaration statements declaring the programming languages employed in expressing the data processing representation being processed, block 202. Next, execution engine 104 locates the start of the "next" code section, identifies the language associated with code section, and as described earlier, invoke the corresponding language specific processing unit to process the code section, block 204.
- execution engine 104 determines whether end of execution has been reached, block 208, if not, execution engine 104 continues the process at block 204 again, i.e. determining the language of the "next" code section, and invoke the corresponding language specific processing unit to process the "next" code section. The process continues until eventual execution control is returned where end of execution has been reached.
- FIG. 2b illustrates the operational flow of the relevant aspects of a language specific processing unit 105 for processing a non-header code section of the language, in accordance with one embodiment.
- the processing unit first locates the "next" statement to be executed, block 222.
- the processing unit determines if the it is a statement of the language or of an unknown language (e.g. the start of a language tag of a sub-section of another language), block 224. If it is a statement of an unknown language, as described earlier, the processing unit invokes the execution engine recursively allowing it to evaluate the foreign language section with the other language specific processing units at its disposal.
- an unknown language e.g. the start of a language tag of a sub-section of another language
- the language processor determines if it is a statement of the language the language processor the statement elements accordingly, starting with a next statement element, block 226. Again, the processing unit determines if the statement element is an element recognized within the language or it's an element of an unknown language (e.g. the start of a language tag of a sub-section of another language), block 228. If it is an element of an unknown language, as described earlier, the processing unit invokes the execution engine recursively.
- an unknown language e.g. the start of a language tag of a sub-section of another language
- the processing unit processes the element accordingly, block 230.
- the language element may be an invocation invoking a library function of the language. If so, the library function is invoked and executed accordingly.
- the library function may be local or remote, and invoked in a namespace based approach. Invocation of function in a namespace based approach is the subject matter of Patent Cooperation Treaty (PCT) patent application number ⁇ to be insert>, entitled “Namespace Based Function Invocation", contemporaneously filed, and published on ⁇ insert date>, which claims priority to the earlier enumerated U.S. provisional patent application 60/246,916. Readers are referred to the 'xxx application for further details.
- PCT Patent Cooperation Treaty
- the processing unit determines if end of statement has been reached. If not, it continues operation at block 226 again. If end of statement has been reached, the processing unit determines if there are additional statements to be processed, block 234. If so, it continues operation at block 222 again. Otherwise, it returns execution control back to the execution engine.
- Figure 2c illustrates the operational flow of the relevant aspects of a language specific processing unit 105 for processing a header section of the language, in accordance with one embodiment. More specifically, the embodiment is the embodiment in support of the Java language, incorporating the earlier described features. Other language specific processing units 105 in support of other languages may be likewise implemented with or without modifications and alterations.
- the exemplary processing unit 105 determines if it is processing a directive or a declarative statement, block 232. If it is a directive statement being processed, the exemplary processing unit 105 performs the specified operation, e.g. an import operation importing enumerated data packages, as directed, block 234. On the other hand, if it is a declarative statement being processed, the exemplary processing unit 105 processes the declaration, e.g. instantiating a declared processing method or an instance variable, as declared, block 236.
- Example Computer System Figure 3 illustrates a computer system suitable for use to practice the present invention, in accordance with one embodiment.
- computer system 300 includes one or more processors 302 and system memory 304. Additionally, computer system 300 includes mass storage devices 306 (such as diskette, hard drive, CDROM and so forth), input/output devices 308 (such as keyboard, cursor control and so forth) and communication interfaces 310 (such as network interface cards, modems and so forth).
- mass storage devices 306 such as diskette, hard drive, CDROM and so forth
- input/output devices 308 such as keyboard, cursor control and so forth
- communication interfaces 310 such as network interface cards, modems and so forth.
- system bus 312 which represents one or more buses. In the case of multiple buses, they are bridged by one or more bus bridges (not shown).
- system memory 304 and mass storage 306 are employed to store a working copy and a permanent copy of the programming instructions implementing the execution engine and the language specific processing units.
- the permanent copy of the programming instructions may be loaded into mass storage 306 in the factory, or in the field, through a distribution medium (not shown) or through communication interface 310 (from a distribution server (not shown).
- the constitution of these elements 302-312 are known, and accordingly will not be further described.
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computing Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Devices For Executing Special Programs (AREA)
- Stored Programmes (AREA)
Abstract
Description
Claims
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| AU2002220243A AU2002220243A1 (en) | 2000-11-10 | 2001-11-09 | A multi-language execution method |
| US10/089,139 US8156471B2 (en) | 2001-11-09 | 2001-11-09 | Multi-language execution method |
Applications Claiming Priority (4)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US24691500P | 2000-11-10 | 2000-11-10 | |
| US24691600P | 2000-11-10 | 2000-11-10 | |
| US60/246,915 | 2000-11-10 | ||
| US60/246,916 | 2000-11-10 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| WO2002039647A2 true WO2002039647A2 (en) | 2002-05-16 |
| WO2002039647A3 WO2002039647A3 (en) | 2002-08-15 |
Family
ID=26938324
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/US2001/046928 Ceased WO2002039647A2 (en) | 2000-11-10 | 2001-11-09 | A multi-language execution method |
Country Status (2)
| Country | Link |
|---|---|
| AU (1) | AU2002220243A1 (en) |
| WO (1) | WO2002039647A2 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112102844B (en) * | 2020-11-09 | 2021-02-05 | 苏州思必驰信息科技有限公司 | Method and device for writing and maintaining offline recognition xbnf |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH0831041B2 (en) * | 1991-09-06 | 1996-03-27 | インターナショナル・ビジネス・マシーンズ・コーポレイション | Program condition processing method and computer system |
| US6066181A (en) * | 1997-12-08 | 2000-05-23 | Analysis & Technology, Inc. | Java native interface code generator |
| US6292936B1 (en) * | 1998-11-12 | 2001-09-18 | International Business Machines Corporation | Enabling multiple runtime processors in an interpreter-based embedded scripting system |
| US6339839B1 (en) * | 1998-11-12 | 2002-01-15 | International Business Machines Corporation | Enabling multiple code generators in a translator-based embedded scripting system |
-
2001
- 2001-11-09 WO PCT/US2001/046928 patent/WO2002039647A2/en not_active Ceased
- 2001-11-09 AU AU2002220243A patent/AU2002220243A1/en not_active Abandoned
Also Published As
| Publication number | Publication date |
|---|---|
| AU2002220243A1 (en) | 2002-05-21 |
| WO2002039647A3 (en) | 2002-08-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8156471B2 (en) | Multi-language execution method | |
| US5586328A (en) | Module dependency based incremental compiler and method | |
| US5276880A (en) | Method for parsing and representing multi-versioned computer programs, for simultaneous and synchronous processing of the plural parses | |
| US6202201B1 (en) | Text object compilation method and system | |
| JP2005018777A (en) | Common query runtime system and application programming interface | |
| AU2002354768A1 (en) | Programming language extensions for processing XML objects and related applications | |
| CA2454608A1 (en) | Programming language extensions for processing xml objects and related applications | |
| JP2000515281A (en) | Method and apparatus for describing interfaces, operations and data types defined by an interface definition language | |
| EP0520708B1 (en) | Method and apparatus for converting high level form abstract syntaxes into an intermediate form | |
| Bravenboer et al. | Generalized type-based disambiguation of meta programs with concrete object syntax | |
| Boshernitsan | Harmonia: A flexible framework for constructing interactive language-based programming tools | |
| US7266814B2 (en) | Namespace based function invocation | |
| WO2002039647A2 (en) | A multi-language execution method | |
| CN113220277B (en) | An embedded service-oriented development method and device | |
| Marlin | A distributed implementation of a multiple view integrated software development environment | |
| van der Brand et al. | Development of parsing tools for CASL using generic language technology | |
| Munkby et al. | Scrap++ scrap your boilerplate in C++ | |
| Pettersson et al. | DML-a meta-language and system for the generation of practical and efficient compilers from denotational specifications. | |
| Lockett et al. | Saxon-JS: XSLT 3.0 in the Browser | |
| JP2002132502A (en) | Automatic creating system and method of distributed object with interpretation of language function | |
| McDonald | CMU Common Lisp user's manual Mach IBM RT edition | |
| van Deursen | Introducing ASF+ SDF Using the-calculus as Example | |
| Nilsen | A stream data type that supports goal-directed pattern matching on unbounded sequences of values | |
| CN117827171A (en) | Method and device for generating project source codes through json schema file | |
| Blume | The SML/NJ Compilation and Library Manager |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AK | Designated states |
Kind code of ref document: A2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG US UZ VN YU ZA ZW |
|
| AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 10089139 Country of ref document: US |
|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| REG | Reference to national code |
Ref country code: DE Ref legal event code: 8642 |
|
| 122 | Ep: pct application non-entry in european phase | ||
| NENP | Non-entry into the national phase |
Ref country code: JP |
|
| WWW | Wipo information: withdrawn in national office |
Country of ref document: JP |