作者: Pankaj Dhoolia , Mangala G. Nanda , Diptikalyan Saha , Krishna Nandivada Venkata
DOI:
关键词: Parser combinator 、 Parsing 、 Computer science 、 Source code 、 Programming language 、 Redundant code 、 S-attributed grammar 、 Bottom-up parsing 、 Top-down parsing 、 Unreachable code
摘要: Disclosed are embodiments a computer-implemented method, system and an associated program storage device that provide for automatic programming language grammar partitioning to solve the “code too large” problem. The partition particular into logical subsets based on set of heuristics using dependency graph is preprocessed so as be devoid any cyclically connected rule nodes. For each subset, textual code corresponding portion parsing can generated then converted machine-readable program. Thus, small amounts portions discretely code, thereby avoiding all merged executed in order parse corpus.