Identifying non-externalized text strings that are not hard-coded

• US 7,137,108 B1
• Filed: 10/26/2000
• Issued: 11/14/2006
• Est. Priority Date: 10/26/2000
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Chung, Dae-Suk, Kumhyr, David Bruce
• Primary Examiner(s): Zhen, Wei
• Assistant Examiner(s): RAMPURIA, SATISH
• Application Number:
  US09/697,446
• Time in Patent Office: 2,210 Days
• Field of Search: 717114-118, 717140-158, 700/11, 700/23, 700/67, 707/2, 707/3, 707/4, 707/5, 707/100, 707/102, 707/8, 710/12, 710/20, 710/52
• US Class Current: 717/142
• CPC Class Codes: G06F 8/425 Lexical analysis

Abstract

A method, computer program product and data processing system for identifying non-externalized strings that are not hard-coded. In one embodiment, a method comprises the step of scanning a code, e.g., Java, line by line until a pair of string delimiters is identified. Once a pair of string delimiters is identified, the method further comprises the step of determining whether the string within the pair of string delimiters identified is a path name to a resource file, e.g., resource bundle. If the string is a path name to the resource file, then the string is a non-externalized string that is not hard-coded. If the string is not a path name to the resource file, then the string may be identified as a possible hard-coded string.

Claims

1. A method for identifying hard-coded strings that require conversion, the method comprising the computer-implemented steps of:

scanning programming code for a first pair of string delimiters that are used to delimit text strings;

determining whether a text string within said first pair of string delimiters is a path name to a resource file;

if said text string is not a path name to said resource file then flagging said string as a possible hard-coded string; and

wherein said text string is not flagged as a possible hard-coded string if said text string is a path name to said resource file.

2. The method as recited in clam 1, wherein said programming code comprises platform-independent byte code.

3. The method as recited in clam 1, wherein said path name is a uniform resource locator.

4. The method as recited in clam 1, wherein said path name is a resource bundle.

5. The method as recited in clam 1, wherein said text string within said first pair of string delimiters is a path name to said resource file if said text string is in a dot delimited notation.

6. The method as recited in clam 1, wherein said programming code is scanned line by line until said first pair of string delimiters is identified.

7. The method as recited in clam 6, wherein if there is any more programming code to be scanned after said first pair of string delimiters is identified, then the method further comprises the step of:

continuing to scan said programming code for a second pair of delimiters.

8. A computer program product in a computer readable medium for identifying hard-coded string that require conversion, comprising:

programming operable for scanning programming code for a first pair of string delimiters that are used to delimit text strings;

programming operable for determining whether a text string within said first pair of string delimiters is a path name to a resource file;

programming operable for flagging said text string as possible hard-coded string if said string is not a path name to said resource file; and

wherein said text string is not flagged as a possible hard-coded string if said text string is a path name to said resource file.

9. The computer program product as recited in claim 8, wherein said programming code comprises platform-independent byte code.

10. The computer program product as recited in claim 8, wherein said path name is a uniform resource locator.

11. The computer program product as recited in claim 8, wherein said resource file is a resource bundle.

12. The computer program product as recited in claim 8, wherein said text string within said first pair of string delimiters is a path name to said resource file if said text string is in a dot delimited notation.

13. The computer program product as recited in claim 8, wherein said programming code is scanned line by line until said first pair of string delimiters is identified.

14. The computer program product as recited in claim 13, wherein if there is any more programming code to be scanned after said first pair of string delimiters is identified, then the method further comprises:

programming operable for continuing to scan said programming code for a second pair of delimiters.

15. A data processing system, comprising:

a processor; and

a memory unit for storing instructions of said processor;

an input mechanism;

an output mechanism;

a bus system for coupling the processor to the memory unit, input mechanism, and output mechanism;

means for scanning programming code for a first pair of string delimiters that are used to delimit text strings;

means for determining whether a text string within said first pair of string delimiters is a path name to a resource file;

means for flagging said string as a possible hard-coded string if said text string is not a path name to said resource file; and

means for not flagging said text string is not flagged as a possible hard-coded string if said text string is a path name to said resource file.

16. The data processing system as recited in claim 15, wherein said programming code comprises platform-independent byte code.

17. The data processing system as recited in claim 15, wherein said path name is a uniform resource locator.

18. The data processing system as recited in claim 15, wherein said resource file is a resource bundle.

19. The data processing system as recited in claim 15, wherein said string within said first pair of string delimiters is a path name to said resource file if said string is in a dot delimited notation.

20. The data processing system as recited in claim 15, wherein said programming code is scanned line by line until said first pair of string delimiters is identified.

21. The data processing system as recited in claim 20, wherein if there is any more programming code to be scanned after said first pair of string delimiters is identified, then the method further comprises:

means for continuing to scan said programming code for a second pair of delimiters.