4. Lex program that distinguishes keywords, integers, floats, identifiers, operators, and comments

 

Lex program that distinguishes keywords, integers, floats, identifiers, operators, and comments

/*Lex program that distinguishes keywords, integers, floats, identifiers, operators, and
comments in any simple programming language.*/ 
 
%{
enum{INTEGER,FLOAT,IDENTIFIER,OPERATOR,COMMENT};
%}
digit [0-9]
letter[A-Za-z_]

%%
" "|"\t" ;
{digit}+   { return INTEGER; }
{digit}+\.{digit}+ { return FLOAT; }
'+' |
'-' |
'*' |
'/' { return OPERATOR; }

{letter}({letter}|{digit})* { return IDENTIFIER; }
"/*" { return COMMENT;}
%%
int main(void)
{
  int result;
  int running = 1;
 while(running)
 {
  result = yylex();
  switch(result)
                {
  case INTEGER: printf("integer"); break;
  case FLOAT: printf("float"); break;
  case OPERATOR: printf("operator"); break;
  case IDENTIFIER:printf("identifier"); break;
  case COMMENT: printf("comment"); break;
  }
 }
return 0;
}
 
// Output of the above Program
Lex program that distinguishes keywords, integers, floats, identifiers, operators, and comments
Lex program that distinguishes keywords, integers, floats, identifiers, operators, and comments

Comments

Post a Comment

Popular posts from this blog

Compiler Design

CS 5641:  Fall 2009 Lecturer:  Rich Maclin  (rmaclin) Teaching Assistant: Bharat Siginam Syllabus Grades Useful software: gdb flex bison JavaCC NetBeans Eclipse Class Materials (previous offerings) Introduction Parts of a Compiler, Types of Programming Languages Lexical Analysis Introduction, Finite State Machines Regular Expressions, NFSMs, DFSMs, Translation Scanner Implementation     Sample code (gziped tar file) Parsing Introduction, Context Free Grammars, Languages, Derivations Ambiguity, Precedence, Associativity Top Down Parsing, Recursive Descent, Predictive Parsing, LL(1), First and Follow sets Bottom Up Parsing, Shift and Reduce, Conflicts SLR Parsing, SLR States     (PDF, 6 Per Page) Constructing SLR States, LR(1) Parsing, LALR Parsing Semantic Analysis Syntax-Directed Translation, Parse Trees, Abstract Syntax Trees Implementation Example with Bison, LL(1) Grammar     Co...
Read more

3. Lex program to find the length of the longest word

Image
  Lex program to find the length of the longest word   /*Write a Lex program that finds the length of the longest word (defined as a contiguous  string of upper and lower case letters) in the input.*/   %{ # include<stdio.h> int k= 0 ; %} %% [a-zA-Z]+ { if (yyleng>k) { k= yyleng; } } %% int main( int argc[], char **argv[]) { yyin=fopen( "abc.txt" , "r" ); yylex(); printf( "largest: %d" ,k); printf( "\n" ); return 0 ; }     //file abc.txt   Lex program to find the length of the longest word //Output of the above program Lex program to find the length of the longest word
Read more

6. Lex program to count the number of words,small and capital letters, digits and special characters in a C file

Image
  Lex program to count the number of words,small and capital letters, digits and special characters in a C file /*Lex program to count the number of words, characters, blank spaces and lines in a C file.*/     %{ #include<stdio.h> int lines= 0 , words= 0 ,s_letters= 0 ,c_letters= 0 , num= 0 , spl_char= 0 ,total= 0 ; %}    %% \ n { lines++; words++;} [ \ t ' ' ] words++; [A-Z] c_letters++; [a-z] s_letters++; [ 0 - 9 ] num++; . spl_char++; %% main( void ) { yyin= fopen( "abc.txt" , "r" ); yylex(); total=s_letters+c_letters+num+spl_char; printf( " This File contains ..." ); printf( "\n\t%d lines" , lines); printf( "\n\t%d words" ,words); printf( "\n\t%d small letters" , s_letters); printf( "\n\t%d capital letters" ,c_letters); printf( "\n\t%d digits" , num); printf( "\n\t%d special characters" ,spl_char); printf( "\n\tIn total %d characters.\n" ,total); } int yywrap() { ...
Read more