Recursive Programs Analysis Using Context Free Languages

摘要

The program scheme model has proven useful in the analysis of major features of languages and programs. It avoids making any assumptions about the specifics of what is being computed. For instance, a scheme delimits the repetitive structure in a program, but does not include information to determine how many repetitions are performed. One of the primary kinds of issues that this model helps to analyze is whether a transformation on a program always gives a new program that computes the same results - that is, an equivalent program.