- Right most derivation
- Left most derivation
- Derivation tree
Right Most Derivation derives derivation from right to left and in left most derivation, It derives from Left to right.
- Recursive Descent Parser
- Non-recursive Predictive parser(LL(1))
- Recursive descent parser use stack functionality.
- It may goes to infinite loop if LR is not present.
- Cant choose right production due to Ambiguity.
- RDP have backtracking problem.
- RDP always substitute Left most derivation.
- If the given grammar is left recursive , it will go to infinite loop.
- complexity is (2n).
How to solve or parse a given grammar through predictive parser??