CODE OPTIMIZATION TECHNIQUE


AIM:

         To write a program for implementation of Code Optimization Technique.

ALGORITHM:

 Step1: Generate the program for factorial program using for and do-while loop to specify optimization technique.

 Step2: In for loop variable initialization is activated first and the condition is checked next. If the condition is true the corresponding statements are executed and specified increment / decrement operation is performed.

 Step3:  The for loop operation is activated till the condition failure.

 Step4:  In do-while loop the variable is initialized and the statements are executed then the condition checking and increment / decrement operation is performed.

 Step5:  When comparing both for and do-while loop for optimization dowhile is best because first the statement execution is done then only the condition is checked. So, during the statement execution itself we can find the inconvenience of the result and no need to wait for the specified condition result.

 Step6:  Finally when considering Code Optimization in loop do-while is best with respect to performance.
PROGRAM CODE:
//Code Optimization Technique
#include<stdio.h>
#include<string.h>
struct op
{
char l;
char r[20];
}
op[10],pr[10];
void main()
{
int a,i,k,j,n,z=0,m,q;
char *p,*l;
char temp,t;
char *tem;
printf("Enter the Number of Values:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("left: ");
scanf(" %c",&op[i].l);
printf("right: ");
scanf(" %s",&op[i].r);
}
printf("Intermediate Code\n") ;
for(i=0;i<n;i++)
{
printf("%c=",op[i].l);
printf("%s\n",op[i].r);
}
for(i=0;i<n-1;i++)
{
temp=op[i].l;
for(j=0;j<n;j++)
{
p=strchr(op[j].r,temp);
if(p)
{
pr[z].l=op[i].l;
strcpy(pr[z].r,op[i].
r);
z++;
}
}
}
pr[z].l=op[n-1].l;
strcpy(pr[z].r,op[n-1].r);
z++;
printf("\nAfter Dead Code Elimination\n");
for(k=0;k<z;k++)
{
printf("%c\t=",pr[k].l);
printf("%s\n",pr[k].r);
}
for(m=0;m<z;m++)
{
tem=pr[m].r;
for(j=m+1;j<z;j++)
{
p=strstr(tem,pr[j].r);
if(p)
{
t=pr[j].l;
pr[j].l=pr[m].l;
for(i=0;i<z;i++)
{
l=strchr(pr[i].r,t) ;
if(l)
{
a=l-pr[i].r;
printf("pos: %d\n",a);
pr[i].r[a]=pr[m].l;
}}}}}
printf("Eliminate Common Expression\n");
for(i=0;i<z;i++)
{
printf("%c\t=",pr[i].l);
printf("%s\n",pr[i].r);
}
for(i=0;i<z;i++)
{
for(j=i+1;j<z;j++)
{
q=strcmp(pr[i].r,pr[j].r);
if((pr[i].l==pr[j].l)&&!q)
{
pr[i].l='\0';
}
}
}
printf("Optimized Code\n");
for(i=0;i<z;i++)
{
if(pr[i].l!='\0')
{
printf("%c=",pr[i].l);
printf("%s\n",pr[i].r);
}
}
}

OUTPUT:

Comments

Post a Comment

Popular posts from this blog

IMPLEMENTATION OF A LEXICAL ANALYZER USING LEX (WITH OUTPUT)

Image
AIM:     To write a program for implementing a Lexical analyser using LEX tool in Linux platform. ALGORITHM:  Step1: Lex program contains three sections: definitions, rules, and user subroutines. Each section must be separated from the others by a line containing only the    delimiter, %%.  The format is as follows:   definitions %% rules %% user_subroutines   Step2: In definition section, the variables make up the left column, and their definitions make up the right column. Any C statements should be enclosed in %{..}%. Identifier is defined such that the first letter of an identifier is alphabet and remaining letters are alphanumeric.  Step3: In rules section, the left column contains the pattern to be recognized in an input file to yylex(). The right column contains the C program fragment executed when that pattern is recognized. The various patterns are keywords, operators, new line character, number, string, identifier, beginning and end of block, comment statements,
Read more

IMPLEMENTATION OF CALCULATOR USING LEX & YACC

Image
AIM:   To write a program for implementing a calculator for computing the given expression using semantic rules of the YACC tool and LEX. ALGORITHM: Step1: A Yacc source program has three parts as follows:        Declarations %%   translation rules %%   supporting C routines Step2: Declarations Section: This section contains entries that:   i. Include standard I/O header file.   ii. Define global variables.   iii. Define the list rule as the place to start processing.   iv. Define the tokens used by the parser. v. Define the operators and their precedence. Step3:   Rules Section: The rules section defines the rules that parse the input stream. Each rule of a grammar   production and the associated semantic action. Step4:   Programs Section: The programs section contains the following subroutines. Because these subroutines are included in this file, it is not necessary to use the yacc library when processing this file. Step5:   Main- The
Read more

IMPLEMENTATION OF SYMBOL TABLE USING C (WITH OUTPUT)

Image
AIM: To write a program for implementing Symbol Table using C. ALGORITHM: Step1: Start the program for performing insert, display, delete, search and modify option in symbol table Step2: Define the structure of the Symbol Table Step3: Enter the choice for performing the operations in the symbol Table Step4: If the entered choice is 1, search the symbol table for the symbol to be inserted. If the symbol is already present, it displays “Duplicate Symbol”. Else, insert the symbol and the corresponding address in the symbol table. Step5: If the entered choice is 2, the symbols present in the symbol table are displayed. Step6: If the entered choice is 3, the symbol to be deleted is searched in the symbol table. Step7: If it is not found in the symbol table it displays “Label Not found”. Else, the symbol is deleted. Step8: If the entered choice is 5, the symbol to be modified is searched in the symbol table.  PROGRAM CODE: //Implementation of symbol table #include<stdio.h&
Read more