Method for converting a word processing file containing markup language tags and conventional computer code

• US 5,745,908 A
• Filed: 03/29/1996
• Issued: 04/28/1998
• Est. Priority Date: 03/29/1996
• Status: Expired due to Term

• Current Assignee: Serena Software Europe Ltd. (Open Text Corporation)
• Original Assignee: Systems Focus International
• Inventors: Anderson, Charles, Obin, Raymond, Barr, Stewart, Beavis, Clive, Cleland, David
• Primary Examiner(s): Burwell, Joseph R.
• Application Number:
  US08/625,743
• Time in Patent Office: 760 Days
• Field of Search: 395/774, 395/705, 395/752
• US Class Current: 715/234
• CPC Class Codes: G06F 40/151 Transformation
• CPC Class Codes: G06F 40/221 Parsing markup language streams streaming G06F40/149

Abstract

A method for operating a computer converts a word processing file to a computer program source file, which generates an output stream when run. The word processing file includes a linear sequence of characters having segments marked by beginning and ending tags. The method of the present invention translates the linear sequences of characters in the word processor file that are not surrounded by the tags to output statements in the computer program source file. The output statements cause the computer program generated from the source file, when executed, to reproduce the linear sequences of characters from the word processor file not surrounded by the tags in an output stream generated by the computer program. The method translates the linear sequences of characters in the word processing file that are surrounded by predetermined tags into computer source code statements. In so doing, the translation takes the form of merely copying the linear sequences of characters of the word processing file to the computer program source file or of translating the linear sequences of characters of the word processing file into statements recognized in the computer language.

Claims

1. A method for operating a computer to convert a word processing file, which comprises a linear sequence of characters, said linear sequence of characters comprising segments of said linear sequence marked by beginning and ending tags, into a source file comprising computer language statements, said source file defining a computer program that will generate an output stream in a format recognizable by a word processing program adapted to read said output stream, said method comprising the steps of:

reading a linear sequence of characters from said word processing file;

translating a segment of said linear sequence of characters that is not surrounded by said beginning and ending tags to computer language output statements and outputting said computer language output statements to said source file,

wherein said output statements cause a computer program generated from said source file, when said generated computer program is executed, to reproduce said linear sequence of characters in an output stream generated by said computer program; and

providing computer source language statements in said source file corresponding to a segment of said linear sequence of characters that is surrounded by said beginning and ending tags.

2. The method of claim 1 wherein said word processing file comprises HTML.

3. The method of claim 1 wherein said computer language is COBOL.

4. The method of claim 1 wherein said tags occur in pairs, one marking the beginning of a sequence of characters and one marking the end of a sequence of characters, and wherein said pairs of tags are of first and second types, said first pair of tags marking sequences of characters that are to be copied to said source file without alteration, and said pair of tags marking sequences of characters that are to be translated to predetermined source code statements determined by an indication associated with said second pair of tags.

5. The method of claim 1 further comprising the step of providing computer source code statements in said source file enabling a program generated from said source file to receive input from a source outside of said generated computer program.

6. The method of claim 1 further comprising the step of replacing predetermined syntax in said linear sequence of characters that is not surrounded by said tags with variables defined outside of said linear sequence of characters.