TRANSLATE FOLLOWING PROGRAM IN NESTED IF LOOP #include #include int main() { char s[5]; printf("\n Enter any operator:"); scanf("%s",s); switch(s[0]) { case'>': if(s[1]=='=') printf("\n Greater than or equal"); else if(s[1]=='>') if (s[2]=='=')printf("\n Right shift AND assignment operator"); else if(s[1]=='>') printf("\nBinary right shift Operator"); else printf("\n Greater than"); break; case'<': if(s[1]=='=') printf("\n Less than or equal"); else if(s[1]=='<') if (s[2]=='=')printf("\n Left shift AND assignment operator"); else if(s[1]=='<') printf("\nBinary left shift Operator"); else printf("\nLess than"); break; case'=': if(s[1]=='=') printf("\nEqual to"); else printf("\nAssignment"); break; case'!': if(s[1]=='=') printf("\nNot Equal"); else printf("\n Bit Not"); break; case'&': if(s[1]=='&') printf("\nLogical AND"); else if (s[1]=='=')printf("\nBitwise AND assignment operator"); else printf("\n Bitwise AND"); break; case'|': if(s[1]=='|') printf("\nLogical OR"); else if (s[1]=='=')printf("\nBitwise inclusive OR and assignment operator"); else printf("\nBitwise OR"); break; case'+':if(s[1]=='+') printf("\nincrement operator"); else if(s[1]=='=') printf("\nAdd AND assignment Operator"); else printf("\n Addition"); break; case'-':if(s[1]=='-') printf("\ndecrement Operator"); else if(s[1]=='=') printf("\nsubtract AND assignment Operator"); else printf("\nSubtraction"); break; case'*':if(s[1]=='=') printf("\nMultiply AND assignment operator"); else printf("\nMultiplication"); break; case'/':if(s[1]=='=') printf("\nDivide AND assignment operator"); else printf("\nDivision"); break; case'%': if(s[1]=='=') printf("\nModulus AND assignment operator"); else printf("Modulus"); break; case'^': if(s[1]=='=') printf("\nBitwise exclusive OR and assignment operator"); else printf("\nBinary XOR Operator"); break; case'~': printf("\nBinary one's complement operator"); break; case'?': if(s[1]==':') printf("\nConditional operator"); break; default: printf("\n Not a operator"); } return 1; }
TRANSLATE FOLLOWING PROGRAM IN NESTED IF LOOP
#include<stdio.h>
#include<conio.h>
int main()
{
char s[5];
printf("\n Enter any operator:");
scanf("%s",s);
switch(s[0]) {
case'>': if(s[1]=='=') printf("\n Greater than or equal");
else if(s[1]=='>') if (s[2]=='=')printf("\n Right shift AND assignment operator");
else if(s[1]=='>') printf("\nBinary right shift Operator");
else printf("\n Greater than");
break;
case'<': if(s[1]=='=') printf("\n Less than or equal");
else if(s[1]=='<') if (s[2]=='=')printf("\n Left shift AND assignment operator");
else if(s[1]=='<') printf("\nBinary left shift Operator");
else printf("\nLess than");
break;
case'=': if(s[1]=='=') printf("\nEqual to");
else printf("\nAssignment");
break;
case'!': if(s[1]=='=') printf("\nNot Equal");
else printf("\n Bit Not");
break;
case'&': if(s[1]=='&') printf("\nLogical AND");
else if (s[1]=='=')printf("\nBitwise AND assignment operator");
else printf("\n Bitwise AND");
break;
case'|': if(s[1]=='|') printf("\nLogical OR");
else if (s[1]=='=')printf("\nBitwise inclusive OR and assignment operator");
else printf("\nBitwise OR");
break;
case'+':if(s[1]=='+') printf("\nincrement operator");
else if(s[1]=='=') printf("\nAdd AND assignment Operator");
else printf("\n Addition");
break;
case'-':if(s[1]=='-') printf("\ndecrement Operator");
else if(s[1]=='=') printf("\nsubtract AND assignment Operator");
else printf("\nSubtraction");
break;
case'*':if(s[1]=='=') printf("\nMultiply AND assignment operator");
else printf("\nMultiplication");
break;
case'/':if(s[1]=='=') printf("\nDivide AND assignment operator");
else printf("\nDivision");
break;
case'%': if(s[1]=='=') printf("\nModulus AND assignment operator");
else printf("Modulus");
break;
case'^': if(s[1]=='=') printf("\nBitwise exclusive OR and assignment operator");
else printf("\nBinary XOR Operator");
break;
case'~': printf("\nBinary one's complement operator");
break;
case'?': if(s[1]==':') printf("\nConditional operator");
break;
default: printf("\n Not a operator");
} return 1;
}
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 2 images
