Compiler with generic front end and dynamically loadable back ends

• US 5,812,851 A
• Filed: 03/21/1997
• Issued: 09/22/1998
• Est. Priority Date: 03/29/1995
• Status: Expired due to Term

• Current Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Original Assignee: Sun Microsystems Incorporated (Oracle Corporation)
• Inventors: Kretsch, Donald J., Lim, Swee Boon, Mitchell, Wesley E., Levy, Jacob Y., Lerner, Benjamin
• Primary Examiner(s): Toplu, Lucien U.
• Assistant Examiner(s): CORCORAN, PETER JOSEPH
• Application Number:
  US08/822,110
• Time in Patent Office: 550 Days
• Field of Search: 395/705, 395/707, 395/708
• US Class Current: 717/147
• CPC Class Codes: G06F 8/47 Retargetable compilers

Abstract

A system and method provides for variable target outputs from a compiler with only a single execution. The compiler includes a front end, a generic back end, and plurality of individual back ends that are dynamically loaded by the compiler during execution. The front end produces an abstract syntax tree which is then processed by the generic back end and the individual back ends to produce a number of back end trees, each adapted for a specific back end, and representative of the desired structure of the various target outputs, including target code files, or events. The generic back end traverses the abstract syntax tree, and on each node of the tree, invokes each back end that has a node of its back end tree attached thereto. The back end can then modify its own back end tree, and attach further back end nodes to other nodes of the abstract syntax tree. In turn the generic back end will invoke such added attached nodes, until all attached back end nodes on all the nodes of the abstract syntax tree have been processed. This results in completed back end trees for all of the back ends, requiring only a single pass of the front end to produce the abstract syntax tree. The individual back ends then process their respective back end trees to produce their target outputs. A look up operation is provided in the generic back end that returns one or more back end nodes in response to a request therefore specifying a node of the abstract syntax tree, and a family identification value of a back end node.

Claims

1. An apparatus for compiling a source code file and producing variable target outputs therefrom, the apparatus comprising:

a front end that accepts the source code file and produces therefrom an abstract syntax tree that represents the syntactic structure of the source code file, the abstract syntax tree having at least one abstract syntax tree node;

at least one back end that produces an associated back end tree from the abstract syntax tree, and further produces from the back end tree a target output, the back end tree having at least one back end tree node attached to an abstract syntax tree node; and

a generic back end that controls and sequences execution of the at least one back end to produce an associated back end tree from each back end, wherein each back end is independent of the generic back end and is dynamically loaded by the apparatus during execution.

2. The apparatus of claim 1 wherein the generic back end sequences execution by invoking in a selected order each back end associated with each back end node attached to each abstract syntax tree node.

3. The apparatus of claim 1 further comprising:

a memory device that stores the abstract syntax tree, the at least one back end tree, the generic back end, and the at least one back end; and

a processing device that executes the generic back end and the at least one back end to produce from the at least one back end at least one target output.

4. A method for compiling a source code file and producing variable target outputs therefrom, the method comprising the steps of:

receiving a source code file;

executing a compiler having a front end and a generic back end;

loading at least one back end to operate with the generic back end;

creating an abstract syntax tree from the source code with the front end, the abstract syntax tree including a root node and at least one child node;

generating, under the control of the generic back end, from each back end a back end tree associated with the back end, the back end tree having at least one back end tree node attached to an abstract syntax tree node;

attaching to the root node of the abstract syntax tree a back end node of at least one back end tree;

selecting nodes of the abstract syntax tree, and for each selected node, adding to selected back end trees zero or more back end nodes representing syntactic information derived from the abstract syntax tree;

attaching selected back end nodes to selected nodes of the abstract syntax tree; and

producing from each back end a target output.

5. The method of claim 4, wherein the step of generating a back end tree is performed by selectively invoking each back end on selected nodes of the abstract syntax tree.

6. The method of claim 4 further comprising the step of:

repeating the selecting step on each back end node attached to each node of the abstract syntax tree.

7. The method of claim 4, wherein each attaching step further comprises the step of:

attaching the back end node to the abstract syntax tree according to a priority value corresponding to a priority value of the back end associated with the back end node.

8. The method of claim 7, further comprising the step of:

attaching selected back end nodes associated with one back end to the abstract syntax tree in a predetermined order.

9. The method of claim 4 wherein the step of selecting nodes of the abstract syntax tree is performed recursively.

10. A computer system for compiling a source code file and producing variable target outputs therefrom, the apparatus comprising:

a memory device that stores;

an abstract syntax tree that represents the syntactic structure of the source code file and having at least one abstract syntax tree node;

at least one back end tree associated with a back end and derived from the abstract syntax tree, each back end tree having at least one back end tree node attached to an abstract syntax tree node;

at least one back end that produces from the abstract syntax tree a back end tree associated with the back end, and further produces from the back end tree a target output, each back end independent of a compiler, and dynamically loaded by the compiler during execution, each back end invoked by a generic back end in the selected order;

the compiler comprising;

a front end that accepts the source code file and produces therefrom the abstract syntax tree;

a generic back end that coordinates construction of the at least one back end tree by invoking a back end associated with at least one back end tree node attached to an abstract syntax tree node in a selected order; and

a processing device that executes the generic back end and the at least one back end to produce from the at least one back end at least one target output.

11. An apparatus for compiling a source code file and producing variable target outputs therefrom, the apparatus comprising:

a front end that accepts the source code file and produces therefrom an abstract syntax tree that represents the syntactic structure of the source code file, the abstract syntax tree having at least one abstract syntax tree node;

at least one back end that produces an associated back end tree from the abstract syntax tree, and further produces from the back end tree a target output, the back end tree having at least one back end tree node attached to an abstract syntax tree node; and

a generic back end that controls and sequences execution of the at least one back end to produce an associated back end tree from the at least one back end, wherein each back end is independent of the generic back end and is dynamically loaded by the apparatus during execution; and

wherein each back end further comprises;

an add operation, invocable by the generic back end, that adds zero or more back end nodes to a back end tree.

12. The apparatus of claim 11, wherein the generic back end further comprises:

an attach operation, invocable by a back end, that attaches a back end node of a back end tree to at least one node of the abstract syntax tree.

13. The apparatus of claim 12, wherein each back end node is attached to the abstract syntax tree according to a priority value corresponding to a priority value of the back end associated with the back end node.

14. The apparatus of claim 13, wherein selected back end nodes associated with one back end are attached to the abstract syntax tree in a predetermined order.

15. The apparatus of claim 11, wherein each back end node is an object and the add operation is a method of the object.

16. An apparatus for compiling a source code file and producing variable target outputs therefrom, the apparatus comprising:

a front end that accepts the source code file and produces therefrom an abstract syntax tree that represents the syntactic structure of the source code file, the abstract syntax tree having at least one abstract syntax tree node;

at least one back end that produces an associated back end tree from the abstract syntax tree, and further produces from the back end tree a target output, the back end tree having at least one back end tree node attached to an abstract syntax tree node; and

,

a generic back end that controls and sequences execution of the at least one back end to produce an associated back end tree from the at least one back end, wherein each back end is independent of the generic back end and is dynamically loaded by the apparatus during execution; and

each back end and each back end node associated with the back end has a family identification value, the generic back end further comprising;

a look up operation that returns zero or more nodes from at least one back end tree having a family identification value and attached to a node of the abstract syntax tree in response to a request from a back end specifying the family identification value and the node of the abstract syntax tree.

17. A method for compiling a source code file and producing variable target outputs therefrom, comprising the steps of:

receiving a source code file;

executing a compiler having a front end and a generic back end;

loading at least one back end to operate with the generic back end;

creating an abstract syntax tree from the source code file with the front end, the abstract syntax tree including a root node and at least one child node;

generating, under the control of the generic back end, from each back end, a back end tree associated with the back end, the back end tree having at least one back end node attached to an abstract syntax tree node, each back end and back end node associated therewith having a family identification value;

producing from each back end tree a target output;

receiving a request specifying a family identification value and a node of the abstract syntax tree; and

returning zero or more back end nodes from at least one back end tree having a same family identification value and attached to the specified node of the abstract syntax tree.