Scribd
Upload
12 views5 pages

Nila Assign5

Uploaded by

kavidheshg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
12 views5 pages

Nila Assign5

Uploaded by

kavidheshg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Compiler Lab – UCS 2702

Programming Assignment-5
Implementation of Syntax Checker using Lex and Yacc Tools
Name : Nila Sureshkumar
Reg No : 3122 21 5001 061
------------------------------------------------------------------------------------------------------------------

Develop a Syntax checker to recognize the following statements by writing suitable grammars

• Assignment statement

• Conditional statement

• Looping statement

• Declaration statement

Aim

Develop a Syntax checker to recognize the following statements by writing suitable grammars
• Assignment statement

• Conditional statement

• Looping statement

• Declaration statement

Code

Parser.l

%{
#include "parser.tab.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
%}

// Define regex patterns for tokens


identifier [a-zA-Z_][a-zA-Z0-9_]*
number [0-9]+
whitespace [ \t\n]+

%%

// Keywords
int { return INT; }
if { return IF; }
else { return ELSE; }
while { return WHILE; }

// Tokens for identifiers and numbers


{identifier} {
yylval.str = strdup(yytext);
return IDENTIFIER;
}
{number} {
yylval.num = atoi(yytext);
return NUMBER;
}

// Symbol tokens
";" { return SEMICOLON; }
"," { return COMMA; }
"=" { return ASSIGN; }
"==" { return EQ; }
"!=" { return NEQ; }
"<" { return LT; }
">" { return GT; }
"<=" { return LE; }
">=" { return GE; }
"+" { return PLUS; }
"-" { return MINUS; }
"*" { return MULTIPLY; }
"/" { return DIVIDE; }

"(" { return LPAREN; }


")" { return RPAREN; }
"{" { return LBRACE; }
"}" { return RBRACE; }

// Ignore whitespace
{whitespace} { /* ignore whitespace */ }

// Catch-all for invalid characters


. {
printf("Invalid character: %s\n", yytext);
}

// Wrap function
%%

int yywrap() {
return 1;
}
Parser.y

%{
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

void yyerror(const char *s);


int yylex();

%}

%union {
char *str;
int num;
}

%token <str> IDENTIFIER


%token <num> NUMBER
%token INT IF ELSE WHILE
%token ASSIGN EQ NEQ LT GT LE GE PLUS MINUS MULTIPLY DIVIDE
%token SEMICOLON COMMA LPAREN RPAREN LBRACE RBRACE

%%

// Grammar rules
program:
statements
;

statements:
statement
| statements statement
;

statement:
declaration_statement
| assignment_statement
| conditional_statement
| looping_statement
;

declaration_statement:
INT identifier_list SEMICOLON
;

identifier_list:
IDENTIFIER
| identifier_list COMMA IDENTIFIER
;
assignment_statement:
IDENTIFIER ASSIGN expression SEMICOLON
;

expression:
expression PLUS term
| expression MINUS term
| term
;

term:
term MULTIPLY factor
| term DIVIDE factor
| factor
;

factor:
IDENTIFIER
| NUMBER
| LPAREN expression RPAREN
;

conditional_statement:
IF LPAREN condition RPAREN statement
| IF LPAREN condition RPAREN statement ELSE statement
;

condition:
expression relational_operator expression
;

relational_operator:
EQ | NEQ | LT | GT | LE | GE
;

looping_statement:
WHILE LPAREN condition RPAREN LBRACE statements RBRACE
;

%%

// Error handling function


void yyerror(const char *s) {
fprintf(stderr, "Error: %s\n", s);
}

int main(void) {
if (yyparse() == 0) {
printf("Syntactically correct\n");
} else {
printf("Syntax error detected\n");
}
return 0;
}

Output

Learning Outcome

1. Understand the role of intermediate code in the compilation process.


2. Apply syntax-directed translation rules for generating intermediate code.
3. Implemented lexer and parser components using Flex and Yacc.
4. Generate intermediate code for boolean expressions and logical operators.
5. Handle syntax errors and improve debugging skills in code generation.

Learning Outcomes:

• Tokenize programming constructs using lexical analysis.


• Design grammars to define program structures.
• Parse and validate syntax with error handling.
• Build a basic interpreter for variables, conditions, and loops.
• Understand control flow and foundational compiler design concepts.

You might also like