From 5a0a7d882daa64f7906c061fda9c1864a333faa8 Mon Sep 17 00:00:00 2001 From: cs Date: Fri, 18 Aug 2023 14:16:06 +0530 Subject: [PATCH 01/11] feat(S7): lexical analyzer --- B-Tech-S7/descentParser.c | 11 +++++ B-Tech-S7/lexical/file.txt | 1 + B-Tech-S7/lexical/lexical.c | 82 +++++++++++++++++++++++++++++++++++++ 3 files changed, 94 insertions(+) create mode 100644 B-Tech-S7/descentParser.c create mode 100644 B-Tech-S7/lexical/file.txt create mode 100644 B-Tech-S7/lexical/lexical.c diff --git a/B-Tech-S7/descentParser.c b/B-Tech-S7/descentParser.c new file mode 100644 index 0000000..96cb621 --- /dev/null +++ b/B-Tech-S7/descentParser.c @@ -0,0 +1,11 @@ +#include + +char input[100]; + +void main() { + printf("Enter an arithmetic expression: "); + fgets(input, sizeof(input), stdin); + + int result = parseExpression(); + printf("Result: %d\n", result); +} \ No newline at end of file diff --git a/B-Tech-S7/lexical/file.txt b/B-Tech-S7/lexical/file.txt new file mode 100644 index 0000000..21bfb36 --- /dev/null +++ b/B-Tech-S7/lexical/file.txt @@ -0,0 +1 @@ +int a = 2 ; \ No newline at end of file diff --git a/B-Tech-S7/lexical/lexical.c b/B-Tech-S7/lexical/lexical.c new file mode 100644 index 0000000..4005ef9 --- /dev/null +++ b/B-Tech-S7/lexical/lexical.c @@ -0,0 +1,82 @@ +#include +#include +#include + +#define MAX 100 +char keyword[20][10] = {"int", "char", "main", "for"}; +char operator[20][3] = {"==", "++", "-", "+", "="}; +char symbol[20][2] = {";", ",", ":", "(" ,")", "{", "}"}; +char constant[20][3] = {"10", "1", "2"}; + +int j; + +int key(char *text) { + for(j=0;j<4;j++){ + if(strcmp(text,keyword[j]) == 0) + return 1; + } +} + +int op(char *text) { + for(j=0;j<6;j++){ + if(strcmp(text,operator[j]) == 0) + return 1; + } +} + +int sym(char *text) { + for(j=0;j<8;j++){ + if(strcmp(text,symbol[j]) == 0) + return 1; + } + char* s; + s = (char*)malloc(20); + strcpy(s, text); + s[strlen(s)-1] = '\0'; + for(j=0;j<8;j++){ + if(strcmp(s,symbol[j]) == 0) + return 2; + } +} + +int con(char *text) { + for(j=0;j<3;j++){ + if(strcmp(text,constant[j]) == 0) + return 1; + } +} + +int main() +{ + int i; + FILE *fp; + char line[MAX]; + + fp = fopen("file.txt", "r"); + if (fp == NULL) + return 1; + + while (fgets(line, MAX, fp)) + { + char *token = strtok(line, " "); + while (token != NULL) + { + // printf(" %s\n", token); + char a[4] = "int"; + if (i = (key(token)) == 1) + printf("%s - keyword\n", token); + else if (i = (op(token)) == 1) + printf("%s - operator\n", token); + else if (i = (con(token)) == 1) + printf("%s - constant\n", token); + else if (i = (sym(token)) == 1) + printf("%s - symbol\n", token); + else if (i = (sym(token)) == 2) + printf("%s - symbol\n", token); + else + printf("%s - identifier\n", token); + token = strtok(NULL, " "); + } + } + fclose(fp); +} \ No newline at end of file From 9aa06bb422be2140255f8b7633c8430de8a22d3a Mon Sep 17 00:00:00 2001 From: cs Date: Fri, 18 Aug 2023 15:17:35 +0530 Subject: [PATCH 02/11] feat(S7): RECURSIVE descent parser --- .gitignore | 5 ++- B-Tech-S7/descentParser.c | 87 +++++++++++++++++++++++++++++++++++++-- 2 files changed, 88 insertions(+), 4 deletions(-) diff --git a/.gitignore b/.gitignore index 600d2d3..2a5d958 100644 --- a/.gitignore +++ b/.gitignore @@ -1 +1,4 @@ -.vscode \ No newline at end of file +.vscode +a.out +**/**/a.out +**/a.out diff --git a/B-Tech-S7/descentParser.c b/B-Tech-S7/descentParser.c index 96cb621..1d24e07 100644 --- a/B-Tech-S7/descentParser.c +++ b/B-Tech-S7/descentParser.c @@ -1,11 +1,92 @@ #include +#include + +// Production rule +// E -> TE' +// E' -> +TE'|3 +// T -> FT' +// T' -> *FT'|3 +// F -> BF' +// F' -> /BF'|3 +// B -> (E)|id char input[100]; +int i=0,error=0; + +void E(); +void EPrime(); +void T(); +void TPrime(); +void F(); +void FPrime(); +void B(); + +void E() { + T(); + EPrime(); +} + +void EPrime() { + if(input[i] == '+' | input[i] == '-'){ + i++; + T(); + EPrime(); + } +} + +void T() { + F(); + TPrime(); +} + +void TPrime(){ + if(input[i] == '*'){ + i++; + F(); + TPrime(); + } +} + +void FPrime(){ + if(input[i] == '/'){ + i++; + B(); + FPrime(); + } +} + +void F() { + B(); + FPrime(); +} + + + +void B() { + if(isalnum(input[i])){ + i++; + } + else if(input[i] == '(') { + i++; + E(); + if(input[i] == ')') { + i++; + } + else{ + error++; + } + } + else { + error++; + } +} void main() { printf("Enter an arithmetic expression: "); fgets(input, sizeof(input), stdin); - - int result = parseExpression(); - printf("Result: %d\n", result); + E(); + if(error == 0) + printf("Approved..."); + else + printf("Rejected..."); } \ No newline at end of file From 04c39cfb524cecb816df6a50c1bfb2c8cac66ec6 Mon Sep 17 00:00:00 2001 From: cs Date: Fri, 18 Aug 2023 15:19:56 +0530 Subject: [PATCH 03/11] fix --- B-Tech-S7/descentParser.c | 2 -- 1 file changed, 2 deletions(-) diff --git a/B-Tech-S7/descentParser.c b/B-Tech-S7/descentParser.c index 1d24e07..9ed282d 100644 --- a/B-Tech-S7/descentParser.c +++ b/B-Tech-S7/descentParser.c @@ -60,8 +60,6 @@ void F() { FPrime(); } - - void B() { if(isalnum(input[i])){ i++; From 8723021a5388232e49906b7407a5eb04e1ed08bc Mon Sep 17 00:00:00 2001 From: cs Date: Fri, 18 Aug 2023 15:24:42 +0530 Subject: [PATCH 04/11] fix again Co-authored-by: Jenin jenin8282@gmail.com --- B-Tech-S7/lexical/file.txt | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/B-Tech-S7/lexical/file.txt b/B-Tech-S7/lexical/file.txt index 21bfb36..eb40097 100644 --- a/B-Tech-S7/lexical/file.txt +++ b/B-Tech-S7/lexical/file.txt @@ -1 +1,2 @@ -int a = 2 ; \ No newline at end of file +int a = 2 ; +char b = 't' ; \ No newline at end of file From 246e1bed8d1a10e9c313d425af2c70e0eef559e3 Mon Sep 17 00:00:00 2001 From: cslab8282 Date: Wed, 27 Sep 2023 15:35:42 +0530 Subject: [PATCH 05/11] feat(): shift --- B-Tech-S7/shiftReduce.c | 2 ++ 1 file changed, 2 insertions(+) create mode 100644 B-Tech-S7/shiftReduce.c diff --git a/B-Tech-S7/shiftReduce.c b/B-Tech-S7/shiftReduce.c new file mode 100644 index 0000000..10b222c --- /dev/null +++ b/B-Tech-S7/shiftReduce.c @@ -0,0 +1,2 @@ +#include + From 8cb76209890584cb289d9de5a99bd3380c40f968 Mon Sep 17 00:00:00 2001 From: cslab8282 Date: Wed, 27 Sep 2023 15:35:48 +0530 Subject: [PATCH 06/11] inter --- B-Tech-S7/firstFollow.c | 285 ++++++++++++++++++++++++++++++++++++++++ B-Tech-S7/inter.c | 53 ++++++++ B-Tech-S7/shiftReduce.c | 2 - 3 files changed, 338 insertions(+), 2 deletions(-) create mode 100644 B-Tech-S7/firstFollow.c create mode 100644 B-Tech-S7/inter.c delete mode 100644 B-Tech-S7/shiftReduce.c diff --git a/B-Tech-S7/firstFollow.c b/B-Tech-S7/firstFollow.c new file mode 100644 index 0000000..8c9a0ab --- /dev/null +++ b/B-Tech-S7/firstFollow.c @@ -0,0 +1,285 @@ +#include +#include +#include + +// Functions to calculate Follow +void followfirst(char, int, int); +void follow(char c); + +// Function to calculate First +void findfirst(char, int, int); + +int count, n = 0; + +// Stores the final result +// of the First Sets +char calc_first[10][100]; + +// Stores the final result +// of the Follow Sets +char calc_follow[10][100]; +int m = 0; + +// Stores the production rules +char production[10][10]; +char f[10], first[10]; +int k; +char ck; +int e; + +int main(int argc, char **argv) +{ + int jm = 0; + int km = 0; + int i, choice; + char c, ch; + count = 8; + + strcpy(production[0], "E=TR"); + strcpy(production[1], "R=+TR"); + strcpy(production[2], "R=#"); + strcpy(production[3], "T=FY"); + strcpy(production[4], "Y=*FY"); + strcpy(production[5], "Y=#"); + strcpy(production[6], "F=(E)"); + strcpy(production[7], "F=i"); + + int kay; + char done[count]; + int ptr = -1; + + // Initializing the calc_first array + for(k = 0; k < count; k++) { + for(kay = 0; kay < 100; kay++) { + calc_first[k][kay] = '!'; + } + } + int point1 = 0, point2, x; + + for(k = 0; k < count; k++) + { + c = production[k][0]; + point2 = 0; + x = 0; + + // Checking if First of c has + // already been calculated + for(kay = 0; kay <= ptr; kay++) + if(c == done[kay]) + x = 1; + + if (x == 1) + continue; + + // Function call + findfirst(c, 0, 0); + ptr += 1; + + // Adding c to the calculated list + done[ptr] = c; + printf("\n First(%c) = { ", c); + calc_first[point1][point2++] = c; + + // Printing the First Sets of the grammar + for(i = 0 + jm; i < n; i++) { + int lark = 0, chk = 0; + + for(lark = 0; lark < point2; lark++) { + + if (first[i] == calc_first[point1][lark]) + { + chk = 1; + break; + } + } + if(chk == 0) + { + printf("%c, ", first[i]); + calc_first[point1][point2++] = first[i]; + } + } + printf("}\n"); + jm = n; + point1++; + } + printf("\n"); + printf("-----------------------------------------------\n\n"); + char donee[count]; + ptr = -1; + + // Initializing the calc_follow array + for(k = 0; k < count; k++) { + for(kay = 0; kay < 100; kay++) { + calc_follow[k][kay] = '!'; + } + } + point1 = 0; + int land = 0; + for(e = 0; e < count; e++) + { + ck = production[e][0]; + point2 = 0; + x = 0; + + // Checking if Follow of ck + // has alredy been calculated + for(kay = 0; kay <= ptr; kay++) + if(ck == donee[kay]) + x = 1; + + if (x == 1) + continue; + land += 1; + + // Function call + follow(ck); + ptr += 1; + + // Adding ck to the calculated list + donee[ptr] = ck; + printf(" Follow(%c) = { ", ck); + calc_follow[point1][point2++] = ck; + + // Printing the Follow Sets of the grammar + for(i = 0 + km; i < m; i++) { + int lark = 0, chk = 0; + for(lark = 0; lark < point2; lark++) + { + if (f[i] == calc_follow[point1][lark]) + { + chk = 1; + break; + } + } + if(chk == 0) + { + printf("%c, ", f[i]); + calc_follow[point1][point2++] = f[i]; + } + } + printf(" }\n\n"); + km = m; + point1++; + } +} + +void follow(char c) +{ + int i, j; + + // Adding "$" to the follow + // set of the start symbol + if(production[0][0] == c) { + f[m++] = '$'; + } + for(i = 0; i < 10; i++) + { + for(j = 2;j < 10; j++) + { + if(production[i][j] == c) + { + if(production[i][j+1] != '\0') + { + // Calculate the first of the next + // Non-Terminal in the production + followfirst(production[i][j+1], i, (j+2)); + } + + if(production[i][j+1]=='\0' && c!=production[i][0]) + { + // Calculate the follow of the Non-Terminal + // in the L.H.S. of the production + follow(production[i][0]); + } + } + } + } +} + +void findfirst(char c, int q1, int q2) +{ + int j; + + // The case where we + // encounter a Terminal + if(!(isupper(c))) { + first[n++] = c; + } + for(j = 0; j < count; j++) + { + if(production[j][0] == c) + { + if(production[j][2] == '#') + { + if(production[q1][q2] == '\0') + first[n++] = '#'; + else if(production[q1][q2] != '\0' + && (q1 != 0 || q2 != 0)) + { + // Recursion to calculate First of New + // Non-Terminal we encounter after epsilon + findfirst(production[q1][q2], q1, (q2+1)); + } + else + first[n++] = '#'; + } + else if(!isupper(production[j][2])) + { + first[n++] = production[j][2]; + } + else + { + // Recursion to calculate First of + // New Non-Terminal we encounter + // at the beginning + findfirst(production[j][2], j, 3); + } + } + } +} + +void followfirst(char c, int c1, int c2) +{ + int k; + + // The case where we encounter + // a Terminal + if(!(isupper(c))) + f[m++] = c; + else + { + int i = 0, j = 1; + for(i = 0; i < count; i++) + { + if(calc_first[i][0] == c) + break; + } + + //Including the First set of the + // Non-Terminal in the Follow of + // the original query + while(calc_first[i][j] != '!') + { + if(calc_first[i][j] != '#') + { + f[m++] = calc_first[i][j]; + } + else + { + if(production[c1][c2] == '\0') + { + // Case where we reach the + // end of a production + follow(production[c1][0]); + } + else + { + // Recursion to the next symbol + // in case we encounter a "#" + followfirst(production[c1][c2], c1, c2+1); + } + } + j++; + } + } +} \ No newline at end of file diff --git a/B-Tech-S7/inter.c b/B-Tech-S7/inter.c new file mode 100644 index 0000000..117813a --- /dev/null +++ b/B-Tech-S7/inter.c @@ -0,0 +1,53 @@ +#include +#include + +int i = 0, j = 0, k, t = 1; +char str[50], final[10], temp1[5], temp2[5], operator; + +void main() +{ + puts("Enter the string"); + gets(str); + while (str[i] != '\0' && str[i] != '=') + { + final[i] = str[i]; + i++; + } + k = i + 1; + i = 0; + while (str[k] != '\0' && str[k] != '+' && str[k] != '-' && str[k] != '*' && str[k] != '/') + { + temp1[i] = str[k]; + i++; + k++; + } + operator= str[k]; + k++; + i = 0; + while (str[k] != '\0' && str[k] != '+' && str[k] != '-' && str[k] != '*' && str[k] != '/') + { + temp2[i] = str[k]; + i++; + k++; + } + printf("t1 = %s %c %s\n", temp1, operator, temp2); + + while (str[k] != '\0') + { + for (j = 0; j < 10; j++) + { + temp2[j] = '\0'; + } + operator= str[k]; + k++; + i = 0; + while (str[k] != '\0' && str[k] != '+' && str[k] != '-' && str[k] != '*' && str[k] != '/') + { + temp2[i] = str[k]; + i++; + k++; + } + printf("t%d = t%d %c %s\n", t + 1, t, operator, temp2); + t++; + } +} \ No newline at end of file diff --git a/B-Tech-S7/shiftReduce.c b/B-Tech-S7/shiftReduce.c deleted file mode 100644 index 10b222c..0000000 --- a/B-Tech-S7/shiftReduce.c +++ /dev/null @@ -1,2 +0,0 @@ -#include - From cd6f2e3ccd0799dd3d955e34dd37303110c11bef Mon Sep 17 00:00:00 2001 From: cslab8282 Date: Tue, 3 Oct 2023 11:04:05 +0530 Subject: [PATCH 07/11] wp lab --- B-Tech-S7/WP/assignment.html | 0 B-Tech-S7/WP/embed.html | 23 ++++++++ B-Tech-S7/WP/index.html | 32 ++++++++++ B-Tech-S7/chatInter.c | 110 +++++++++++++++++++++++++++++++++++ 4 files changed, 165 insertions(+) create mode 100644 B-Tech-S7/WP/assignment.html create mode 100644 B-Tech-S7/WP/embed.html create mode 100644 B-Tech-S7/WP/index.html create mode 100644 B-Tech-S7/chatInter.c diff --git a/B-Tech-S7/WP/assignment.html b/B-Tech-S7/WP/assignment.html new file mode 100644 index 0000000..e69de29 diff --git a/B-Tech-S7/WP/embed.html b/B-Tech-S7/WP/embed.html new file mode 100644 index 0000000..8b168db --- /dev/null +++ b/B-Tech-S7/WP/embed.html @@ -0,0 +1,23 @@ + + + + + + embed + + + + + \ No newline at end of file diff --git a/B-Tech-S7/WP/index.html b/B-Tech-S7/WP/index.html new file mode 100644 index 0000000..5be3f06 --- /dev/null +++ b/B-Tech-S7/WP/index.html @@ -0,0 +1,32 @@ + + + + + + web programming + + +
+ + + +
+ + + + \ No newline at end of file diff --git a/B-Tech-S7/chatInter.c b/B-Tech-S7/chatInter.c new file mode 100644 index 0000000..364a634 --- /dev/null +++ b/B-Tech-S7/chatInter.c @@ -0,0 +1,110 @@ +#include +#include + +int i = 0, j = 0, k = 0, t = 1; +char str[50], final[10], temp1[5], temp2[5], operator; +char stack[50]; // Stack to handle operator precedence and parentheses +int top = -1; + +void push(char op) { + top++; + stack[top] = op; +} + +char pop() { + if (top == -1) return '\0'; // Empty stack + char op = stack[top]; + top--; + return op; +} + +int precedence(char op) { + if (op == '+' || op == '-') return 1; + if (op == '*' || op == '/') return 2; + return 0; // for '(' +} + +void generateIntermediateCode(char op) { + char op2 = pop(); + char op1 = pop(); + printf("t%d = t%d %c t%d\n", t, t - 1, op2, t - 2); + t++; + push(op); +} + +int main() { + puts("Enter the string"); + gets(str); + while (str[i] != '\0' && str[i] != '=') + { + final[i] = str[i]; + i++; + } + k = i + 1; + i = 0; + while (str[k] != '\0' && str[k] != '+' && str[k] != '-' && str[k] != '*' && str[k] != '/') + { + temp1[i] = str[k]; + i++; + k++; + } + push('='); // Push '=' onto the stack to ensure proper precedence handling + operator = str[k]; + k++; + i = 0; + while (str[k] != '\0') + { + for (j = 0; j < 10; j++) + { + temp2[j] = '\0'; + } + if (str[k] == '(') + { + push('('); // Push '(' onto the stack + k++; + } + else if (str[k] == ')') + { + while (top != -1 && stack[top] != '(') + { + generateIntermediateCode(pop()); + } + if (top == -1) { + printf("Invalid expression: Mismatched parentheses\n"); + break; // Terminate the loop + } + pop(); // Pop '(' from the stack + k++; + } + else if (str[k] == '+' || str[k] == '-' || str[k] == '*' || str[k] == '/') + { + while (top != -1 && precedence(stack[top]) >= precedence(str[k])) + { + generateIntermediateCode(pop()); + } + push(str[k]); + k++; + } + else + { + i = 0; + while (str[k] != '\0' && str[k] != '+' && str[k] != '-' && str[k] != '*' && str[k] != '/' && str[k] != ')') + { + temp2[i] = str[k]; + i++; + k++; + } + printf("t%d = %s\n", t, temp2); + t++; + } + } + while (top != -1) + { + if (stack[top] == '(') { + printf("Invalid expression: Mismatched parentheses\n"); + break; + } + generateIntermediateCode(pop()); + } + return 0; +} \ No newline at end of file From 31e63daab4adbac01492430f6730131eab3b4e9f Mon Sep 17 00:00:00 2001 From: cslab8282 Date: Tue, 3 Oct 2023 12:08:38 +0530 Subject: [PATCH 08/11] assignment --- B-Tech-S7/WP/assignment.html | 0 B-Tech-S7/WP/form.html | 35 ++++++++++++++++++++++++++++ B-Tech-S7/WP/table.html | 45 ++++++++++++++++++++++++++++++++++++ 3 files changed, 80 insertions(+) delete mode 100644 B-Tech-S7/WP/assignment.html create mode 100644 B-Tech-S7/WP/form.html create mode 100644 B-Tech-S7/WP/table.html diff --git a/B-Tech-S7/WP/assignment.html b/B-Tech-S7/WP/assignment.html deleted file mode 100644 index e69de29..0000000 diff --git a/B-Tech-S7/WP/form.html b/B-Tech-S7/WP/form.html new file mode 100644 index 0000000..f0a6df9 --- /dev/null +++ b/B-Tech-S7/WP/form.html @@ -0,0 +1,35 @@ + + + + + + Form + + +
+ + + +
+ + + +
+ +
+ + + +
+ + + + +
+ + \ No newline at end of file diff --git a/B-Tech-S7/WP/table.html b/B-Tech-S7/WP/table.html new file mode 100644 index 0000000..602024d --- /dev/null +++ b/B-Tech-S7/WP/table.html @@ -0,0 +1,45 @@ + + + + + + Assignment + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Food ItemRecommended Intake
age<15age>15
gmKcalgmKcal
Cerials100020007501760
NonCerials450800350600
+ + \ No newline at end of file From 2f422c88f9588b5a94998391a962657b3f894ba7 Mon Sep 17 00:00:00 2001 From: cslab8282 <142578329+cslab8282@users.noreply.github.com> Date: Sat, 7 Oct 2023 11:26:52 +0530 Subject: [PATCH 09/11] Add files via upload --- B-Tech-S7/inter.c | 167 +++++++++++++++++++++++++++++++++------------- 1 file changed, 119 insertions(+), 48 deletions(-) diff --git a/B-Tech-S7/inter.c b/B-Tech-S7/inter.c index 117813a..b2c4d18 100644 --- a/B-Tech-S7/inter.c +++ b/B-Tech-S7/inter.c @@ -1,53 +1,124 @@ -#include -#include +#include +//#include +#include -int i = 0, j = 0, k, t = 1; -char str[50], final[10], temp1[5], temp2[5], operator; +int i=1,j=0,no=0,tmpch=90; +char str[100],left[15],right[15]; +void findopr(); +int explore(); +void fleft(int); +void fright(int); + +struct exp +{ + int pos; + char op; +}k[15]; void main() { - puts("Enter the string"); - gets(str); - while (str[i] != '\0' && str[i] != '=') - { - final[i] = str[i]; - i++; - } - k = i + 1; - i = 0; - while (str[k] != '\0' && str[k] != '+' && str[k] != '-' && str[k] != '*' && str[k] != '/') - { - temp1[i] = str[k]; - i++; - k++; - } - operator= str[k]; - k++; - i = 0; - while (str[k] != '\0' && str[k] != '+' && str[k] != '-' && str[k] != '*' && str[k] != '/') - { - temp2[i] = str[k]; - i++; - k++; - } - printf("t1 = %s %c %s\n", temp1, operator, temp2); + printf("\t\tINTERMEDIATE CODE GENERATION\n\n"); + printf("Enter the Expression :"); + scanf("%s",str); + printf("The intermediate code:\t\tExpression\n"); + findopr(); + explore(); + //getch(); +} - while (str[k] != '\0') - { - for (j = 0; j < 10; j++) - { - temp2[j] = '\0'; - } - operator= str[k]; - k++; - i = 0; - while (str[k] != '\0' && str[k] != '+' && str[k] != '-' && str[k] != '*' && str[k] != '/') - { - temp2[i] = str[k]; - i++; - k++; - } - printf("t%d = t%d %c %s\n", t + 1, t, operator, temp2); - t++; - } -} \ No newline at end of file +void findopr() +{ + for(i=0;str[i]!='\0';i++) + if(str[i]=='=') + { + k[j].pos=i; + k[j++].op=':'; + } + for(i=0;str[i]!='\0';i++) + if(str[i]=='/') + { + k[j].pos=i; + k[j++].op='/'; + } + for(i=0;str[i]!='\0';i++) + if(str[i]=='*') + { + k[j].pos=i; + k[j++].op='*'; + } + for(i=0;str[i]!='\0';i++) + if(str[i]=='+') + { + k[j].pos=i; + k[j++].op='+'; + } + for(i=0;str[i]!='\0';i++) + if(str[i]=='-') + { + k[j].pos=i; + k[j++].op='-'; + } +} + +//void explore() +int explore() +{ + i=1; + while(k[i].op!='\0') + { + fleft(k[i].pos); + fright(k[i].pos); + str[k[i].pos]=tmpch--; + printf("\t%c := %s%c%s\t\t",str[k[i].pos],left,k[i].op,right); + for(j=0;j Date: Sat, 7 Oct 2023 12:07:45 +0530 Subject: [PATCH 10/11] lex prgm --- B-Tech-S7/WP/form.html | 6 +- B-Tech-S7/WP/table.html | 4 +- B-Tech-S7/lex.yy.c | 1751 +++++++++++++++++++++++++++++++++++++++ B-Tech-S7/test.l | 19 + 4 files changed, 1775 insertions(+), 5 deletions(-) create mode 100644 B-Tech-S7/lex.yy.c create mode 100644 B-Tech-S7/test.l diff --git a/B-Tech-S7/WP/form.html b/B-Tech-S7/WP/form.html index f0a6df9..65c2fc1 100644 --- a/B-Tech-S7/WP/form.html +++ b/B-Tech-S7/WP/form.html @@ -22,10 +22,10 @@ - + - + diff --git a/B-Tech-S7/WP/table.html b/B-Tech-S7/WP/table.html index 602024d..064986a 100644 --- a/B-Tech-S7/WP/table.html +++ b/B-Tech-S7/WP/table.html @@ -7,8 +7,8 @@ diff --git a/B-Tech-S7/lex.yy.c b/B-Tech-S7/lex.yy.c new file mode 100644 index 0000000..0f6bac7 --- /dev/null +++ b/B-Tech-S7/lex.yy.c @@ -0,0 +1,1751 @@ + +#line 3 "lex.yy.c" + +#define YY_INT_ALIGNED short int + +/* A lexical scanner generated by flex */ + +#define FLEX_SCANNER +#define YY_FLEX_MAJOR_VERSION 2 +#define YY_FLEX_MINOR_VERSION 6 +#define YY_FLEX_SUBMINOR_VERSION 4 +#if YY_FLEX_SUBMINOR_VERSION > 0 +#define FLEX_BETA +#endif + +/* First, we deal with platform-specific or compiler-specific issues. */ + +/* begin standard C headers. */ +#include +#include +#include +#include + +/* end standard C headers. */ + +/* flex integer type definitions */ + +#ifndef FLEXINT_H +#define FLEXINT_H + +/* C99 systems have . Non-C99 systems may or may not. */ + +#if defined (__STDC_VERSION__) && __STDC_VERSION__ >= 199901L + +/* C99 says to define __STDC_LIMIT_MACROS before including stdint.h, + * if you want the limit (max/min) macros for int types. + */ +#ifndef __STDC_LIMIT_MACROS +#define __STDC_LIMIT_MACROS 1 +#endif + +#include +typedef int8_t flex_int8_t; +typedef uint8_t flex_uint8_t; +typedef int16_t flex_int16_t; +typedef uint16_t flex_uint16_t; +typedef int32_t flex_int32_t; +typedef uint32_t flex_uint32_t; +#else +typedef signed char flex_int8_t; +typedef short int flex_int16_t; +typedef int flex_int32_t; +typedef unsigned char flex_uint8_t; +typedef unsigned short int flex_uint16_t; +typedef unsigned int flex_uint32_t; + +/* Limits of integral types. */ +#ifndef INT8_MIN +#define INT8_MIN (-128) +#endif +#ifndef INT16_MIN +#define INT16_MIN (-32767-1) +#endif +#ifndef INT32_MIN +#define INT32_MIN (-2147483647-1) +#endif +#ifndef INT8_MAX +#define INT8_MAX (127) +#endif +#ifndef INT16_MAX +#define INT16_MAX (32767) +#endif +#ifndef INT32_MAX +#define INT32_MAX (2147483647) +#endif +#ifndef UINT8_MAX +#define UINT8_MAX (255U) +#endif +#ifndef UINT16_MAX +#define UINT16_MAX (65535U) +#endif +#ifndef UINT32_MAX +#define UINT32_MAX (4294967295U) +#endif + +#ifndef SIZE_MAX +#define SIZE_MAX (~(size_t)0) +#endif + +#endif /* ! C99 */ + +#endif /* ! FLEXINT_H */ + +/* begin standard C++ headers. */ + +/* TODO: this is always defined, so inline it */ +#define yyconst const + +#if defined(__GNUC__) && __GNUC__ >= 3 +#define yynoreturn __attribute__((__noreturn__)) +#else +#define yynoreturn +#endif + +/* Returned upon end-of-file. */ +#define YY_NULL 0 + +/* Promotes a possibly negative, possibly signed char to an + * integer in range [0..255] for use as an array index. + */ +#define YY_SC_TO_UI(c) ((YY_CHAR) (c)) + +/* Enter a start condition. This macro really ought to take a parameter, + * but we do it the disgusting crufty way forced on us by the ()-less + * definition of BEGIN. + */ +#define BEGIN (yy_start) = 1 + 2 * +/* Translate the current start state into a value that can be later handed + * to BEGIN to return to the state. The YYSTATE alias is for lex + * compatibility. + */ +#define YY_START (((yy_start) - 1) / 2) +#define YYSTATE YY_START +/* Action number for EOF rule of a given start state. */ +#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) +/* Special action meaning "start processing a new file". */ +#define YY_NEW_FILE yyrestart( yyin ) +#define YY_END_OF_BUFFER_CHAR 0 + +/* Size of default input buffer. */ +#ifndef YY_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k. + * Moreover, YY_BUF_SIZE is 2*YY_READ_BUF_SIZE in the general case. + * Ditto for the __ia64__ case accordingly. + */ +#define YY_BUF_SIZE 32768 +#else +#define YY_BUF_SIZE 16384 +#endif /* __ia64__ */ +#endif + +/* The state buf must be large enough to hold one state per character in the main buffer. + */ +#define YY_STATE_BUF_SIZE ((YY_BUF_SIZE + 2) * sizeof(yy_state_type)) + +#ifndef YY_TYPEDEF_YY_BUFFER_STATE +#define YY_TYPEDEF_YY_BUFFER_STATE +typedef struct yy_buffer_state *YY_BUFFER_STATE; +#endif + +#ifndef YY_TYPEDEF_YY_SIZE_T +#define YY_TYPEDEF_YY_SIZE_T +typedef size_t yy_size_t; +#endif + +extern int yyleng; + +extern FILE *yyin, *yyout; + +#define EOB_ACT_CONTINUE_SCAN 0 +#define EOB_ACT_END_OF_FILE 1 +#define EOB_ACT_LAST_MATCH 2 + + #define YY_LESS_LINENO(n) + #define YY_LINENO_REWIND_TO(ptr) + +/* Return all but the first "n" matched characters back to the input stream. */ +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + *yy_cp = (yy_hold_char); \ + YY_RESTORE_YY_MORE_OFFSET \ + (yy_c_buf_p) = yy_cp = yy_bp + yyless_macro_arg - YY_MORE_ADJ; \ + YY_DO_BEFORE_ACTION; /* set up yytext again */ \ + } \ + while ( 0 ) +#define unput(c) yyunput( c, (yytext_ptr) ) + +#ifndef YY_STRUCT_YY_BUFFER_STATE +#define YY_STRUCT_YY_BUFFER_STATE +struct yy_buffer_state + { + FILE *yy_input_file; + + char *yy_ch_buf; /* input buffer */ + char *yy_buf_pos; /* current position in input buffer */ + + /* Size of input buffer in bytes, not including room for EOB + * characters. + */ + int yy_buf_size; + + /* Number of characters read into yy_ch_buf, not including EOB + * characters. + */ + int yy_n_chars; + + /* Whether we "own" the buffer - i.e., we know we created it, + * and can realloc() it to grow it, and should free() it to + * delete it. + */ + int yy_is_our_buffer; + + /* Whether this is an "interactive" input source; if so, and + * if we're using stdio for input, then we want to use getc() + * instead of fread(), to make sure we stop fetching input after + * each newline. + */ + int yy_is_interactive; + + /* Whether we're considered to be at the beginning of a line. + * If so, '^' rules will be active on the next match, otherwise + * not. + */ + int yy_at_bol; + + int yy_bs_lineno; /**< The line count. */ + int yy_bs_column; /**< The column count. */ + + /* Whether to try to fill the input buffer when we reach the + * end of it. + */ + int yy_fill_buffer; + + int yy_buffer_status; + +#define YY_BUFFER_NEW 0 +#define YY_BUFFER_NORMAL 1 + /* When an EOF's been seen but there's still some text to process + * then we mark the buffer as YY_EOF_PENDING, to indicate that we + * shouldn't try reading from the input source any more. We might + * still have a bunch of tokens to match, though, because of + * possible backing-up. + * + * When we actually see the EOF, we change the status to "new" + * (via yyrestart()), so that the user can continue scanning by + * just pointing yyin at a new input file. + */ +#define YY_BUFFER_EOF_PENDING 2 + + }; +#endif /* !YY_STRUCT_YY_BUFFER_STATE */ + +/* Stack of input buffers. */ +static size_t yy_buffer_stack_top = 0; /**< index of top of stack. */ +static size_t yy_buffer_stack_max = 0; /**< capacity of stack. */ +static YY_BUFFER_STATE * yy_buffer_stack = NULL; /**< Stack as an array. */ + +/* We provide macros for accessing buffer states in case in the + * future we want to put the buffer states in a more general + * "scanner state". + * + * Returns the top of the stack, or NULL. + */ +#define YY_CURRENT_BUFFER ( (yy_buffer_stack) \ + ? (yy_buffer_stack)[(yy_buffer_stack_top)] \ + : NULL) +/* Same as previous macro, but useful when we know that the buffer stack is not + * NULL or when we need an lvalue. For internal use only. + */ +#define YY_CURRENT_BUFFER_LVALUE (yy_buffer_stack)[(yy_buffer_stack_top)] + +/* yy_hold_char holds the character lost when yytext is formed. */ +static char yy_hold_char; +static int yy_n_chars; /* number of characters read into yy_ch_buf */ +int yyleng; + +/* Points to current character in buffer. */ +static char *yy_c_buf_p = NULL; +static int yy_init = 0; /* whether we need to initialize */ +static int yy_start = 0; /* start state number */ + +/* Flag which is used to allow yywrap()'s to do buffer switches + * instead of setting up a fresh yyin. A bit of a hack ... + */ +static int yy_did_buffer_switch_on_eof; + +void yyrestart ( FILE *input_file ); +void yy_switch_to_buffer ( YY_BUFFER_STATE new_buffer ); +YY_BUFFER_STATE yy_create_buffer ( FILE *file, int size ); +void yy_delete_buffer ( YY_BUFFER_STATE b ); +void yy_flush_buffer ( YY_BUFFER_STATE b ); +void yypush_buffer_state ( YY_BUFFER_STATE new_buffer ); +void yypop_buffer_state ( void ); + +static void yyensure_buffer_stack ( void ); +static void yy_load_buffer_state ( void ); +static void yy_init_buffer ( YY_BUFFER_STATE b, FILE *file ); +#define YY_FLUSH_BUFFER yy_flush_buffer( YY_CURRENT_BUFFER ) + +YY_BUFFER_STATE yy_scan_buffer ( char *base, yy_size_t size ); +YY_BUFFER_STATE yy_scan_string ( const char *yy_str ); +YY_BUFFER_STATE yy_scan_bytes ( const char *bytes, int len ); + +void *yyalloc ( yy_size_t ); +void *yyrealloc ( void *, yy_size_t ); +void yyfree ( void * ); + +#define yy_new_buffer yy_create_buffer +#define yy_set_interactive(is_interactive) \ + { \ + if ( ! YY_CURRENT_BUFFER ){ \ + yyensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + yy_create_buffer( yyin, YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_is_interactive = is_interactive; \ + } +#define yy_set_bol(at_bol) \ + { \ + if ( ! YY_CURRENT_BUFFER ){\ + yyensure_buffer_stack (); \ + YY_CURRENT_BUFFER_LVALUE = \ + yy_create_buffer( yyin, YY_BUF_SIZE ); \ + } \ + YY_CURRENT_BUFFER_LVALUE->yy_at_bol = at_bol; \ + } +#define YY_AT_BOL() (YY_CURRENT_BUFFER_LVALUE->yy_at_bol) + +/* Begin user sect3 */ +typedef flex_uint8_t YY_CHAR; + +FILE *yyin = NULL, *yyout = NULL; + +typedef int yy_state_type; + +extern int yylineno; +int yylineno = 1; + +extern char *yytext; +#ifdef yytext_ptr +#undef yytext_ptr +#endif +#define yytext_ptr yytext + +static yy_state_type yy_get_previous_state ( void ); +static yy_state_type yy_try_NUL_trans ( yy_state_type current_state ); +static int yy_get_next_buffer ( void ); +static void yynoreturn yy_fatal_error ( const char* msg ); + +/* Done after the current pattern has been matched and before the + * corresponding action - sets up yytext. + */ +#define YY_DO_BEFORE_ACTION \ + (yytext_ptr) = yy_bp; \ + yyleng = (int) (yy_cp - yy_bp); \ + (yy_hold_char) = *yy_cp; \ + *yy_cp = '\0'; \ + (yy_c_buf_p) = yy_cp; +#define YY_NUM_RULES 3 +#define YY_END_OF_BUFFER 4 +/* This struct is not used in this scanner, + but its presence is necessary. */ +struct yy_trans_info + { + flex_int32_t yy_verify; + flex_int32_t yy_nxt; + }; +static const flex_int16_t yy_accept[8] = + { 0, + 0, 0, 4, 3, 1, 2, 0 + } ; + +static const YY_CHAR yy_ec[256] = + { 0, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 2, 3, 3, 3, 2, 3, + 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, + 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, + 1, 1, 1, 1, 1, 1, 2, 3, 3, 3, + + 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, + 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, + 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1 + } ; + +static const YY_CHAR yy_meta[4] = + { 0, + 1, 1, 1 + } ; + +static const flex_int16_t yy_base[8] = + { 0, + 0, 0, 4, 5, 5, 5, 5 + } ; + +static const flex_int16_t yy_def[8] = + { 0, + 7, 1, 7, 7, 7, 7, 0 + } ; + +static const flex_int16_t yy_nxt[9] = + { 0, + 4, 5, 6, 7, 3, 7, 7, 7 + } ; + +static const flex_int16_t yy_chk[9] = + { 0, + 1, 1, 1, 3, 7, 7, 7, 7 + } ; + +static yy_state_type yy_last_accepting_state; +static char *yy_last_accepting_cpos; + +extern int yy_flex_debug; +int yy_flex_debug = 0; + +/* The intent behind this definition is that it'll catch + * any uses of REJECT which flex missed. + */ +#define REJECT reject_used_but_not_detected +#define yymore() yymore_used_but_not_detected +#define YY_MORE_ADJ 0 +#define YY_RESTORE_YY_MORE_OFFSET +char *yytext; +#line 1 "test.l" +#line 2 "test.l" + int v=0,c=0; +#line 443 "lex.yy.c" +#line 444 "lex.yy.c" + +#define INITIAL 0 + +#ifndef YY_NO_UNISTD_H +/* Special case for "unistd.h", since it is non-ANSI. We include it way + * down here because we want the user's section 1 to have been scanned first. + * The user has a chance to override it with an option. + */ +#include +#endif + +#ifndef YY_EXTRA_TYPE +#define YY_EXTRA_TYPE void * +#endif + +static int yy_init_globals ( void ); + +/* Accessor methods to globals. + These are made visible to non-reentrant scanners for convenience. */ + +int yylex_destroy ( void ); + +int yyget_debug ( void ); + +void yyset_debug ( int debug_flag ); + +YY_EXTRA_TYPE yyget_extra ( void ); + +void yyset_extra ( YY_EXTRA_TYPE user_defined ); + +FILE *yyget_in ( void ); + +void yyset_in ( FILE * _in_str ); + +FILE *yyget_out ( void ); + +void yyset_out ( FILE * _out_str ); + + int yyget_leng ( void ); + +char *yyget_text ( void ); + +int yyget_lineno ( void ); + +void yyset_lineno ( int _line_number ); + +/* Macros after this point can all be overridden by user definitions in + * section 1. + */ + +#ifndef YY_SKIP_YYWRAP +#ifdef __cplusplus +extern "C" int yywrap ( void ); +#else +extern int yywrap ( void ); +#endif +#endif + +#ifndef YY_NO_UNPUT + + static void yyunput ( int c, char *buf_ptr ); + +#endif + +#ifndef yytext_ptr +static void yy_flex_strncpy ( char *, const char *, int ); +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen ( const char * ); +#endif + +#ifndef YY_NO_INPUT +#ifdef __cplusplus +static int yyinput ( void ); +#else +static int input ( void ); +#endif + +#endif + +/* Amount of stuff to slurp up with each read. */ +#ifndef YY_READ_BUF_SIZE +#ifdef __ia64__ +/* On IA-64, the buffer size is 16k, not 8k */ +#define YY_READ_BUF_SIZE 16384 +#else +#define YY_READ_BUF_SIZE 8192 +#endif /* __ia64__ */ +#endif + +/* Copy whatever the last rule matched to the standard output. */ +#ifndef ECHO +/* This used to be an fputs(), but since the string might contain NUL's, + * we now use fwrite(). + */ +#define ECHO do { if (fwrite( yytext, (size_t) yyleng, 1, yyout )) {} } while (0) +#endif + +/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, + * is returned in "result". + */ +#ifndef YY_INPUT +#define YY_INPUT(buf,result,max_size) \ + if ( YY_CURRENT_BUFFER_LVALUE->yy_is_interactive ) \ + { \ + int c = '*'; \ + int n; \ + for ( n = 0; n < max_size && \ + (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ + buf[n] = (char) c; \ + if ( c == '\n' ) \ + buf[n++] = (char) c; \ + if ( c == EOF && ferror( yyin ) ) \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + result = n; \ + } \ + else \ + { \ + errno=0; \ + while ( (result = (int) fread(buf, 1, (yy_size_t) max_size, yyin)) == 0 && ferror(yyin)) \ + { \ + if( errno != EINTR) \ + { \ + YY_FATAL_ERROR( "input in flex scanner failed" ); \ + break; \ + } \ + errno=0; \ + clearerr(yyin); \ + } \ + }\ +\ + +#endif + +/* No semi-colon after return; correct usage is to write "yyterminate();" - + * we don't want an extra ';' after the "return" because that will cause + * some compilers to complain about unreachable statements. + */ +#ifndef yyterminate +#define yyterminate() return YY_NULL +#endif + +/* Number of entries by which start-condition stack grows. */ +#ifndef YY_START_STACK_INCR +#define YY_START_STACK_INCR 25 +#endif + +/* Report a fatal error. */ +#ifndef YY_FATAL_ERROR +#define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) +#endif + +/* end tables serialization structures and prototypes */ + +/* Default declaration of generated scanner - a define so the user can + * easily add parameters. + */ +#ifndef YY_DECL +#define YY_DECL_IS_OURS 1 + +extern int yylex (void); + +#define YY_DECL int yylex (void) +#endif /* !YY_DECL */ + +/* Code executed at the beginning of each rule, after yytext and yyleng + * have been set up. + */ +#ifndef YY_USER_ACTION +#define YY_USER_ACTION +#endif + +/* Code executed at the end of each rule. */ +#ifndef YY_BREAK +#define YY_BREAK /*LINTED*/break; +#endif + +#define YY_RULE_SETUP \ + YY_USER_ACTION + +/** The main scanner function which does all the work. + */ +YY_DECL +{ + yy_state_type yy_current_state; + char *yy_cp, *yy_bp; + int yy_act; + + if ( !(yy_init) ) + { + (yy_init) = 1; + +#ifdef YY_USER_INIT + YY_USER_INIT; +#endif + + if ( ! (yy_start) ) + (yy_start) = 1; /* first start state */ + + if ( ! yyin ) + yyin = stdin; + + if ( ! yyout ) + yyout = stdout; + + if ( ! YY_CURRENT_BUFFER ) { + yyensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + yy_create_buffer( yyin, YY_BUF_SIZE ); + } + + yy_load_buffer_state( ); + } + + { +#line 5 "test.l" + +#line 663 "lex.yy.c" + + while ( /*CONSTCOND*/1 ) /* loops until end-of-file is reached */ + { + yy_cp = (yy_c_buf_p); + + /* Support of yytext. */ + *yy_cp = (yy_hold_char); + + /* yy_bp points to the position in yy_ch_buf of the start of + * the current run. + */ + yy_bp = yy_cp; + + yy_current_state = (yy_start); +yy_match: + do + { + YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)] ; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 8 ) + yy_c = yy_meta[yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; + ++yy_cp; + } + while ( yy_base[yy_current_state] != 5 ); + +yy_find_action: + yy_act = yy_accept[yy_current_state]; + if ( yy_act == 0 ) + { /* have to back up */ + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + yy_act = yy_accept[yy_current_state]; + } + + YY_DO_BEFORE_ACTION; + +do_action: /* This label is used only to access EOF actions. */ + + switch ( yy_act ) + { /* beginning of action switch */ + case 0: /* must back up */ + /* undo the effects of YY_DO_BEFORE_ACTION */ + *yy_cp = (yy_hold_char); + yy_cp = (yy_last_accepting_cpos); + yy_current_state = (yy_last_accepting_state); + goto yy_find_action; + +case 1: +YY_RULE_SETUP +#line 6 "test.l" +{v++;} + YY_BREAK +case 2: +YY_RULE_SETUP +#line 7 "test.l" +{c++;} + YY_BREAK +case 3: +YY_RULE_SETUP +#line 8 "test.l" +ECHO; + YY_BREAK +#line 735 "lex.yy.c" +case YY_STATE_EOF(INITIAL): + yyterminate(); + + case YY_END_OF_BUFFER: + { + /* Amount of text matched not including the EOB char. */ + int yy_amount_of_matched_text = (int) (yy_cp - (yytext_ptr)) - 1; + + /* Undo the effects of YY_DO_BEFORE_ACTION. */ + *yy_cp = (yy_hold_char); + YY_RESTORE_YY_MORE_OFFSET + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_NEW ) + { + /* We're scanning a new file or input source. It's + * possible that this happened because the user + * just pointed yyin at a new source and called + * yylex(). If so, then we have to assure + * consistency between YY_CURRENT_BUFFER and our + * globals. Here is the right place to do so, because + * this is the first action (other than possibly a + * back-up) that will match for the new input source. + */ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + YY_CURRENT_BUFFER_LVALUE->yy_input_file = yyin; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = YY_BUFFER_NORMAL; + } + + /* Note that here we test for yy_c_buf_p "<=" to the position + * of the first EOB in the buffer, since yy_c_buf_p will + * already have been incremented past the NUL character + * (since all states make transitions on EOB to the + * end-of-buffer state). Contrast this with the test + * in input(). + */ + if ( (yy_c_buf_p) <= &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) + { /* This was really a NUL. */ + yy_state_type yy_next_state; + + (yy_c_buf_p) = (yytext_ptr) + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( ); + + /* Okay, we're now positioned to make the NUL + * transition. We couldn't have + * yy_get_previous_state() go ahead and do it + * for us because it doesn't know how to deal + * with the possibility of jamming (and we don't + * want to build jamming into it because then it + * will run more slowly). + */ + + yy_next_state = yy_try_NUL_trans( yy_current_state ); + + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + + if ( yy_next_state ) + { + /* Consume the NUL. */ + yy_cp = ++(yy_c_buf_p); + yy_current_state = yy_next_state; + goto yy_match; + } + + else + { + yy_cp = (yy_c_buf_p); + goto yy_find_action; + } + } + + else switch ( yy_get_next_buffer( ) ) + { + case EOB_ACT_END_OF_FILE: + { + (yy_did_buffer_switch_on_eof) = 0; + + if ( yywrap( ) ) + { + /* Note: because we've taken care in + * yy_get_next_buffer() to have set up + * yytext, we can now set up + * yy_c_buf_p so that if some total + * hoser (like flex itself) wants to + * call the scanner after we return the + * YY_NULL, it'll still work - another + * YY_NULL will get returned. + */ + (yy_c_buf_p) = (yytext_ptr) + YY_MORE_ADJ; + + yy_act = YY_STATE_EOF(YY_START); + goto do_action; + } + + else + { + if ( ! (yy_did_buffer_switch_on_eof) ) + YY_NEW_FILE; + } + break; + } + + case EOB_ACT_CONTINUE_SCAN: + (yy_c_buf_p) = + (yytext_ptr) + yy_amount_of_matched_text; + + yy_current_state = yy_get_previous_state( ); + + yy_cp = (yy_c_buf_p); + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + goto yy_match; + + case EOB_ACT_LAST_MATCH: + (yy_c_buf_p) = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)]; + + yy_current_state = yy_get_previous_state( ); + + yy_cp = (yy_c_buf_p); + yy_bp = (yytext_ptr) + YY_MORE_ADJ; + goto yy_find_action; + } + break; + } + + default: + YY_FATAL_ERROR( + "fatal flex scanner internal error--no action found" ); + } /* end of action switch */ + } /* end of scanning one token */ + } /* end of user's declarations */ +} /* end of yylex */ + +/* yy_get_next_buffer - try to read in a new buffer + * + * Returns a code representing an action: + * EOB_ACT_LAST_MATCH - + * EOB_ACT_CONTINUE_SCAN - continue scanning from current position + * EOB_ACT_END_OF_FILE - end of file + */ +static int yy_get_next_buffer (void) +{ + char *dest = YY_CURRENT_BUFFER_LVALUE->yy_ch_buf; + char *source = (yytext_ptr); + int number_to_move, i; + int ret_val; + + if ( (yy_c_buf_p) > &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] ) + YY_FATAL_ERROR( + "fatal flex scanner internal error--end of buffer missed" ); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_fill_buffer == 0 ) + { /* Don't try to fill the buffer, so this is an EOF. */ + if ( (yy_c_buf_p) - (yytext_ptr) - YY_MORE_ADJ == 1 ) + { + /* We matched a single character, the EOB, so + * treat this as a final EOF. + */ + return EOB_ACT_END_OF_FILE; + } + + else + { + /* We matched some text prior to the EOB, first + * process it. + */ + return EOB_ACT_LAST_MATCH; + } + } + + /* Try to read more data. */ + + /* First move last chars to start of buffer. */ + number_to_move = (int) ((yy_c_buf_p) - (yytext_ptr) - 1); + + for ( i = 0; i < number_to_move; ++i ) + *(dest++) = *(source++); + + if ( YY_CURRENT_BUFFER_LVALUE->yy_buffer_status == YY_BUFFER_EOF_PENDING ) + /* don't do the read, it's not guaranteed to return an EOF, + * just force an EOF + */ + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars) = 0; + + else + { + int num_to_read = + YY_CURRENT_BUFFER_LVALUE->yy_buf_size - number_to_move - 1; + + while ( num_to_read <= 0 ) + { /* Not enough room in the buffer - grow it. */ + + /* just a shorter name for the current buffer */ + YY_BUFFER_STATE b = YY_CURRENT_BUFFER_LVALUE; + + int yy_c_buf_p_offset = + (int) ((yy_c_buf_p) - b->yy_ch_buf); + + if ( b->yy_is_our_buffer ) + { + int new_size = b->yy_buf_size * 2; + + if ( new_size <= 0 ) + b->yy_buf_size += b->yy_buf_size / 8; + else + b->yy_buf_size *= 2; + + b->yy_ch_buf = (char *) + /* Include room in for 2 EOB chars. */ + yyrealloc( (void *) b->yy_ch_buf, + (yy_size_t) (b->yy_buf_size + 2) ); + } + else + /* Can't grow it, we don't own it. */ + b->yy_ch_buf = NULL; + + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( + "fatal error - scanner input buffer overflow" ); + + (yy_c_buf_p) = &b->yy_ch_buf[yy_c_buf_p_offset]; + + num_to_read = YY_CURRENT_BUFFER_LVALUE->yy_buf_size - + number_to_move - 1; + + } + + if ( num_to_read > YY_READ_BUF_SIZE ) + num_to_read = YY_READ_BUF_SIZE; + + /* Read in more data. */ + YY_INPUT( (&YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]), + (yy_n_chars), num_to_read ); + + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + if ( (yy_n_chars) == 0 ) + { + if ( number_to_move == YY_MORE_ADJ ) + { + ret_val = EOB_ACT_END_OF_FILE; + yyrestart( yyin ); + } + + else + { + ret_val = EOB_ACT_LAST_MATCH; + YY_CURRENT_BUFFER_LVALUE->yy_buffer_status = + YY_BUFFER_EOF_PENDING; + } + } + + else + ret_val = EOB_ACT_CONTINUE_SCAN; + + if (((yy_n_chars) + number_to_move) > YY_CURRENT_BUFFER_LVALUE->yy_buf_size) { + /* Extend the array by 50%, plus the number we really need. */ + int new_size = (yy_n_chars) + number_to_move + ((yy_n_chars) >> 1); + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf = (char *) yyrealloc( + (void *) YY_CURRENT_BUFFER_LVALUE->yy_ch_buf, (yy_size_t) new_size ); + if ( ! YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_get_next_buffer()" ); + /* "- 2" to take care of EOB's */ + YY_CURRENT_BUFFER_LVALUE->yy_buf_size = (int) (new_size - 2); + } + + (yy_n_chars) += number_to_move; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] = YY_END_OF_BUFFER_CHAR; + YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars) + 1] = YY_END_OF_BUFFER_CHAR; + + (yytext_ptr) = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[0]; + + return ret_val; +} + +/* yy_get_previous_state - get the state just before the EOB char was reached */ + + static yy_state_type yy_get_previous_state (void) +{ + yy_state_type yy_current_state; + char *yy_cp; + + yy_current_state = (yy_start); + + for ( yy_cp = (yytext_ptr) + YY_MORE_ADJ; yy_cp < (yy_c_buf_p); ++yy_cp ) + { + YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 8 ) + yy_c = yy_meta[yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; + } + + return yy_current_state; +} + +/* yy_try_NUL_trans - try to make a transition on the NUL character + * + * synopsis + * next_state = yy_try_NUL_trans( current_state ); + */ + static yy_state_type yy_try_NUL_trans (yy_state_type yy_current_state ) +{ + int yy_is_jam; + char *yy_cp = (yy_c_buf_p); + + YY_CHAR yy_c = 1; + if ( yy_accept[yy_current_state] ) + { + (yy_last_accepting_state) = yy_current_state; + (yy_last_accepting_cpos) = yy_cp; + } + while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) + { + yy_current_state = (int) yy_def[yy_current_state]; + if ( yy_current_state >= 8 ) + yy_c = yy_meta[yy_c]; + } + yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; + yy_is_jam = (yy_current_state == 7); + + return yy_is_jam ? 0 : yy_current_state; +} + +#ifndef YY_NO_UNPUT + + static void yyunput (int c, char * yy_bp ) +{ + char *yy_cp; + + yy_cp = (yy_c_buf_p); + + /* undo effects of setting up yytext */ + *yy_cp = (yy_hold_char); + + if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) + { /* need to shift things up to make room */ + /* +2 for EOB chars. */ + int number_to_move = (yy_n_chars) + 2; + char *dest = &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[ + YY_CURRENT_BUFFER_LVALUE->yy_buf_size + 2]; + char *source = + &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[number_to_move]; + + while ( source > YY_CURRENT_BUFFER_LVALUE->yy_ch_buf ) + *--dest = *--source; + + yy_cp += (int) (dest - source); + yy_bp += (int) (dest - source); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = + (yy_n_chars) = (int) YY_CURRENT_BUFFER_LVALUE->yy_buf_size; + + if ( yy_cp < YY_CURRENT_BUFFER_LVALUE->yy_ch_buf + 2 ) + YY_FATAL_ERROR( "flex scanner push-back overflow" ); + } + + *--yy_cp = (char) c; + + (yytext_ptr) = yy_bp; + (yy_hold_char) = *yy_cp; + (yy_c_buf_p) = yy_cp; +} + +#endif + +#ifndef YY_NO_INPUT +#ifdef __cplusplus + static int yyinput (void) +#else + static int input (void) +#endif + +{ + int c; + + *(yy_c_buf_p) = (yy_hold_char); + + if ( *(yy_c_buf_p) == YY_END_OF_BUFFER_CHAR ) + { + /* yy_c_buf_p now points to the character we want to return. + * If this occurs *before* the EOB characters, then it's a + * valid NUL; if not, then we've hit the end of the buffer. + */ + if ( (yy_c_buf_p) < &YY_CURRENT_BUFFER_LVALUE->yy_ch_buf[(yy_n_chars)] ) + /* This was really a NUL. */ + *(yy_c_buf_p) = '\0'; + + else + { /* need more input */ + int offset = (int) ((yy_c_buf_p) - (yytext_ptr)); + ++(yy_c_buf_p); + + switch ( yy_get_next_buffer( ) ) + { + case EOB_ACT_LAST_MATCH: + /* This happens because yy_g_n_b() + * sees that we've accumulated a + * token and flags that we need to + * try matching the token before + * proceeding. But for input(), + * there's no matching to consider. + * So convert the EOB_ACT_LAST_MATCH + * to EOB_ACT_END_OF_FILE. + */ + + /* Reset buffer status. */ + yyrestart( yyin ); + + /*FALLTHROUGH*/ + + case EOB_ACT_END_OF_FILE: + { + if ( yywrap( ) ) + return 0; + + if ( ! (yy_did_buffer_switch_on_eof) ) + YY_NEW_FILE; +#ifdef __cplusplus + return yyinput(); +#else + return input(); +#endif + } + + case EOB_ACT_CONTINUE_SCAN: + (yy_c_buf_p) = (yytext_ptr) + offset; + break; + } + } + } + + c = *(unsigned char *) (yy_c_buf_p); /* cast for 8-bit char's */ + *(yy_c_buf_p) = '\0'; /* preserve yytext */ + (yy_hold_char) = *++(yy_c_buf_p); + + return c; +} +#endif /* ifndef YY_NO_INPUT */ + +/** Immediately switch to a different input stream. + * @param input_file A readable stream. + * + * @note This function does not reset the start condition to @c INITIAL . + */ + void yyrestart (FILE * input_file ) +{ + + if ( ! YY_CURRENT_BUFFER ){ + yyensure_buffer_stack (); + YY_CURRENT_BUFFER_LVALUE = + yy_create_buffer( yyin, YY_BUF_SIZE ); + } + + yy_init_buffer( YY_CURRENT_BUFFER, input_file ); + yy_load_buffer_state( ); +} + +/** Switch to a different input buffer. + * @param new_buffer The new input buffer. + * + */ + void yy_switch_to_buffer (YY_BUFFER_STATE new_buffer ) +{ + + /* TODO. We should be able to replace this entire function body + * with + * yypop_buffer_state(); + * yypush_buffer_state(new_buffer); + */ + yyensure_buffer_stack (); + if ( YY_CURRENT_BUFFER == new_buffer ) + return; + + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + YY_CURRENT_BUFFER_LVALUE = new_buffer; + yy_load_buffer_state( ); + + /* We don't actually know whether we did this switch during + * EOF (yywrap()) processing, but the only time this flag + * is looked at is after yywrap() is called, so it's safe + * to go ahead and always set it. + */ + (yy_did_buffer_switch_on_eof) = 1; +} + +static void yy_load_buffer_state (void) +{ + (yy_n_chars) = YY_CURRENT_BUFFER_LVALUE->yy_n_chars; + (yytext_ptr) = (yy_c_buf_p) = YY_CURRENT_BUFFER_LVALUE->yy_buf_pos; + yyin = YY_CURRENT_BUFFER_LVALUE->yy_input_file; + (yy_hold_char) = *(yy_c_buf_p); +} + +/** Allocate and initialize an input buffer state. + * @param file A readable stream. + * @param size The character buffer size in bytes. When in doubt, use @c YY_BUF_SIZE. + * + * @return the allocated buffer state. + */ + YY_BUFFER_STATE yy_create_buffer (FILE * file, int size ) +{ + YY_BUFFER_STATE b; + + b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_buf_size = size; + + /* yy_ch_buf has to be 2 characters longer than the size given because + * we need to put in 2 end-of-buffer characters. + */ + b->yy_ch_buf = (char *) yyalloc( (yy_size_t) (b->yy_buf_size + 2) ); + if ( ! b->yy_ch_buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); + + b->yy_is_our_buffer = 1; + + yy_init_buffer( b, file ); + + return b; +} + +/** Destroy the buffer. + * @param b a buffer created with yy_create_buffer() + * + */ + void yy_delete_buffer (YY_BUFFER_STATE b ) +{ + + if ( ! b ) + return; + + if ( b == YY_CURRENT_BUFFER ) /* Not sure if we should pop here. */ + YY_CURRENT_BUFFER_LVALUE = (YY_BUFFER_STATE) 0; + + if ( b->yy_is_our_buffer ) + yyfree( (void *) b->yy_ch_buf ); + + yyfree( (void *) b ); +} + +/* Initializes or reinitializes a buffer. + * This function is sometimes called more than once on the same buffer, + * such as during a yyrestart() or at EOF. + */ + static void yy_init_buffer (YY_BUFFER_STATE b, FILE * file ) + +{ + int oerrno = errno; + + yy_flush_buffer( b ); + + b->yy_input_file = file; + b->yy_fill_buffer = 1; + + /* If b is the current buffer, then yy_init_buffer was _probably_ + * called from yyrestart() or through yy_get_next_buffer. + * In that case, we don't want to reset the lineno or column. + */ + if (b != YY_CURRENT_BUFFER){ + b->yy_bs_lineno = 1; + b->yy_bs_column = 0; + } + + b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; + + errno = oerrno; +} + +/** Discard all buffered characters. On the next scan, YY_INPUT will be called. + * @param b the buffer state to be flushed, usually @c YY_CURRENT_BUFFER. + * + */ + void yy_flush_buffer (YY_BUFFER_STATE b ) +{ + if ( ! b ) + return; + + b->yy_n_chars = 0; + + /* We always need two end-of-buffer characters. The first causes + * a transition to the end-of-buffer state. The second causes + * a jam in that state. + */ + b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; + b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; + + b->yy_buf_pos = &b->yy_ch_buf[0]; + + b->yy_at_bol = 1; + b->yy_buffer_status = YY_BUFFER_NEW; + + if ( b == YY_CURRENT_BUFFER ) + yy_load_buffer_state( ); +} + +/** Pushes the new state onto the stack. The new state becomes + * the current state. This function will allocate the stack + * if necessary. + * @param new_buffer The new state. + * + */ +void yypush_buffer_state (YY_BUFFER_STATE new_buffer ) +{ + if (new_buffer == NULL) + return; + + yyensure_buffer_stack(); + + /* This block is copied from yy_switch_to_buffer. */ + if ( YY_CURRENT_BUFFER ) + { + /* Flush out information for old buffer. */ + *(yy_c_buf_p) = (yy_hold_char); + YY_CURRENT_BUFFER_LVALUE->yy_buf_pos = (yy_c_buf_p); + YY_CURRENT_BUFFER_LVALUE->yy_n_chars = (yy_n_chars); + } + + /* Only push if top exists. Otherwise, replace top. */ + if (YY_CURRENT_BUFFER) + (yy_buffer_stack_top)++; + YY_CURRENT_BUFFER_LVALUE = new_buffer; + + /* copied from yy_switch_to_buffer. */ + yy_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; +} + +/** Removes and deletes the top of the stack, if present. + * The next element becomes the new top. + * + */ +void yypop_buffer_state (void) +{ + if (!YY_CURRENT_BUFFER) + return; + + yy_delete_buffer(YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + if ((yy_buffer_stack_top) > 0) + --(yy_buffer_stack_top); + + if (YY_CURRENT_BUFFER) { + yy_load_buffer_state( ); + (yy_did_buffer_switch_on_eof) = 1; + } +} + +/* Allocates the stack if it does not exist. + * Guarantees space for at least one push. + */ +static void yyensure_buffer_stack (void) +{ + yy_size_t num_to_alloc; + + if (!(yy_buffer_stack)) { + + /* First allocation is just for 2 elements, since we don't know if this + * scanner will even need a stack. We use 2 instead of 1 to avoid an + * immediate realloc on the next call. + */ + num_to_alloc = 1; /* After all that talk, this was set to 1 anyways... */ + (yy_buffer_stack) = (struct yy_buffer_state**)yyalloc + (num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); + + memset((yy_buffer_stack), 0, num_to_alloc * sizeof(struct yy_buffer_state*)); + + (yy_buffer_stack_max) = num_to_alloc; + (yy_buffer_stack_top) = 0; + return; + } + + if ((yy_buffer_stack_top) >= ((yy_buffer_stack_max)) - 1){ + + /* Increase the buffer to prepare for a possible push. */ + yy_size_t grow_size = 8 /* arbitrary grow size */; + + num_to_alloc = (yy_buffer_stack_max) + grow_size; + (yy_buffer_stack) = (struct yy_buffer_state**)yyrealloc + ((yy_buffer_stack), + num_to_alloc * sizeof(struct yy_buffer_state*) + ); + if ( ! (yy_buffer_stack) ) + YY_FATAL_ERROR( "out of dynamic memory in yyensure_buffer_stack()" ); + + /* zero only the new slots.*/ + memset((yy_buffer_stack) + (yy_buffer_stack_max), 0, grow_size * sizeof(struct yy_buffer_state*)); + (yy_buffer_stack_max) = num_to_alloc; + } +} + +/** Setup the input buffer state to scan directly from a user-specified character buffer. + * @param base the character buffer + * @param size the size in bytes of the character buffer + * + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE yy_scan_buffer (char * base, yy_size_t size ) +{ + YY_BUFFER_STATE b; + + if ( size < 2 || + base[size-2] != YY_END_OF_BUFFER_CHAR || + base[size-1] != YY_END_OF_BUFFER_CHAR ) + /* They forgot to leave room for the EOB's. */ + return NULL; + + b = (YY_BUFFER_STATE) yyalloc( sizeof( struct yy_buffer_state ) ); + if ( ! b ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); + + b->yy_buf_size = (int) (size - 2); /* "- 2" to take care of EOB's */ + b->yy_buf_pos = b->yy_ch_buf = base; + b->yy_is_our_buffer = 0; + b->yy_input_file = NULL; + b->yy_n_chars = b->yy_buf_size; + b->yy_is_interactive = 0; + b->yy_at_bol = 1; + b->yy_fill_buffer = 0; + b->yy_buffer_status = YY_BUFFER_NEW; + + yy_switch_to_buffer( b ); + + return b; +} + +/** Setup the input buffer state to scan a string. The next call to yylex() will + * scan from a @e copy of @a str. + * @param yystr a NUL-terminated string to scan + * + * @return the newly allocated buffer state object. + * @note If you want to scan bytes that may contain NUL values, then use + * yy_scan_bytes() instead. + */ +YY_BUFFER_STATE yy_scan_string (const char * yystr ) +{ + + return yy_scan_bytes( yystr, (int) strlen(yystr) ); +} + +/** Setup the input buffer state to scan the given bytes. The next call to yylex() will + * scan from a @e copy of @a bytes. + * @param yybytes the byte buffer to scan + * @param _yybytes_len the number of bytes in the buffer pointed to by @a bytes. + * + * @return the newly allocated buffer state object. + */ +YY_BUFFER_STATE yy_scan_bytes (const char * yybytes, int _yybytes_len ) +{ + YY_BUFFER_STATE b; + char *buf; + yy_size_t n; + int i; + + /* Get memory for full buffer, including space for trailing EOB's. */ + n = (yy_size_t) (_yybytes_len + 2); + buf = (char *) yyalloc( n ); + if ( ! buf ) + YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); + + for ( i = 0; i < _yybytes_len; ++i ) + buf[i] = yybytes[i]; + + buf[_yybytes_len] = buf[_yybytes_len+1] = YY_END_OF_BUFFER_CHAR; + + b = yy_scan_buffer( buf, n ); + if ( ! b ) + YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); + + /* It's okay to grow etc. this buffer, and we should throw it + * away when we're done. + */ + b->yy_is_our_buffer = 1; + + return b; +} + +#ifndef YY_EXIT_FAILURE +#define YY_EXIT_FAILURE 2 +#endif + +static void yynoreturn yy_fatal_error (const char* msg ) +{ + fprintf( stderr, "%s\n", msg ); + exit( YY_EXIT_FAILURE ); +} + +/* Redefine yyless() so it works in section 3 code. */ + +#undef yyless +#define yyless(n) \ + do \ + { \ + /* Undo effects of setting up yytext. */ \ + int yyless_macro_arg = (n); \ + YY_LESS_LINENO(yyless_macro_arg);\ + yytext[yyleng] = (yy_hold_char); \ + (yy_c_buf_p) = yytext + yyless_macro_arg; \ + (yy_hold_char) = *(yy_c_buf_p); \ + *(yy_c_buf_p) = '\0'; \ + yyleng = yyless_macro_arg; \ + } \ + while ( 0 ) + +/* Accessor methods (get/set functions) to struct members. */ + +/** Get the current line number. + * + */ +int yyget_lineno (void) +{ + + return yylineno; +} + +/** Get the input stream. + * + */ +FILE *yyget_in (void) +{ + return yyin; +} + +/** Get the output stream. + * + */ +FILE *yyget_out (void) +{ + return yyout; +} + +/** Get the length of the current token. + * + */ +int yyget_leng (void) +{ + return yyleng; +} + +/** Get the current token. + * + */ + +char *yyget_text (void) +{ + return yytext; +} + +/** Set the current line number. + * @param _line_number line number + * + */ +void yyset_lineno (int _line_number ) +{ + + yylineno = _line_number; +} + +/** Set the input stream. This does not discard the current + * input buffer. + * @param _in_str A readable stream. + * + * @see yy_switch_to_buffer + */ +void yyset_in (FILE * _in_str ) +{ + yyin = _in_str ; +} + +void yyset_out (FILE * _out_str ) +{ + yyout = _out_str ; +} + +int yyget_debug (void) +{ + return yy_flex_debug; +} + +void yyset_debug (int _bdebug ) +{ + yy_flex_debug = _bdebug ; +} + +static int yy_init_globals (void) +{ + /* Initialization is the same as for the non-reentrant scanner. + * This function is called from yylex_destroy(), so don't allocate here. + */ + + (yy_buffer_stack) = NULL; + (yy_buffer_stack_top) = 0; + (yy_buffer_stack_max) = 0; + (yy_c_buf_p) = NULL; + (yy_init) = 0; + (yy_start) = 0; + +/* Defined in main.c */ +#ifdef YY_STDINIT + yyin = stdin; + yyout = stdout; +#else + yyin = NULL; + yyout = NULL; +#endif + + /* For future reference: Set errno on error, since we are called by + * yylex_init() + */ + return 0; +} + +/* yylex_destroy is for both reentrant and non-reentrant scanners. */ +int yylex_destroy (void) +{ + + /* Pop the buffer stack, destroying each element. */ + while(YY_CURRENT_BUFFER){ + yy_delete_buffer( YY_CURRENT_BUFFER ); + YY_CURRENT_BUFFER_LVALUE = NULL; + yypop_buffer_state(); + } + + /* Destroy the stack itself. */ + yyfree((yy_buffer_stack) ); + (yy_buffer_stack) = NULL; + + /* Reset the globals. This is important in a non-reentrant scanner so the next time + * yylex() is called, initialization will occur. */ + yy_init_globals( ); + + return 0; +} + +/* + * Internal utility routines. + */ + +#ifndef yytext_ptr +static void yy_flex_strncpy (char* s1, const char * s2, int n ) +{ + + int i; + for ( i = 0; i < n; ++i ) + s1[i] = s2[i]; +} +#endif + +#ifdef YY_NEED_STRLEN +static int yy_flex_strlen (const char * s ) +{ + int n; + for ( n = 0; s[n]; ++n ) + ; + + return n; +} +#endif + +void *yyalloc (yy_size_t size ) +{ + return malloc(size); +} + +void *yyrealloc (void * ptr, yy_size_t size ) +{ + + /* The cast to (char *) in the following accommodates both + * implementations that use char* generic pointers, and those + * that use void* generic pointers. It works with the latter + * because both ANSI C and C++ allow castless assignment from + * any pointer type to void*, and deal with argument conversions + * as though doing an assignment. + */ + return realloc(ptr, size); +} + +void yyfree (void * ptr ) +{ + free( (char *) ptr ); /* see yyrealloc() for (char *) cast */ +} + +#define YYTABLES_NAME "yytables" + +#line 8 "test.l" + + +void main() { + printf("enter the string:\n"); + yylex(); + printf("Vowels: %d\n",v); + printf("Consonents: %d\n",c); +} + +int yywrap() { + return 1; +} diff --git a/B-Tech-S7/test.l b/B-Tech-S7/test.l new file mode 100644 index 0000000..ad73966 --- /dev/null +++ b/B-Tech-S7/test.l @@ -0,0 +1,19 @@ +%{ + int v=0,c=0; +%} + +%% +[aeiouAEIOU] {v++;} +[a-zA-Z] {c++;} +%% + +void main() { + printf("enter the string:\n"); + yylex(); + printf("Vowels: %d\n",v); + printf("Consonents: %d\n",c); +} + +int yywrap() { + return 1; +} \ No newline at end of file From 227d22d9bb22ad3ba63a83fbb3974dc5a6010461 Mon Sep 17 00:00:00 2001 From: cslab8282 Date: Mon, 9 Oct 2023 14:47:07 +0530 Subject: [PATCH 11/11] lex done --- B-Tech-S7/lex.l | 32 +++++++++ B-Tech-S7/lex.yy.c | 166 ++++++++++++++++++++++++++++++--------------- B-Tech-S7/target.c | 5 ++ 3 files changed, 150 insertions(+), 53 deletions(-) create mode 100644 B-Tech-S7/lex.l create mode 100644 B-Tech-S7/target.c diff --git a/B-Tech-S7/lex.l b/B-Tech-S7/lex.l new file mode 100644 index 0000000..0104847 --- /dev/null +++ b/B-Tech-S7/lex.l @@ -0,0 +1,32 @@ +%{ +#include +%} +keyword int|void|while|do|for +id ([a-zA-Z])([a-zA-Z0-9])* +rop <|<=|>=|== +pun [;,{}()] +con ([0-9])([0-9])* +aop [+] +aop1 [-] +aop2 [*] +aop3 [/] +assign = +%% +{keyword} {printf("%s is a keyword \n",yytext);} +{id} {printf("%s is a identifier \n",yytext);} +{rop} {printf("%s is a relational operator \n",yytext);} +{pun} {printf("%s is a punctuation \n",yytext);} +{con} {printf("%s is a constant \n",yytext);} +{aop} {printf("%s is a arithmetic operator \n",yytext);} +{aop1} {printf("%s is a arithmetic operator \n",yytext);} +{aop2} {printf("%s is a arithmetic operator \n",yytext);} +{aop3} {printf("%s is a arithmetic operator \n",yytext);} +{assign} {printf("%s is a assignment operator \n",yytext);} +%% +int yywrap(void){} +int main() +{ +printf("Enter a string"); +yylex(); +return 1; +} diff --git a/B-Tech-S7/lex.yy.c b/B-Tech-S7/lex.yy.c index 0f6bac7..9099860 100644 --- a/B-Tech-S7/lex.yy.c +++ b/B-Tech-S7/lex.yy.c @@ -351,8 +351,8 @@ static void yynoreturn yy_fatal_error ( const char* msg ); (yy_hold_char) = *yy_cp; \ *yy_cp = '\0'; \ (yy_c_buf_p) = yy_cp; -#define YY_NUM_RULES 3 -#define YY_END_OF_BUFFER 4 +#define YY_NUM_RULES 11 +#define YY_END_OF_BUFFER 12 /* This struct is not used in this scanner, but its presence is necessary. */ struct yy_trans_info @@ -360,9 +360,12 @@ struct yy_trans_info flex_int32_t yy_verify; flex_int32_t yy_nxt; }; -static const flex_int16_t yy_accept[8] = +static const flex_int16_t yy_accept[32] = { 0, - 0, 0, 4, 3, 1, 2, 0 + 0, 0, 12, 11, 4, 8, 6, 7, 9, 5, + 3, 10, 11, 2, 2, 2, 2, 2, 2, 5, + 3, 2, 1, 2, 2, 2, 2, 2, 2, 2, + 0 } ; static const YY_CHAR yy_ec[256] = @@ -370,17 +373,17 @@ static const YY_CHAR yy_ec[256] = 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 2, 3, 3, 3, 2, 3, - 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, - 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, - 1, 1, 1, 1, 1, 1, 2, 3, 3, 3, - - 2, 3, 3, 3, 2, 3, 3, 3, 3, 3, - 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, - 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, + 2, 3, 4, 2, 5, 1, 6, 7, 7, 7, + 7, 7, 7, 7, 7, 7, 7, 1, 2, 8, + 9, 10, 1, 1, 11, 11, 11, 11, 11, 11, + 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, + 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, + 1, 1, 1, 1, 1, 1, 11, 11, 11, 12, + + 13, 14, 11, 15, 16, 11, 11, 17, 11, 18, + 19, 11, 11, 20, 11, 21, 11, 22, 23, 11, + 11, 11, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, @@ -397,29 +400,49 @@ static const YY_CHAR yy_ec[256] = 1, 1, 1, 1, 1 } ; -static const YY_CHAR yy_meta[4] = +static const YY_CHAR yy_meta[24] = { 0, - 1, 1, 1 + 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2 } ; -static const flex_int16_t yy_base[8] = +static const flex_int16_t yy_base[33] = { 0, - 0, 0, 4, 5, 5, 5, 5 + 0, 0, 42, 43, 43, 43, 43, 43, 43, 34, + 31, 30, 29, 0, 18, 17, 17, 15, 18, 25, + 43, 0, 0, 11, 9, 13, 12, 15, 9, 12, + 43, 22 } ; -static const flex_int16_t yy_def[8] = +static const flex_int16_t yy_def[33] = { 0, - 7, 1, 7, 7, 7, 7, 0 + 31, 1, 31, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 32, 32, 32, 32, 32, 32, 31, + 31, 32, 32, 32, 32, 32, 32, 32, 32, 32, + 0, 31 } ; -static const flex_int16_t yy_nxt[9] = +static const flex_int16_t yy_nxt[67] = { 0, - 4, 5, 6, 7, 3, 7, 7, 7 + 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, + 14, 15, 14, 16, 14, 17, 14, 14, 14, 14, + 14, 18, 19, 22, 23, 30, 23, 29, 28, 23, + 23, 20, 27, 26, 25, 24, 23, 21, 21, 21, + 20, 31, 3, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 31, 31, 31 } ; -static const flex_int16_t yy_chk[9] = +static const flex_int16_t yy_chk[67] = { 0, - 1, 1, 1, 3, 7, 7, 7, 7 + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, + 1, 1, 1, 32, 30, 29, 28, 27, 26, 25, + 24, 20, 19, 18, 17, 16, 15, 13, 12, 11, + 10, 3, 31, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, + 31, 31, 31, 31, 31, 31 } ; static yy_state_type yy_last_accepting_state; @@ -436,11 +459,11 @@ int yy_flex_debug = 0; #define YY_MORE_ADJ 0 #define YY_RESTORE_YY_MORE_OFFSET char *yytext; -#line 1 "test.l" -#line 2 "test.l" - int v=0,c=0; -#line 443 "lex.yy.c" -#line 444 "lex.yy.c" +#line 1 "lex1.l" +#line 2 "lex1.l" +#include +#line 466 "lex.yy.c" +#line 467 "lex.yy.c" #define INITIAL 0 @@ -657,9 +680,9 @@ YY_DECL } { -#line 5 "test.l" +#line 14 "lex1.l" -#line 663 "lex.yy.c" +#line 686 "lex.yy.c" while ( /*CONSTCOND*/1 ) /* loops until end-of-file is reached */ { @@ -686,13 +709,13 @@ YY_DECL while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 8 ) + if ( yy_current_state >= 32 ) yy_c = yy_meta[yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; ++yy_cp; } - while ( yy_base[yy_current_state] != 5 ); + while ( yy_base[yy_current_state] != 43 ); yy_find_action: yy_act = yy_accept[yy_current_state]; @@ -718,20 +741,60 @@ YY_DECL case 1: YY_RULE_SETUP -#line 6 "test.l" -{v++;} +#line 15 "lex1.l" +{printf("%s is a keyword \n",yytext);} YY_BREAK case 2: YY_RULE_SETUP -#line 7 "test.l" -{c++;} +#line 16 "lex1.l" +{printf("%s is a identifier \n",yytext);} YY_BREAK case 3: YY_RULE_SETUP -#line 8 "test.l" +#line 17 "lex1.l" +{printf("%s is a relational operator \n",yytext);} + YY_BREAK +case 4: +YY_RULE_SETUP +#line 18 "lex1.l" +{printf("%s is a punctuation \n",yytext);} + YY_BREAK +case 5: +YY_RULE_SETUP +#line 19 "lex1.l" +{printf("%s is a constant \n",yytext);} + YY_BREAK +case 6: +YY_RULE_SETUP +#line 20 "lex1.l" +{printf("%s is a arithmetic operator \n",yytext);} + YY_BREAK +case 7: +YY_RULE_SETUP +#line 21 "lex1.l" +{printf("%s is a arithmetic operator \n",yytext);} + YY_BREAK +case 8: +YY_RULE_SETUP +#line 22 "lex1.l" +{printf("%s is a arithmetic operator \n",yytext);} + YY_BREAK +case 9: +YY_RULE_SETUP +#line 23 "lex1.l" +{printf("%s is a arithmetic operator \n",yytext);} + YY_BREAK +case 10: +YY_RULE_SETUP +#line 24 "lex1.l" +{printf("%s is a assignment operator \n",yytext);} + YY_BREAK +case 11: +YY_RULE_SETUP +#line 25 "lex1.l" ECHO; YY_BREAK -#line 735 "lex.yy.c" +#line 798 "lex.yy.c" case YY_STATE_EOF(INITIAL): yyterminate(); @@ -1028,7 +1091,7 @@ static int yy_get_next_buffer (void) while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 8 ) + if ( yy_current_state >= 32 ) yy_c = yy_meta[yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; @@ -1056,11 +1119,11 @@ static int yy_get_next_buffer (void) while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) { yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 8 ) + if ( yy_current_state >= 32 ) yy_c = yy_meta[yy_c]; } yy_current_state = yy_nxt[yy_base[yy_current_state] + yy_c]; - yy_is_jam = (yy_current_state == 7); + yy_is_jam = (yy_current_state == 31); return yy_is_jam ? 0 : yy_current_state; } @@ -1736,16 +1799,13 @@ void yyfree (void * ptr ) #define YYTABLES_NAME "yytables" -#line 8 "test.l" +#line 25 "lex1.l" - -void main() { - printf("enter the string:\n"); - yylex(); - printf("Vowels: %d\n",v); - printf("Consonents: %d\n",c); +int yywrap(void){} +int main() +{ +printf("Enter a string"); +yylex(); +return 1; } -int yywrap() { - return 1; -} diff --git a/B-Tech-S7/target.c b/B-Tech-S7/target.c new file mode 100644 index 0000000..cd1a861 --- /dev/null +++ b/B-Tech-S7/target.c @@ -0,0 +1,5 @@ +#include + +void main() { + +} \ No newline at end of file