In this program we have to count the the number of lines , spaces and characters . This is a lex program so first we have to know how to run a lax program in ubuntu and what is the format of the program . The lex files are save in file_name.l and for running a lex file we use some command which are given below:-
Code:-
%{
#include<stdio.h>
#include<string.h>
int lc=0,tc=0,ch=0,sc=0;
%}
%%
\n lc++;
([ ]) sc++;
\t tc++;
. ch++;
%%
int main()
{
yylex();
printf("Number of lines are %d\n",lc);
printf("Number of spaces are %d\n",sc);
printf("Number of tabs are %d\n",tc);
printf("Number of characters are %d\n",ch);
return 0;
}
Output:-
One more thing you have to know for terminate the program press Ctrl+d then it will print the output.
tripathirajnish@ubuntu:~$ lex check.l
tripathirajnish@ubuntu:~$ gcc lex.yy.c -ll
tripathirajnish@ubuntu:~$ ./a.out
this is easycodingzone
you can learn progarmming
in a easy way
Number of lines are 3
Number of spaces are 8
Number of tabs are 3
Number of characters are 52
tripathirajnish@ubuntu:~$
Recommended Post:
Hackerearth Problems:-
- Very Cool numbers | Hacker earth solution
- Vowel Recognition | Hackerearth practice problem solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem
Hackerrank Problems:-
Data structure:-
- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree
Key points:-
- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier
MCQs:-
0 Comments