16. A system comprising: at least one memory device storing a set of grammar rules for a particular programming language and a corpus; and at least one processor in communication with said memory device and comprising: a dependency graph processor receiving multiple dependency graphs corresponding to first subsets of said set of grammar rules, merging said multiple dependency graphs into a single dependency graph, and preprocessing said single dependency graph to generate an updated dependency graph, said preprocessing comprising, for each group of cyclically connected grammar rule nodes in said single dependency graph, combining said group so that said group is represented by a single grammar rule node and so that said updated dependency graph is devoid of cyclically connected grammar rule nodes; a grammar rules partitioner repartitioning said set of grammar rules into logical second subsets based on said updated dependency graph; a parsing program generator generating, for each one of said logical second subsets, textual code for a corresponding portion of a parsing program; a compiler converting, for each one of said logical second subsets, said textual code for said corresponding portion of said parsing program into machine-readable code for said corresponding portion of said parsing program; and a code merger merging all machine-readable code for all portions of said parsing program.
16. A system comprising: at least one memory device storing a set of grammar rules for a particular programming language and a corpus; and at least one processor in communication with said memory device and comprising: a dependency graph processor receiving multiple dependency graphs corresponding to first subsets of said set of grammar rules, merging said multiple dependency graphs into a single dependency graph, and preprocessing said single dependency graph to generate an updated dependency graph, said preprocessing comprising, for each group of cyclically connected grammar rule nodes in said single dependency graph, combining said group so that said group is represented by a single grammar rule node and so that said updated dependency graph is devoid of cyclically connected grammar rule nodes; a grammar rules partitioner repartitioning said set of grammar rules into logical second subsets based on said updated dependency graph; a parsing program generator generating, for each one of said logical second subsets, textual code for a corresponding portion of a parsing program; a compiler converting, for each one of said logical second subsets, said textual code for said corresponding portion of said parsing program into machine-readable code for said corresponding portion of said parsing program; and a code merger merging all machine-readable code for all portions of said parsing program. 17. The system of claim 16 , further comprising at least one of an operating system and a virtual machine executing, after said merging by said code merger, said parsing program to parse a corpus.