The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Aug. 20, 2013
Filed:
Jun. 28, 2011
Pankaj Dhoolia, Dadri, IN;
Mangala G. Nanda, New Delhi, IN;
Krishna Nandivada Venkata, Bangalore, IN;
Diptikalyan Saha, Kolkata, IN;
Pankaj Dhoolia, Dadri, IN;
Mangala G. Nanda, New Delhi, IN;
Krishna Nandivada Venkata, Bangalore, IN;
Diptikalyan Saha, Kolkata, IN;
International Business Machines Corporation, Armonk, NY (US);
Abstract
Disclosed are embodiments a computer-implemented method, a system and an associated program storage device that provide for automatic programming language grammar partitioning to solve the 'code too large' problem. The embodiments partition a particular programming language grammar into logical subsets based on a set of partitioning heuristics and using a dependency graph that is preprocessed so as to be devoid of any cyclically connected grammar rule nodes. For each logical subset, textual code for a corresponding portion of a parsing program can be generated and then converted into machine-readable code for that corresponding portion of the parsing program. Thus, small amounts of textual code for portions of a parsing program are discretely converted into machine-readable code, thereby avoiding the 'code too large' problem. The machine-readable code for all portions of the parsing program can then be merged and the parsing program can be executed in order to parse a corpus.