9. The method of claim 8 , wherein said splitting is performed by treating all internal non-terminal grammars as separate grammars.
8. A computer-implemented method for an automated conversational system, said method comprising: providing an initial dialog call-flow corresponding to an initial grammar, where said dialog call-flow includes a set of dialogs each including a <question, grammar> pair, where said grammar includes a set of possible answers to said corresponding question, and where said call-flow comprises a tree-type call flow where questions are dependent on answers to previous questions in the dialog call flow; using a computing host device, splitting said initial dialog call-flow and said initial grammar into a set of atomic dialogs and a corresponding set of grammars, where said atomic dialogs comprise dialogs that cannot be split any further; using said computing host device, determining a resource requirement for each grammar of said set of grammars; using said computing host device, determining a resource constraint of computing host device; and using said computing host device, reorganizing said set of atomic dialogs subject to said resource constraint of said computing host device not being exceeded by a resultant resource requirement resulting from merging at least two atomic dialogs, and wherein said set of atomic dialogs are represented as a tree structure of elements, and said reorganizing comprises merging one or more of said elements to form at least one shorter path of said tree structure.