LL(1) Parser

LL(1) parser (Left-to-right, Leftmost derivation) is a top-down parser for a subset of context-free languages. It parses the input from Left to right, performing Leftmost derivation of the sentence. This project is LL(1) parser implemented using java. It takes the set of rules as text and then generates the output. This project was made for (Compiler - Forth Year) in my college.

Input Example

4 S S ABc A bA A phi B c

Output Screenshot

other examples you could try

7 S S ABD A aA A phi B bB B phi D dD D phi

8 E E TO O pTO O phi T FR R aFR R phi F bEc F v

License

This project is available under the terms of MIT License