A Simple Approach to Code Scooping
Saurav Kasera, Sumanth N Hegde · 2004
For debugging and analyzing code running into thousand of lines, we may often have to concentrate on some part of the code and its functionality. In turn, to check the functionality of that code, we need to compile it and then analyze its behavior. So, with the above lines as the background, we are challenged with the problem of finding the complementary code. This complementary code when added to the selected part of the code we are to analyze (we call them the base lines) produces a compilable code. The objective of this paper is to get the complementary code. This problem doesn’t deal with any particular programming language but is true for any language following the standard programming language concepts. We just need to find the complementary code that would make our base lines compilable. This problem seems easy at first sight but it is not so. The complexity varies across programming languages for which it is implemented. So, in this paper we show how to scoop out the complementary code with the help of some of the fundamental rules of programming languages.