Algorithm:-
begin
if a,e,I,o,u or A,E,I,O,U
then
printf “It is a vowel”
else
printf “It is a consonant”
end

1. LEX program to count number of vowels and consonants in a given input string

%%
{printf(“it is vowel”);}
{printf(“it is consonant”);}
%%
main()
{
yylex();
}
int yywrap()
{
return 1;
}


Output:

$./a.out
a
it is a vowel
g
it is a consonant
....etc

[:=Read Full Message Here=:]

Aim:
To write a C# program to perform encryption and decryption of the given data.

Algorithm
ALGORITHM FOR ENCRYPTION:
Step 1: Declare the class as encrypt_class.
Step 2: Start the main function.
Step 3: Declare the variable str in string data type.
Step 4: Create the object for inbuild encryption
algorithm TripleDESCryptoServiceProvider.
Step 5: Create the data file using Filestream
class.
Step 6: Create the object for class cryptoStream.
Cryptostream is a class to ....etc

[:=Read Full Message Here=:]

I want to know the logic for finding follow in c. can you help me out with it?? ....etc

[:=Read Full Message Here=:]

can i get the complete code to find first and follow which will work for all type of grammar after removing left recursion only.
e.g.
E->E+T|T
T->T*F|F
F->(E)|x
i want to find first and follow of this production after removal of left recursion.
lyk after left recursion
E->TE'
E'->+TE'|e
so i need the first and follow of E' even
can u please help me with this.... ....etc

[:=Read Full Message Here=:]

i want coordinated master control project i.e.,boiler follow mode and turbine follow mode
i have doubt this project o help me ..........................
....etc

[:=Read Full Message Here=:]

#includestdio.h
#include
#define max 10
#define MAX 15
char array,temp;
int c,n,t;void fun(int,int);
int fun2(int i,int j,int p,int key)
{
int k;
if(!key)
{
for(k=0;k if(array==array)
break;
p=i;p=j+1;
fun(k,p);
return 0;
}
else
{
for(k=0;k<=c;k++)
{
if(array==temp)
break;
}
if(k>c)return 1;
else return 0;
}
}
void fun(int i,int p)
{
int j,k,key;
for(j=2;array!='\0';j++)
{
if(array=='/')
{
if(array> ....etc

[:=Read Full Message Here=:]

lex program to recognise and count number of identifiers in a given file ? ....etc

[:=Read Full Message Here=:]

I am not getting the proper code to calculate first and follow of productions after elimination of left recursion .
And the code that is being posted over here for calculation of first and follow its not working properly,even first or follow nothing is being calculated properly.
I need the code which can be applied to all the grammars
E->E+T|T
T->T*F|F
F->(E)|x
remove left recursion then calculate first and follow
....etc

[:=Read Full Message Here=:]

Combining Breadth-First and Depth-First Strategies in Searching for Treewidth

Rong Zhou
Palo Alto Research Center
3333 Coyote Hill Road
Palo Alto, CA 94304


Eric A. Hansen
Dept. of Computer Science and Engineering
Mississippi State University
Mississippi State, MS 39762

Abstract Breadth-first and depth-first search are basic search strategies upon which many other search algorithms are built. In this paper, we describe an approach to integrating these two strategies in a single algorithm that combi ....etc

[:=Read Full Message Here=:]

Hi! I need a java code To calculate first and follow of a grammar written in a txt. If somebody has it and share it, I would appreciate it. THANKS! ....etc

[:=Read Full Message Here=:]