Apparatus and methods for source code discovery

• US 5,826,256 A
• Filed: 10/22/1991
• Issued: 10/20/1998
• Est. Priority Date: 10/22/1991
• Status: Expired due to Fees

• Current Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Devanbu, Premkumar
• Primary Examiner(s): Black, Thomas G.
• Assistant Examiner(s): HOMERE, JEAN RAYMOND
• Application Number:
  US07/781,564
• Time in Patent Office: 2,555 Days
• Field of Search: 395/800, 395/500, 395/700, 395/650, 707/3, 707/4, 707/2
• US Class Current: 1/1
• CPC Class Codes: G06F 8/30 Creation or generation of source code
• CPC Class Codes: G06F 8/427 Parsing
• CPC Class Codes: G06F 8/75 Structural analysis for program understanding
• CPC Class Codes: Y10S 707/99932 Access augmentation or optimizing
• CPC Class Codes: Y10S 707/99933 Query processing, i.e. searching
• CPC Class Codes: Y10S 707/99934 Query formulation, input preparation, or translation

Abstract

Apparatus for discovering information about the source code of a computer program. The apparatus includes a translator for translating a parse tree produced for the program'"'"'s language in a specific programming environment into an independent parse tree and an analyzer for analyzing the independent parse tree to discover the information. The translator is generated by a translator generator from a specification for the language and the programming environment and the analyzer is generated by an analyzer generator from a specification of the information to be discovered. The specification of the information to be discovered may specify only methods of analysis which can be completed in polynomial time. Methods of using the apparatus are also disclosed.

Claims

1. A method of discovering information useful to a programmer about a specific aspect of the source code of a computer program, the source code being written and compiled in one of a plurality of language-environment combinations and the method comprising the steps of:

receiving a dependent parse tree for the program which is generated as required by the language-environment combination used to write and compile the source code;

translating the dependent parse tree into an independent parse tree which is independent of the language-environment combination; and

analyzing the independent parse tree as required to obtain the information.

2. The method set forth in claim 1 wherein:

the step of translating the dependent parse tree includes the steps of;

receiving a combination specification which describes the language-environment combination at least to an extent relevant to the dependent parse tree;

employing the combination specification to generate a translator; and

employing the translator to translate the dependent parse tree into the independent parse tree.

3. The method set forth in claim 2 wherein:

the step of employing the translator includes the step of

including in the independent parse tree invocations of routines in the environment of the combination which retrieve information from the dependent parse tree.

4. The method set forth in claim 2 wherein:

the step of employing the combination specification to generate a translator need only be performed once for a given language-environment combination.

5. The method set forth in claim 1 wherein:

the step of analyzing the independent parse tree includes the steps of;

receiving a method specification which indicates a method by which the information about the specific aspect may be obtained from the independent parse tree;

using the method specification to generate an analyzer for the specific aspect; and

analyzing the independent parse tree by applying the analyzer to the independent parse tree.

6. The method set forth in claim 5 wherein:

the method specification has the property that any method indicated thereby is such that the step of analyzing the independent parse tree can be completed in a length of time which is a polynomial function of the independent parse tree'"'"'s size.

7. A discovery tool for discovering information useful to a programmer about the source code of a program, the source code being written and compiled in one of a plurality of language-environment combinations and the discovery tool being characterized by:

a translator for translating a first parse tree representing the source code into a second parse tree representing the source code, the first parse tree being generated as required by the language-environment combination used to write and compile the source code and the second parse tree being independent of the language-environment combination; and

means for discovering the information about the source code by analyzing the second parse tree.

8. The discovery tool set forth in claim 7 further comprising:

a translator generator responsive to a combination specification of the language-environment combination for generating the translator as required by the language-environment combination.

9. The discovery tool set forth in claim 7 wherein:

the translator includes means for including in the second parse tree invocations of routines in the environment of the combination which retrieve information from the first parse tree.

10. The discovery tool set forth in claim 8 wherein:

the translator generator need generate the translator only once for the language-environment combination.

11. The discovery tool set forth in claim 7 wherein the means for discovering the information comprises:

an analyzer generator which receives a method specification indicating a method by which the information may be obtained from the second parse tree; and

an analyzer generated by the analyzer generator from the method specification, the analyzer being applied to the second parse tree to obtain the information.

12. The discovery tool set forth in claim 11 wherein:

the specification has the property that any method indicated thereby can be completed in a length of time which is a polynomial function of the second parse tree'"'"'s size.

13. A discovery tool for discovering information about the source code of a program, the discovery tool being of the type wherein the information is discovered by analyzing a parse tree representing the source code and wherein the discovery tool includes

an analyzer generator which receives a specification indicating a method by which the information may be obtained from the parse tree, and

an analyzer generated by the analyzer generator from the specification, the analyzer being applied to the parse tree to obtain the information,

the discovery tool being characterized in that:

the specification has the property that any method indicated thereby can be completed in a length of time which is a polynomial function of the size of the parse tree.