Methods and systems for transforming a parse graph into an and/or command tree

• US 20070006179A1
• Filed: 06/08/2005
• Published: 01/04/2007
• Est. Priority Date: 06/08/2005
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Bettadapur, Prakash, Tjong, Jung
• Granted Patent: US 7,784,036 B2
• Time in Patent Office: Days
• US Class Current: 717/136
• CPC Class Codes: G06F 40/205 Parsing
• CPC Class Codes: G06F 8/51 Source to source
• CPC Class Codes: G06F 9/45512 Command shells

Abstract

Methods and systems for transforming a complex representation of computer code into a simplified representation of computer code are described. Parse nodes in a parse graph are traversed. Selected information contained within the parse nodes is hidden to create condensed parse nodes. The hiding prevents further processing of the selected information. Selected complex patterns in the parse graph are simplified to create simplified parse graph patterns. Branches on an AND/OR command tree are created from the parse nodes, the condensed parse nodes, and the simplified parse graph patterns.

Claims

1. A method of transforming a complex representation of computer code into a simplified representation of computer code, said method comprising:

traversing parse nodes in a parse graph;

hiding selected information contained within said parse nodes to create condensed parse nodes, wherein said hiding prevents further processing of said selected information;

simplifying selected complex patterns in said parse graph to create simplified parse graph patterns; and

creating branches on an AND/OR command tree from said parse nodes, said condensed parse nodes, and said simplified parse graph patterns.

2. The method of claim 1 further comprising simplifying selected branches on said AND/OR command tree in accordance with a plurality of AND/OR command tree simplification cases.

3. The method of claim 1 further comprising merging selected cases in said AND/OR command tree that have common end of line terminations.

4. The method of claim 1 further comprising creating an exportable representation of said AND/OR command tree.

5. The method of claim 1, wherein said traversing further comprises detecting an overarching command structure in said parse graph.

6. The method of claim 1, wherein said traversing further comprises collecting said parse nodes that terminate in a common end of line.

7. The method of claim 1, wherein said creating further comprises converting selected patterns into said branches on said AND/OR command tree.

8. A computer-usable medium having computer-readable program code embodied therein for causing a computer system to execute a method of transforming a complex representation of computer code into a simplified representation of computer code, said method comprising:

traversing parse nodes in a parse graph;

hiding selected information contained within said parse nodes to create condensed parse nodes, wherein said hiding prevents further processing of said selected information;

simplifying selected complex patterns in said parse graph to create simplified parse graph patterns; and

creating branches on an AND/OR command tree from said parse nodes, said condensed parse nodes, and said simplified parse graph patterns.

9. The computer-usable medium of claim 8 further comprising simplifying selected branches on said AND/OR command tree in accordance with a plurality of AND/OR command tree simplification cases.

10. The computer-usable medium of claim 8 further comprising merging selected cases in said AND/OR command tree that have common end of line terminations.

11. The computer-usable medium of claim 8 further comprising creating an exportable representation of said AND/OR command tree.

12. The computer-usable medium of claim 8, wherein said traversing further comprises detecting an overarching command structure in said parse graph.

13. The computer-usable medium of claim 8, wherein said traversing further comprises collecting said parse nodes that terminate in a common end of line.

14. The computer-usable medium of claim 8, wherein said creating further comprises converting selected patterns into said branches on said AND/OR command tree.

15. A system for transforming a complex representation of computer code into a simplified representation of computer code, said system comprising:

means for traversing parse nodes in a parse graph;

means for hiding selected information contained within said parse nodes to create condensed parse nodes, wherein said hiding prevents further processing of said selected information;

means for simplifying selected complex patterns in said parse graph to create simplified parse graph patterns; and

means for creating branches on an AND/OR command tree from said parse nodes, said condensed parse nodes, and said simplified parse graph patterns.

16. The system of claim 15 further comprising means for simplifying selected branches on said AND/OR command tree in accordance with a plurality of AND/OR command tree simplification cases.

17. The system of claim 15 further comprising means for merging selected cases in said AND/OR command tree that have common end of line terminations.

18. The system of claim 15 further comprising means for creating an exportable representation of said AND/OR command tree.

19. The system of claim 15, wherein said means for traversing further comprises means for detecting an overarching command structure in said parse graph.

20. The system of claim 15, wherein said means for traversing further comprises means for collecting said parse nodes that terminate in a common end of line.

21. The system of claim 15, wherein said means for creating further comprises means for converting selected patterns into said branches on said AND/OR command tree.