Computer-based method for parsing and hashing source information including a combined grammar

• US 20030145282A1
• Filed: 05/17/2002
• Published: 07/31/2003
• Est. Priority Date: 10/31/2001
• Status: Abandoned Application

• Current Assignee: Metacyber Net
• Original Assignee: Metacyber Net
• Inventors: Thomas, Joseph M., Duckett, Steven W.
• Application Number:
  US10/147,836
• Publication Number:
  US 20030145282A1
• Time in Patent Office: Days
• US Class Current: 715/513
• CPC Class Codes: G06F 8/71 Version control security arrangements therefor G06F21/57; Configuration management
• CPC Class Codes: G06F 8/73 Program documentation

Abstract

A computer-based method parses and hashes source information comprising a combined grammar to create documentation for the source information. The computer-based method processes lines of the source information written using a first grammar with a first parser-hasher to generate annotations for the source information written using the first grammar. The computer-based method processes lines of the source information written using a second grammar with a second parser-hasher different from the first parser-hasher to generate annotations for the source information written using the second grammar.

Claims

1. A computer-based method for parsing and hashing source information comprising a combined grammar to create documentation for said source information, said computer-based method comprising:

processing lines of said source information written using a first grammar with a first parser-hasher to generate annotations for said source information written using said first grammar; and

processing lines of said source information written using a second grammar with a second parser-hasher different from said first parser-hasher to generate annotations for said source information written using said second grammar.

2. The computer-based method of claim 1 further comprising:

testing a token to determine whether said token indicates a start of a line written using said second grammar.

3. The computer-based method of claim 2 further comprising:

testing to determine whether said line written using said second grammar is complete following said testing said token to determine whether said token indicates a start of a line written using said second grammar.

4. The computer-based method of claim 3 further comprising:

performing said processing lines of said source information written using said second grammar with said second parser-hasher upon said testing to determine whether said line written using said second grammar is complete finding that said line is complete.

5. A computer program product including computer program code wherein execution of said computer program code results in a method for parsing and hashing source information comprising a combined grammar to create documentation for said source information, said method comprising:

processing lines of said source information written using a first grammar with a first parser-hasher to generate annotations for said source information written using said first grammar; and

processing lines of said source information written using a second grammar with a second parser-hasher different from said first parser-hasher to generate annotations for said source information written using said second grammar.

6. The computer product of claim 5 wherein said method further comprises:

testing a token to determine whether said token indicates a start of a line written using said second grammar.

7. The computer product of claim 6 wherein said method further comprises:

testing to determine whether said line written using said second grammar is complete following said testing said token to determine whether said token indicates a start of a line written using said second grammar.

8. The computer product of claim 7 wherein said method further comprises:

performing said processing lines of said source information written using said second grammar with said second parser-hasher upon said testing to determine whether said line written using said second grammar is complete finding that said line is complete.