SYNTAX ANALYSIS
ERROR RECOVERY IN SYNTAX ANALYSIS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Left most derivation
|
|
|
Scanning from left to right
|
|
|
Both above
|
|
|
None
|
Detailed explanation-1: -In the name LL(1), the first L stands for scanning the input from left to right, the second L stands for producing a leftmost derivation, and the 1 stands for using one input symbol of lookahead at each step to make parsing action decision.
Detailed explanation-2: -Non-recursive descent parser or table-driven is also known as LL(1) parser. This parser follows the leftmost derivation (LMD).
Detailed explanation-3: -Recognizing LL(1): Here are two properties we know must be true of a grammar if it is to be LL(1): the grammar must not be left recursive. the rule which should be chosen when developing a nonterminal must be determined by that nonterminal and the (at most) next token on the input.
Detailed explanation-4: -A top-down parser that uses a one-token lookahead is called an LL(1) parser. The first L indicates that the input is read from left to right. The second L says that it produces a left-to-right derivation. And the 1 says that it uses one lookahead token.