-
lab2.py -> lexical analyser
-
LEFT_RECURSION -> Founding left_recursions in the grammar, eliminating and modified grammar
-
first.py -> Finding first of grammar
-
follow.py-> First, follow and convert left recursion to right combined. Output in tablular format
-
LL1.py-> check a grammar is LL1 parsable or not? Also creates a parsing table.
-
op_table.py-> operator precendance table,uses text file in format as input E
E+E EE*E E~x -
op_function.py->just the graph is build yet.
-
op_table_parsing.py-> this is parsing with operator precedence table.