Name Analysis Algorithm for VS PL/I
Original Publication Date: 1985-May-01
Included in the Prior Art Database: 2005-Feb-18
This algorithm results in performing a name analysis process wherein the number of passes over a program tree representing a PL/I compilation unit (source program) is substantially reduced. During compilation, the front end of a PL/I compiler must initially accomplish a task referred to as name analysis, i.e., identify and represent data items declared by declarative statements of the compilation unit; identify and represent all references to names of these data items throughout the source code of the compilation unit; and associate the name references with the corresponding declarations.