Compiler Design

Lex program replaces the substring abc by ABC from the given input string

Lex program replaces the substring abc by ABC from the given input string
  1. Lex program contains three sections: definitions, rules, and user subroutines. Each section must be separated from the others by a line containing only the delimiter, %%.

The format is as follows: definitions %% rules %% user_subroutines

  1. In definition section, the variables make up the left column, and their definitions make up the right column. Any C statements should be enclosed in %{..}%. Identifier is defined such that the first letter of an identifier is alphabet and remaining letters are alphanumeric.
  2. In rules section, the left column contains the pattern to be recognized in an input file to yylex(). The right column contains the C program fragment executed when that pattern is recognized. The various patterns are keywords, operators, new line character, number, string, identifier, beginning and end of block, comment statements, preprocessor directive statements etc.
  3. Each pattern may have a corresponding action, that is, a fragment of C source code to execute when the pattern is matched.
  4. When yylex() matches a string in the input stream, it copies the matched text to an external character array, yytext, before it executes any actions in the rules section.
  5. In user subroutine section, main routine calls yylex(). yywrap() is used to get more input.
  6. The lex command uses the rules and actions contained in file to generate a program, lex.yy.c, which can be compiled with the cc command. That program can then receive input, break the input into the logical pieces defined by the rules in file, and run program fragments contained in the actions in file.
%{
#include
#include
int i;
%}
%%
[a-z A-Z]* {
for(i=0;i<=yyleng;i++)
{
if((yytext[i]=='a')&&(yytext[i+1]=='b')&&(yytext[i+2]=='c'))
{
yytext[i]='A';
yytext[i+1]='B';
yytext[i+2]='C';
}
}
printf("%s",yytext);
}
[\t]* return;
.* {ECHO;}
\n {printf("%s",yytext);}
%%
main()
{
yylex();
}
int yywrap()
{
return 1;
}
OUTPUT:

[CSE@localhost ~]$ lex lex1.l

[CSE@localhost ~]$ cc lex.yy.c

[CSE@localhost ~]$. /a.out

 abc

 ABC

Team Educate

About Author

Leave a comment

Your email address will not be published. Required fields are marked *

You may also like

C Program to Recognize Strings Under 'a*', 'a*b+', 'abb'
Compiler Design

C Program to Recognize Strings Under ‘a’, ‘ab+’, ‘abb’

This C program is designed to recognize and classify strings according to three specific rules or patterns: a*: A string
Convert from NFA to DFA using Thompson’s rule for (a+b)*abb
Compiler Design

Convert from NFA to DFA using Thompson’s rule for (a+b)*abb

To convert the regular expression (a + b)*abb from an NFA to a DFA using Thompson’s construction, we will follow