Method and apparatus for approximate generation of source code cross-reference information

• US 20040010780A1
• Filed: 07/11/2002
• Published: 01/15/2004
• Est. Priority Date: 07/11/2002
• Status: Abandoned Application

• Current Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Original Assignee: Nortel Networks Limited (Nortel Networks Corporation)
• Inventors: Garvin, Michael J.
• Application Number:
  US10/192,596
• Publication Number:
  US 20040010780A1
• Time in Patent Office: Days
• US Class Current: 717/143
• CPC Class Codes: G06F 8/427 Parsing
• CPC Class Codes: G06F 8/437 Type checking

Abstract

A method and apparatus for quickly and efficiently generating approximate cross-reference information from source code uses a fuzzy parser in a first pass to process all source code files linearly to resolve cross-references where possible and provide a list of unresolved cross-references and other accumulated knowledge to a separate type resolver. Fast pattern matching is used for the parsing. In a second pass, the type resolver uses this accumulated knowledge which is essentially a class hierarchy, to resolve the type of identifiers using heuristics to make best guesses when required. Separating the fuzzy parser from the type resolver facilitates the process. The method trades absolute accuracy for robustness and speed. This permits the method to be used to parse very large bodies of software.

Claims

1. A method of parsing source code to extract cross-references and other source code browsing information, the method comprising steps of:

in a first pass, performing an approximate parse of the source code to extract the cross-references that are resolvable, as well as the browsing information;

in a second pass, applying heuristics to a list of cross-references that remained unresolved after the first pass, to generate more complete cross-references to the source code.

2. The method as claimed in claim 1, wherein performing the first pass further comprises a step of building a class hierarchy.

3. The method as claimed in claim 1, wherein the step of performing the approximate parse further comprises a step of using reverse pattern matching to process the source code.

4. The method as claimed in claim 1, wherein performing the first pass further comprises a step of using heuristics to process the source code.

5. The method as claimed in claim 4, wherein performing the first pass further comprises a step of using heuristics to process bodies of functions and methods within the source code.

6. The method as claimed in claim 1, wherein performing the second pass further comprises a step of resolving the unresolved cross-references by type.

7. The method as claimed in claim 1, further comprising a step of subdividing multiple source code files into subsets or source code files, and simultaneously performing the approximate parse of each subset using a separate processor to perform each approximate parse.

8. A system for parsing source code to extract cross-references and other source code browsing information, comprising:

a processing unit;

a memory;

a program module stored in the memory, the program module being executable by the processing unit to perform in a first linear pass, an approximate parse of the source code to resolve cross-references that are resolvable in the first linear pass, as well as to extract other information useful for browsing the source code; and

, in a second linear pass, to apply heuristics to a list of unresolved cross-references produced during the first linear pass to generate a more complete model of cross-references and the other information useful for browsing the source code.

9. A system as claimed in claim 8 wherein in the first pass, the system is adapted to process the source code in chunks delimited by a right brace or a semicolon token.

10. A system as claimed in claim 9 wherein the system is further adapted to search each chunk for a macro token and, if a macro token is located, to cross-reference the macro token without delay.

11. A system as claimed in claim 9 wherein the system is further adapted to perform reverse pattern matching to locate any function declarations in the chunk.

12. A system as claimed in claim 11 wherein the system is further adapted to perform reverse pattern matching of the chunk to locate any aggregate types in the chunk.

13. A system as claimed in claim 12 wherein if a keyword “

enum”

is found, all tokens are skipped until a next right brace token is located, and checks are made to ensure that the right brace token is proceeded by an identifier tag.

14. A system as claimed in claim 13 wherein if a keyword “

class”

, “

struct”

or “

union”

keyword is located a flag is set to note which keyword was found, a type name is generated for the aggregate, and an inner loop is launched to search for a right brace token, an equal sign token, a colon token or an identifier token.

15. A system as claimed in claim 12 wherein the system is further adapted to perform reverse pattern matching to locate any definitions in the chunk.

16. A computer readable medium storing computer executable instructions for parsing source code to extract cross-references and other source code browsing information, comprising:

instructions for performing an approximate parse of the source code in a first pass to resolve resolvable cross-references and extract browsing information; and

instructions for applying heuristics to a list of unresolved cross-references in a second pass, to generate a more complete model of the cross-references and other browsing information for the source code.

17. A computer readable medium as claimed in claim 16, wherein the first pass further comprises instructions for building a class hierarchy.

18. A computer readable medium as claimed in claim 16, further including instructions for performing the approximate parse using reverse pattern matching to process the source code.

19. A computer readable medium as claimed in claim 16, further including instructions for using heuristics the first pass to process the source code.

20. A computer readable medium as claimed in claim 16, further including instructions for using heuristics in the first pass to process bodies of functions and methods within the source code.

21. A computer readable medium as claimed in claim 16, further including instructions for resolving the unresolved cross-references in the second pass by type.