Lex is a computer program that generates lexical analyzers and was written by Mike Lesk and Eric Schmidt.
Lex reads an input stream specifying the lexical analyzer and outputs source code implementing the lexer in the C programming language.
Prerequisite: Flex (Fast lexical Analyzer Generator)
Example:
Input: Hello everyone Output: 2 Input: This is neveropen Output: 3
Note: The words can consist of lowercase characters, uppercase characters and digits.
Below is the implementation to count the number of words.
/*lex program to count number of words*/%{ #include<stdio.h> #include<string.h> int i = 0; %}   /* Rules Section*/%% ([a-zA-Z0-9])*   {i++;} /* Rule for counting                           number of words*/  "\n" {printf("%d\n", i); i = 0;} %%   int yywrap(void){}   int main() {       // The function that starts the analysis     yylex();       return 0; } |
Output:
Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!
