USER MANUAL
The code for modules appears in two files: lex.c and output.c. The file lex.c contains the main source code of the lexical analyzer. And the input to the lexical analyzer is contained in test.c. Under the DOS operating system, the program is compiled by using alt F9, and is executed by using ctrl F9. The output i.e token types are stored in the output file, output.txt
Sample Input:
#include<stdio.h>
#include<stdlib.h>
#define abc 100
void main()
{
int a_,b=30;
printf(“enter 2 no.s\n”); // printf statement
scanf(“%d%d”,&a,&b);
/* scanf
statement*/
if(a<20)
a=a+1;
}
Sample Output:
LINE NO TOKENS
———————————————–
1: #include<stdio.h> is a header file
2: #include<stdlib.h> is a header file
3: #define statement: abc is a constant
4: void: token value : 7
main :identifier, token value : 18
(: open parenthesis
): close parenthesis
5: {: open brace
6: int: token value : 1
a_ :identifier, token value : 18
, : comma
b :identifier, token value : 18
=: assignment operator
30 is a number
; : semi colon
7: printf: token value : 5
(: open parenthesis
enter 2 no.s\n : is a string
): close parenthesis
;: semi colon
8: scanf: token value : 6
(: open parenthesis
%d%d : is a string
,: comma
&a: address operator
, : comma
&b: address operator
): close parenthesis
;: semi colon
9:
10:
11: if: token value : 8
(: open parenthesis
a :identifier, token value : 18
<: less than operator
20 is a number
): close parenthesis
12: a: token value : 18
=: assignment operator
a: token value : 18
+: plus operator
1 is a number
;: semi colon
13: }: close parenthesis
CONCLUSION:
Generally, when syntactic analysis is being carried out by the parser it may call upon the scanner for tokenizing the input. But the LEXICAL ANALYZER designed by us is an independent program. It takes as input a file with an executable code in C. There fore, the parser cannot make use of the designed scanner as and when required.
Consider as an example an array ch[20].The designed lexical analyzer will tokenize ‘ch’ as an identifier,'[‘ as an opening brace,’20’ as a number, and ‘]’ as a closing brace. But the parser might require a[5] to be identified as an array. Similarly, there may arise a number of cases where the parser has to identify a token by a different mannerism than the one specified and designed. Hence, we conclude that the LEXICAL ANALYZER so designed is an independent program which is not flexible.
I want system programming, program code in C/C++
Thank you
tiwari
Hello ..plz give me the code in C…I want it urgent..plz send it at sonakhan20032003@yahoo.com
Thanks a lot
Hello ..plz give me the code in turbo C for the sudoko solver…I want it urgent..plz send it at priyank07310@yahoo.com
Thanks a lot
hello… plz help me the code in C++ and get the token in lexical analysis
plz give me the code in lex to recognize the tokens
please give source code of lexical analyzer using c
Hey can plz mail me the lex code to identify different tokens from a c code..
thanx in advance..
\\ Token Separation \\
Write a program to identify and generate the tokens present in the given input
#include
#include
#include
#include
int key = 0;
char expr[100];
char cont[][20]={“CONTROLS”,”for”,”do”,”while”,”NULL”,};
char cond[][20]={“CONDITION”,”if”,”then”,”NULL”};
char oprt[][20]={“OPERATOR”,”+”,”-“,”*”,”/”,”%”,”<","”,”>=”,”=”,”(“,”)”,”NULL”};
char branch[][20]={“BRANCHING”,”goto”,”jump” ,”NULL”};
void checking(char[],char[][20]);
void main()
{
int i,j,l,k,m,n;
char sbexpr[50],txt[3];
clrscr();
cout<=97 && sbexpr[m]=65 && sbexpr[m]<=90)))
{
cout<<"\n"<<sbexpr[m]<“<<"Identifier\n";
key = 1;
}
}
}
if(key == 0)
{
cout<<"\n"<<sbexpr<“<<"Address\n";
key = 1;
}
}
getch();
}
void checking (char expr[],char check[][20])
{
for(int i=1;strcmp(check[i],"NULL")!=0;i++)
{
if(strcmp(expr,check[i])==0)
{
cout<<expr<“<<check[0]<<"\n";
key = 1;
}
}
}
#include
#include
#include
#include
void Open_File();
void Demage_Lexeme();
int Search(char[256],int);
void analyze();
void Skip_Comment();
void Read_String();
void Is_Keyword_Or_Not();
void Is_Identifier_Or_Not();
void Is_Operator_Or_Not();
void Read_Number();
void Is_Special_Or_Not();
void Is_Comparison_Or_Not();
void Add_To_Lexical (char[256],int,char[256]);
void Print_ST();
void Print_TOKEN();
void Token_Attribute();
truct lexical
{
char data[256]; //Value of token.
int line[256]; //Line # which token appear in input
file.
int times; //# of times that token appear in input
file.
char type[256]; //Type of each token.
struct lexical *next;
};
typedef struct lexical Lex;
typedef Lex *lex;
/****************************************************************
File pointer for accessing the file.
*****************************************************************/
FILE *fp;
FILE *st;
FILE *token;
char lexeme[256],ch;
int f,flag,line=1,i=1;
lex head=NULL,tail=NULL;
/****************************************************************
Array holding all keywords for checking.
*****************************************************************/
char
*keywords[]={“procedure”,”is”,”begin”,”end”,”var”,”cin”,”cout”,”if”,
“then”,”else”,”and”,”or”,”not”,”loop”,”exit”,”when”,
“while”,”until”};
/****************************************************************
Array holding all arithmetic operations for checking.
*****************************************************************/
char arithmetic_operator[]={‘+’,’-‘,’*’,’/’};
/****************************************************************
Array holding all comparison operations for checking.
*****************************************************************/
char *comparison_operator[]={“”,”=”,”<=","”,”>=”};
/****************************************************************
Array holding all special for checking.
*****************************************************************/
char special[]={‘%’,’!’,’@’,’~’,’$’};
/****************************************************************
**************
*MAIN PROGRAM*
**************
*****************************************************************/
void main()
{
Open_File();
analyze();
fclose(fp);
Print_ST();
Print_TOKEN();
}
/****************************************************************
This function open input sourse file.
*****************************************************************/
void Open_File()
{
fp=fopen(“source.txt”,”r”); //provide path for source.txt here
if(fp==NULL)
{
printf(“!!!Can’t open input file – source.txt!!!”);
getch();
exit(0);
}
}
/****************************************************************
Function to add item to structure of array to store data and
information of lexical items.
*****************************************************************/
void Add_To_Lexical (char value[256],int line,char type[256])
{
lex new_lex;
if (!Search(value,line)) //When return 1 the token not found.
{
new_lex=malloc(sizeof(Lex));
if (new_lex!=NULL)
{
strcpy(new_lex->data,value);
new_lex->line[0]=line;
new_lex->times=1;
strcpy(new_lex->type,type);
new_lex->next=NULL;
if (head==NULL)
head=new_lex;
else
tail->next=new_lex;
tail=new_lex;
}
}
}
/****************************************************************
Function to search token.
*****************************************************************/
int Search (char value[256],int line)
{
lex x=head;
int flag=0;
while (x->next!=NULL && !flag)
{
if (strcmp(x->data,value)==0)
{
x->line[x->times]=line;
x->times++;
flag=1;
}
x=x->next;
}
return flag;
}
/****************************************************************
Function to print the ST.TXT .
*****************************************************************/
void Print_ST()
{
lex x=head;
int j;
if ((st=fopen(“ST.TXT”,”w”))==NULL)
printf(“The file ST.TXT cat not open.
“);
else
{
fprintf(st,” %s %s %s
“,”Line#”,”Lexeme”,”Type”);
fprintf(st,” —- —— —-
“);
while (x!=NULL)
{
if ((strcmp(x->type,”num”)==0) ||
(strcmp(x->type,”keyword”)==0) ||
(strcmp(x->type,”identifier”)==0))
{
fprintf(st,” “);
for (j=0;jtimes;j++)
{
fprintf(st,”%d”,x->line[j]);
if (j!=x->times-1) //This condition to prevent the comma
fprintf(st,”,”,x->line[j]); //”,” to not print after last line #.
}
fprintf(st,” %-6s %-6s
“,x->data,x->type);
}
x=x->next;
}
fclose(st);
}
}
/****************************************************************
Function to print the TOKENS.TXT .
*****************************************************************/
void Print_TOKEN()
{
int flag=0;
fp=fopen(“source.txt”,”r”);
if(fp==NULL)
{
printf(“!!!Can’t open input file – source.txt!!!”);
getch();
exit(0);
}
else
{
if ((token=fopen(“TOKENS.TXT”,”w”))==NULL)
printf(“The file ST.TXT cat not open.
“);
else
{
ch=fgetc(fp);
while (!(feof(fp)))
{
if (ch==’ ‘ && !flag)
{
do
ch=fgetc(fp);
while (ch==’ ‘);
fseek(fp,-2,1);
ch=fgetc(fp);
flag=1;
}
if (ch!=’
‘ && ch!=’ ‘)
fprintf(token,”%c”,ch);
if (ch==’
‘)
{
fprintf(token,”
“);
Token_Attribute();
i++;
flag=0;
}
ch=fgetc(fp);
}
}
}
fclose(fp);
fclose(token);
}
/****************************************************************
Function to put the token and atrribute in TOKENS.TXT .
*****************************************************************/
void Token_Attribute()
{
lex x=head;
int j;
while (x!=NULL)
{
if (x->line[0]==i)
{
fprintf(token,”token : %-4s “,x->type);
if ((strcmp(x->type,”num”)==0) ||
(strcmp(x->type,”keyword”)==0) ||
(strcmp(x->type,”identifier”)==0))
{
fprintf(token,”attribute : line#=%-4d
“,i);
}
else
{
fprintf(token,”attribute : %-4s
“,x->data);
}
}
x=x->next;
}
fprintf(token,”
“);
}
/****************************************************************
Function to create lexical analysis.
*****************************************************************/
void analyze()
{
ch=fgetc(fp); //Read character.
while(!feof(fp)) //While the file is not end.
{
if(ch==’
‘) //Compute # of lines in source.txt
.
{
line++;
ch=fgetc(fp);
}
if(isspace(ch) && ch==’
‘ )
{
line++;
ch=fgetc(fp);
}
if(isspace(ch) && ch!=’
‘ ) //The character is space.
ch=fgetc(fp);
if(ch==’/’ || ch=='”‘) //Function for skipping comments in the
file
Skip_Comment(); //and ‘”‘ with display statements.
if(isalpha(ch)) //The character is leter.
{
Read_String();
Is_Keyword_Or_Not();
Is_Operator_Or_Not();
Is_Identifier_Or_Not();
}
if(isdigit(ch)) //The character is digit.
Read_Number();
if (ch==’;’) //The character is semicolon.
Add_To_Lexical(“;”,line,”semicolon”);
if (ch==’:’) //The character is colon.
Add_To_Lexical(“:”,line,”colon”);
if (ch==’,’) //The character is comma.
Add_To_Lexical(“,”,line,”comma”);
if (ch=='(‘) //The character is parenthesis.
Add_To_Lexical(“(“,line,”parenthesis”);
if (ch==’)’) //The character is parenthesis.
Add_To_Lexical(“)”,line,”parenthesis”);
//The character is comparison_operator
if (ch==”)
Is_Comparison_Or_Not();
Is_Special_Or_Not(); //After failed scaning in before cases
//check the character is special or not.
Demage_Lexeme();
if(isspace(ch) && ch==’
‘ )
{
line++;
ch=fgetc(fp);
}
else
ch=fgetc(fp);
}
}
/****************************************************************
This function read all character of strings.
*****************************************************************/
void Read_String()
{
int j=0;
do
{
lexeme[j++]=ch;
ch=fgetc(fp);
} while(isalpha(ch));
fseek(fp,-1,1);
lexeme[j]=’
program 4 token separation in c++
Token is a sequence of characters that has a collective meaning
I found this kit on ebay =) No problem =)
“speak Japanese
i cant understand at all”
Can you tell how many tokes the following statments consists of:-
printf(“Test of %d tokens %d”,a,b);
printf(“TEST”);
??
i am bit confused weather %d will be treated as separate tokens or not?
And for the literal weather the quotations (“) will be counted as tokens or not?
plz send me the source code in lex to identify different parts of speech by making use of symbol table.
Let the minds continue to convene here and devour problems!!
Thanx to you all enthusiasts!
how to run this token separation program (format)
how to run this token separation program (format plz)
2.Write a program in LEX to count the no of:
(i) positive and negative integers
(ii) positive and negative fractions.
For C and C++ source programs
would u give an answer for this
1. Write a program in LEX to count the no of:
(i) positive and negative integers
(ii) positive and negative fractions.
For C and C++ source programs
1. Write a LEX program to recognize a valid C and C++ programs if u can include if condition, loop.
Kindly send me a program that will accept expressions from the user and define the keywords, identifiers, number, relational operator and etc.
Sample output:
Enter expression:
scanf(“%s”, exp);
scanf is a keyword
( is a punctuation
” is a punctuation
%s
” is a punctuation
, is a punctuation
exp is an identifier
) is a punctuation
; is a punctuation
mail me on joeann_espanol@yahoo.com
thank’z
kylangan ko din po ng program n lexical analyzer.. the same program sa taas..
sample output:
m=1* (a+v % 3);
m is a variable
= is an assignment operator
1 is a number
( is a punctuation
a is a variable
+ is an arithmetic operator
v is a variable
% is an arithmetic operator
3 is a number
) is a punctuation
; is a separator