Methods and system for converting a text-based grammar to a compressed syntax diagram

• US 5,678,052 A
• Filed: 01/19/1995
• Issued: 10/14/1997
• Est. Priority Date: 01/19/1995
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Brisson, James Paul
• Primary Examiner(s): Hofsass, Jeffery
• Assistant Examiner(s): WONG, ALBERT KANG
• Application Number:
  US08/375,526
• Time in Patent Office: 999 Days
• Field of Search: 395/700, 395/600, 395/759, 395/754, 395/922, 395/702, 395/612, 395/200.03, 364/419.08, 364/280.4, 364/274.1, 364/274.3
• US Class Current: 704/4
• CPC Class Codes: G06F 8/30 Creation or generation of source code
• CPC Class Codes: G06F 8/427 Parsing

Abstract

Methods and a system for converting a BNF grammar to a compressed railroad diagram are set forth. For a selected grammar rule within the text-based grammar, a space required within the compressed railroad diagram is determined. Thereafter, a space required is added to a total space required for the compressed railroad diagram. If the selected grammar rule includes a non-terminal symbol, then a grammar rule within the text-based grammar which defines the non-terminal symbol is used as the selected grammar rule, and the method is repeated provided that the total space required does not exceed a predetermined space available for the compressed railroad diagram. The compressed railroad diagram is generated based upon each selected grammar rule.

Claims

1. A method for converting a text-based grammar to a compressed syntax diagram using a programmed computer having a memory and an output means, said text-based grammar having a plurality of grammar rules therein and having at least one non-terminal symbol defined by a grammar rule of said plurality of grammar rules, said compressed syntax diagram having a syntax fragment, said method comprising the steps of:

(a) determining for a selected grammar rule of the plurality of grammar rules within said text-based grammar, a space required within said syntax fragment of said compressed syntax diagram for said selected grammar rule;

(b) accumulating a total space required within said syntax fragment by adding thereto said space required from said step (a), and storing said total space required in said memory of said programmed computer;

(c) if said selected grammar rule of said step (a) includes a non-terminal symbol, using as said selected grammar rule a grammar rule within said text-based grammar which defines said non-terminal symbol and repeating said steps (a), (b) and (c), said repeating being performed provided said total space required does not exceed a predetermined space available on said output means for said syntax fragment of said compressed syntax diagram, said predetermined space being sufficient for at least two grammar rules of said plurality of grammar rules to be accommodated within said syntax fragment of said compressed syntax diagram; and

(d) establishing said compressed syntax diagram based upon each selected grammar rule of said step (a), wherein said syntax fragment of said compressed syntax diagram contains data representative of multiple grammar rules of said plurality of grammar rules.

2. The method of claim 1, wherein said establishing step (d) comprises generating a plurality of instructions which define said syntax diagram and generating said syntax diagram using said plurality of instructions.

3. The method of claim 2, wherein said establishing step (d) comprises generating said plurality of instructions after said steps (a), (b) and (c) have been completed.

4. The method of claim 2, wherein said establishing step (d) comprises generating said plurality of instructions by sequentially assembling said plurality of instructions during each repeating step of said step (c).

5. The method of claim 1, wherein said programmed computer includes a recursive subroutine, said recursive subroutine performing said steps (a), (b) and (c).

6. The method of claim 5, wherein said computer includes a plurality of variables stored in said memory of the computer, said method further including passing to said recursive subroutine through said plurality of variables an inherited left-hand cost and an inherited right-hand cost of a previously selected grammar rule for facilitating said determining step (a) and said accumulating step (b).

7. The method of claim 6, wherein said method further includes passing to said recursive subroutine through said plurality of variables an inherited length of a previously selected grammar rule for facilitating said determining step (a) and said accumulating step (b).

8. The method of claim 7, wherein said method further includes passing back from said recursive routine, to a calling routine, through a GREATEST_-- LHS variable of said plurality of variables, a greatest left-hand side value which includes the greatest cost of expanding a non-terminal symbol within said selected grammar rule for facilitating said accumulating step (b).

9. The method of claim 8, wherein said method further includes passing back from said recursive routine, to a calling routine, through a GREATEST_-- LEN variable of said plurality of variables, a greatest length which includes a greatest length cost of expanding a non-terminal symbol within said selected grammar rule for facilitating said accumulating step (b).

10. The method of claim 1, wherein said determining step (a) further includes determining a width of each non-terminal symbol within said selected grammar rule, said space required within said syntax diagram for said selected grammar rule including said width of each non-terminal symbol within said selected grammar rule.

11. The method of claim 10, wherein said determining step (a) further includes determining a length of each non-terminal symbol within said selected grammar rule, said space required within said syntax diagram for said selected grammar rule including said length of each non-terminal symbol within said selected grammar rule.

12. The method of claim 1, wherein said programmed computer includes a table within the memory thereof, said method further including the step of storing, within said table, a space required within said syntax diagram for each grammar rule within said text-based grammar, and wherein said determining step (a) comprises retrieving said space required within said syntax diagram for said selected grammar rule from said table within the memory of the computer.

13. The method of claim 1, wherein said selected grammar rule comprises multiple non-terminal symbols, and wherein said step (c) comprises for each non-terminal symbol of said multiple non-terminal symbols using a grammar rule which defines the non-terminal symbol as said selected grammar rule and repeating said steps (a), (b) and (c) for each non-terminal symbol.

14. The method of claim 1, further including generating a plurality of instructions based upon said selected grammar rules of said step (a), said establishing step (d) comprising establishing said compressed syntax diagram on a computer output device based upon said plurality of instructions.

15. The method of claim 14, wherein said plurality of instructions comprises a text markup language, said establishing step (d) including processing said text markup language through a text processor such that said compressed syntax diagram comprises a printed compressed syntax diagram.

16. The method of claim 14, wherein said plurality of instructions comprises a plurality of graphics instructions, said establishing step (d) including processing said plurality of graphics instructions through a graphics processor such that said compressed syntax diagram comprises a displayed compressed syntax diagram.

17. A system for producing a compressed syntax diagram from a text-based grammar input, said text-based grammar input comprising a first plurality of grammar rules, said compressed syntax diagram comprising a computer generated output, said system comprising:

a programmed computer having an output means; and

means for determining, using said programmed computer, a second plurality of grammar rules comprising at least a subset of said first plurality of grammar rules, said second plurality of grammar rules defining a syntax diagram fragment, said syntax diagram fragment having a size no greater than a predetermined size within said computer generated output, wherein multiple grammar rules of said first plurality of grammar rules are accommodated within said syntax diagram fragment.

18. The system of claim 17, wherein said computer generated output comprises at least one of a printed output, a display output, and an output file.