Yacc %token DIGIT LETTER NL UND %% stmt : variable NL { printf(“Valid Identifiersn”); exit(0);} ; variable : LETTER alphanumeric ; alphanumeric: LETTER alphanumeric | DIGIT alphanumeric | UND alphanumeric…
Lex %{ #include"y.tab.h" #include %} %% ([0-9]+|([0-9]*.[0-9]+)([eE][-+]?[0-9]+)?) {yylval.dval=atof(yytext);return NUMBER;} log | LOG {return LOG;} In {return nLOG;} sin | SIN {return SINE;} cos | COS {return COS;} tan | TAN…
ALGORITHM:1. Start 2. Include the header file.3. In int code.l,declare the variable lie no as integer and assign it to be equal to ‘1’.4. Start the int code.l with declarative section.5.…
//Implement any one storage allocation strategies (Heap,Stack,Static) #include #include #include #define TRUE 1 #define FALSE 0 typedef struct Heap { int data; struct Heap *next; }node; node *create(); void main()…
ALGORITHM: Input: Set of ‘L’ values with corresponding ‘R’ values. Output: Intermediate code & Optimized code after eliminating common expressions. //C program to implement Code Optimization Techniques. #include #include #include struct op…
#include #include char a[10]; int top=-1,i; void error() { printf("Syntax Error"); } void push(char k[]) { for(i=0;k[i]!='';i++) { if(top=0) a[top--]=''; } void display() { for(i=0;i
#include #include int nop,m=0,p,i=0,j=0; char prod[10][10],res[10]; void FOLLOW(char c); void first(char c); void result(char); void main() { int i; int choice; char c,ch; printf("Enter the no.of productions: "); scanf("%d", &nop);…
#include #include void FIRST(char[],char ); void result(char[],char); int nop; char prod[10][10]; void main() { int i; char choice; char c; char res1[20]; clrscr(); printf("How many number of productions ? :");…
#include #include char input[10]; int i=0,error=0; void E(); void T(); void Eprime(); void Tprime(); void F(); void main() { clrscr(); printf("Enter an arithmetic expression :n"); gets(input); E(); if(strlen(input)==i&&error==0) printf("nAccepted..!!!"); else…
INSERTION SORTStart with an empty left hand [sorted array] and the cards face down on the table [unsorted array].Then remove one card [key] at a time from the table [unsorted…