Lex Program to Identify and Count Positive and Negative Numbers
Given some numbers, task is to identify the positive and negative numbers and print the count of negative and positive numbers.
Prerequisite: Flex (Fast lexical Analyzer Generator)
Examples:
Input : -52
Output :
negative number=-52
number of positive numbers = 0
number of negative numbers = 1
Input : 63
Output :
positive number = 63
number of positive numbers = 0
number of negative numbers = 1
Below is the implementation program:
%{
int positive_no = 0, negative_no = 0;
%}
%%
^[-][0-9]+ {negative_no++;
printf ( "negative number = %s\n" ,
yytext);}
[0-9]+ {positive_no++;
printf ( "positive number = %s\n" ,
yytext);}
%%
int yywrap(){}
int main()
{
yylex();
printf ( "number of positive numbers = %d,"
"number of negative numbers = %d\n" ,
positive_no, negative_no);
return 0;
}
|
Output:
Last Updated :
30 Apr, 2019
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...