This program takes a regular grammar as input

• Left Recursion from the grammar if they are present
• Removes Ambiguity
• Generates the First and Follow
• Displays its corresponding LL(1) Parsing Table.

Epsilon is represented by 'Ɛ'.

Finally, the table and an string are used to simulate the LL(1) parse action.