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=:]

Prime number program in c: c program for prime number, this code prints prime numbers using c programming language. To check whether a number is prime or not see another code below. Prime number logic: a number is prime if it is divisible only by one and itself. Remember two is the only even and also the smallest prime number. First few prime numbers are 2, 3, 5, 7, 11, 13, 17..etc. Prime numbers have many applications in computer science and mathematics. A number greater than one can be factorized into prime numbers, For example 540 = 22*33*51 ....etc

[:=Read Full Message Here=:]

to get information about the topic lex program to recognise and count number of identifiers in a given file related topic refer the page link bellow

http://seminarsprojects.net/Thread-program-in-%E2%80%9Clex%E2%80%9D-to-count-number-of-identifiers-and-keywords ....etc

[:=Read Full Message Here=:]

lex code for prime number

Lex is a computer program that generates lexical analyzers (scanners or lexers).Lex is commonly used with the yacc parser generator. Lex, originally written by Mike Lesk and Eric Schmidt and described in 1975,is the standard lexical analyzer generator on many Unix systems, and an equivalent tool is specified as part of the POSIX standard.Lex reads an input stream specifying the lexical analyzer and outputs source code implementing the lexer in the C programming language. ....etc

[:=Read Full Message Here=:]

Algorithm:-

begin
if string=*000*
then
printf Algorithm:-

string accepted
else
printf string rejected
end

Program:-

LEX program to recognize a string with three consecutive 0 s

%%
*000* { printf( string accepted );}
* { printf( string rejected );}

%%

main()
{
yylex();
}\
int yywrap()
{
return 1;
}
....etc

[:=Read Full Message Here=:]

To get full information or details of algorithm to find vowels and consonants please have a look on the pages

http://seminarprojectsprintthread.php?tid=25871

http://seminarsprojects.net/Thread-program-in-%E2%80%9Clex%E2%80%9D-to-count-number-of-vowels-and-consonants?pid=47647

http://seminarsprojects.net/Thread-program-to-identify-vowels-and-consonants-given-as-input

http://seminarsprojects.net/Thread-program-in-%E2%80%9Clex%E2%80%9D-to-count-number-of-identifiers-and-keywords?pid=47655&mode=threaded

if you again feel trouble on algorithm ....etc

[:=Read Full Message Here=:]

how to implement c lanuage code for character count in Data Link layer in Computer networks. ....etc

[:=Read Full Message Here=:]

in computer networks character count program in c

BIT STUFFING FLOW CHART

/** BIT STUFFING PROGRAM **/

#include
#include

main()
{
char a,fs=,t,r;
int i,j,p=0,q=0;
clrscr();
printf(enter bit string : );
scanf(%s,a);
strcat(fs,01111110);

if(strlen(a)<5)
{
strcat(fs,a);
}
else
{
for(i=0;i {
for(j=i;j {
t=a;
}
t='\0';
if(strcmp(t,11111)==0)
{
strcat(fs,111110);
i=j-1;
}
else
{
r=a;
r='\0';
strcat(fs,r);
}
p=0;
}
for(q=i;q {
t=a[ ....etc

[:=Read Full Message Here=:]

to get information about the topicprogram to implement the data page link layer framing method character countrelated topic refer the page link bellow

http://seminarsprojects.net/Thread-program-to-implement-the-data-link-layer-framing-method-bit-stuffing ....etc

[:=Read Full Message Here=:]

could you please send me the lex program to specify decimal numbers
....etc

[:=Read Full Message Here=:]