Parsing
LL(1) Parsing means that the grammar allows a deterministic parser that operates from left to right, produces leftmost derivation, using a look ahead of one symbol. To make the parsing deterministic, we could require that each parse table entry contain at most one element. In terms of grammar, this means that all right-hand sides of a non-terminal start with different terminal symbol. A grammar that fulfills this requirement is called a simple LL(1) grammar (SLL(1)), or an s-grammar. Deterministic parsers are much faster than non-deterministic parser.
Algorithm: FIRST Set Computation
The construction of LL(1) parser is aided by two functions associated with a grammar G. These functions,
First and Follow allow us to fill in the entries of a predictive parsing table for G, whenever possible.
Dear Aspirants,
Your preparation for GATE, ESE, PSUs, and AE/JE is now smarter than ever — thanks to the MADE EASY YouTube channel.
This is not just a channel, but a complete strategy for success, where you get toppers strategies, PYQ–GTQ discussions, current affairs updates, and important job-related information, all delivered by the country’s best teachers and industry experts.
If you also want to stay one step ahead in the race to success, subscribe to MADE EASY on YouTube and stay connected with us on social media.
MADE EASY — where preparation happens with confidence.
MADE EASY is a well-organized institute, complete in all aspects, and provides quality guidance for both written and personality tests. MADE EASY has produced top-ranked students in ESE, GATE, and various public sector exams. The publishing team regularly writes exam-related blogs based on conversations with the faculty, helping students prepare effectively for their exams.
