Compiler Programs
Compiler Programs
Compiler Programs
Aim:
To implement the lexical analyzer using LEX tool.
Algorithm:
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, %%.
2. The format is as follows:
definitions
%%
rules
%%
user_subroutines
3. 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.
4. 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.
5. Each pattern may have a corresponding action, that is, a fragment of C source code to
execute when the pattern is matched.
6. 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.
7. In user subroutine section, main routine calls yylex(). yywrap() is used to get more
input.
8. 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.
PROGRAM:
%{
%}
%%
[A-Z]+[ \t\n\.\,] {printf("%s",yytext);}
. ;
%%
main()
{
printf("\n Enter some input with capital words in between:\n");
yylex();
}
int yywrap()
{
return 1;
}
OUTPUT:
Result:
Thus the c program to implementing the lex analyzer using Lex tool was executed successfully
and the output was verified.