LL(1) Parser

In this project I am implement the LL(1) parser in C.

Here the 1st L represents that the scanning of the Input will be done from Left to Right manner and second L shows that in this Parsing technique we are going to use Left most Derivation Tree. and finally the 1 represents the number of look ahead, means how many symbols are you going to see when you want to make a decision.

Construction of LL(1) Parsing Table:

To construct the Parsing table, we have two functions:

1. First(): If there is a variable, and from that variable if we try to drive all the strings then the beginning Terminal Symbol is called the first.

2. Follow(): What is the Terminal Symbol which follow a variable in the process of derivation.

Now, after computing the First and Follow set for each Non-Terminal symbol we have to construct the Parsing table. In the table Rows will contain the Non-Terminals and the column will contain the Terminal Symbols. All the Null Productions of the Grammars will go under the Follow elements and the remaining productions will lie under the elements of First set.

File Descriptions

References

• https://www.geeksforgeeks.org/construction-of-ll1-parsing-table/