Context free languages: an application to recursive programs analysis

  • Authors:

  • Cristina Elena Aron;Emil Marian Popa;Mircea Adrian Musan

  • Affiliations:

  • Department of Computer Science and Economic Informatics, University Lucian Blaga Sibiu, Faculty of Sciences, Sibiu, Romania;Department of Computer Science and Economic Informatics, University Lucian Blaga Sibiu, Faculty of Sciences, Sibiu, Romania;Department of Computer Science and Economic Informatics, University Lucian Blaga Sibiu, Faculty of Sciences, Sibiu, Romania

  • Venue:
  • MMACTEE'06 Proceedings of the 8th WSEAS international conference on Mathematical methods and computational techniques in electrical engineering
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Consider one approach to the analysis of a model of recursive computer programs. This version of a model is referred to as program schemes. With this model, programs are viewed from a higher level of abstraction. The goal is to compare the "power" of language features based on the analysis of the control and data flow characteristics of programs. Programming techniques complicate such comparisons. For instance, one can represent two independently manipulated integer values x and y with a single integer value; if a value of the form 2x3y is retained, then incrementing x is accomplished by multiplying the stored value by 2, and incrementing y is accomplished by multiplying the stored value by 3, etc. So for example, when asking if it's possible for every computer program that uses two integer variables to be replaced by another program that uses a single integer variable, the answer would be yes. And, if two variables can be replace by one, three variables could be replaced by two and hence then by one, etc. So the theoretical conclusion is that there is no need for more than a single integer variable although no one would recognize that he would write its programs this way.