LR parser table

ankurparihar · ankurparihar · commit 118ccee4efb7 · 2019-04-01T23:39:31.000+05:30
diff --git a/Lab 5/README.md b/Lab 5/README.md
@@ -1,7 +1,7 @@
 # How to run
 
 - compile `gcc main.c`
-- run `./a.out < input.txt`
+- run `./a.out < input.txt > output.txt`. Result will be saved in [output.txt](./output.txt)
 - input format (file:[input.txt](./input.txt))
 	- The first line of input contains number of rules n.
 	- Then next n lines contains rules property lhs(left hand side symbol) and rhs(no of symbols in rhs). Eg. `A->Aa` becomes `A 2`
@@ -13,3 +13,7 @@
 	- Next line Table rules (action) in matrix form: 00=blank, si=shift i, ri=reduce i, a0=accept
 	- Next line Table rules (goto) in matrix form: -1=blank
 	- Final line expression to evaluate
+
+# Tools
+- Use [LR1 machine](http://jsmachines.sourceforge.net/machines/lr1.html) to create and verify programs.
+- Tool's indexing starts from 0 and my program's from 1. so if tools has reduce instruction `r3` my program's input will be `r4`. shift instructions are as it is.
diff --git a/Lab 5/input2.txt b/Lab 5/input2.txt
@@ -0,0 +1,31 @@
+6
+S 1
+E 3
+E 3
+E 1
+B 1
+B 1
+3
+5
+9
+S E B
++ * 0 1 $
+00 00 s3 s4 00
+s5 s6 00 00 a0
+r4 r4 00 00 r4
+r5 r5 00 00 r5
+r6 r6 00 00 r6
+00 00 s3 s4 00
+00 00 s3 s4 00
+r2 r2 00 00 r2
+r3 r3 00 00 r3
+-1 1 2
+-1 -1 -1
+-1 -1 -1
+-1 -1 -1
+-1 -1 -1
+-1 -1 7
+-1 -1 8
+-1 -1 -1
+-1 -1 -1
+1*1+1+1$
diff --git a/Lab 5/main.c b/Lab 5/main.c
@@ -125,14 +125,10 @@ int* append_int(int n, int *arr, int *p){
 }
 
 int getReduction(int k){
-	// int a[] = {2,2,1};
-	// return a[k-1];
 	return rules[k-1].n;
 }
 
 char getRedChar(int k){
-	// char a[] = {'S','A','A'};
-	// return a[k-1];
 	return rules[k-1].c;
 }
 

Original file line number	Diff line number	Diff line change
`@@ -125,14 +125,10 @@ int* append_int(int n, int arr, int p){`
`125`	`125`	`}`
`126`	`126`
`127`	`127`	`int getReduction(int k){`
`128`		`- // int a[] = {2,2,1};`
`129`		`- // return a[k-1];`
`130`	`128`	`return rules[k-1].n;`
`131`	`129`	`}`
`132`	`130`
`133`	`131`	`char getRedChar(int k){`
`134`		`- // char a[] = {'S','A','A'};`
`135`		`- // return a[k-1];`
`136`	`132`	`return rules[k-1].c;`
`137`	`133`	`}`
`138`	`134`