Objective
Program in “LEX” to count number of vowels and consonants .

%{
int count1=0;
int count2=0;
%}
%%
aIeIiIoIu {printf(%s is vowel,yytext);count1++;}
{printf(%s is constonant,yytext);count2++;}
.I\n {ECHO;}
%%
main()
{
yylex();
printf(%d Vowel =%d constonant=,count1,count2);
}
....etc

[:=Read Full Message Here=:]

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

....etc

[:=Read Full Message Here=:]

Presented by
Pradyut Kumar Mallick


Introduction
Hidden links are ones that real people aren’t supposed to actually notice or click on
Hidden links is a way to guide a search engine to our doorway pages.
New dynamic “hidden link” technique for linking a large highly connected graph in a simple hyperbolic space without cluttering the display.
A cyclic hyperbolic space with hidden links
In a hyperbolic space, the far away nodes/edges (paths) are diminished when the user is not focus ....etc

[:=Read Full Message Here=:]

import java.io.*;
class Broom
{
int length,width,height;
Broom(int l,int w,int h)
{
length=l;
width=w;
height=h;
}
int volume()
{
return(length*width*height);
}
}
class Kroom extends Broom
{
Kroom(int l,int w,int h)
{
super(l,w,h);
}
void display()
{
System.out.println(Volume is:+volume());
}
}

class Nbroom1
{
public static void main(String args)throws IOException
{
DataInputStream dis=new DataInputStream(System.in);
System.out.println(enter the parametrs of bedroom);
System.out.println(ent ....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=:]

to find hcf and lcm using constructors in java ....etc

[:=Read Full Message Here=:]

//QuadEqn.java
package p;
interface Quadratic
{
void process();
}
public class QuadEqn implements Quadratic
{
double a,b,c,d;
public QuadEqn(double x,double y,double z)
{
a=x;
b=y;
c=z;
}
public void process()
{

d=b*b-(4*a*c);
if(d==0)
{
double r=-b/2*a;
System.out.println(Roots are equal.Root=\t+r);
}
else
if(d>0)
{
double sq=Math.sqrt(d);
double r1=(-b+sq)/2*a;
double r2=(-b-sq)/2*a;
System.out.println(Root1=\t+r1+\nRoot2=\t+r2);
}
else
System.out.pri ....etc

[:=Read Full Message Here=:]

Pls provide TCL source code for finding optimal path using GA and PSO.
....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=:]