Patent Document ID: 8655860
Application ID: 13433717

Base Claim:
1. A computer-implemented process for identifying universal resource locator rewriting rules, the computer-implemented process comprising: receiving, via one or more computing devices, input of universal resource locators of an application, to form received universal resource locators; representing, via the one or more computing devices, the received universal resource locators in a graph; applying, via the one or more computing devices, analysis algorithms and heuristics to properties of the graph; identifying, via the one or more computing devices, universal resource locator rewriting patterns using the graph to form detected patterns, including if a switch has a complexity value greater than a predetermined value “Q”, grouping identified switches into Left Switches and Right Switches according to a connection set; and generating, via the one or more computing devices, rewrite rules corresponding to the detected patterns.

---

Claim 6:
6. The computer-implemented process of claim 1 , wherein generating rewrite rules corresponding to the detected patterns further comprises: generating a regular expression string for each rewrite rule data structure in an optimized list of rewrite rules, wherein generating the regular expression string uses a formula of S L D L ([^D 1 D 2 . . . D N ]+)D P1 ([^D 1 D 2 . . . D N ]+)D P2 ([^D 1 D 2 . . . D N ]+) . . . D PM ([^D 1 D 2 . . . D N ]+) where S L represents a left switch characteristic and D Pi are the delimiters that separate nodes of the rewrite rule connection path.