COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
In LL(1) parsing the production A
|
|
Select(A
|
|
|
Select(A
|
|
|
Select(A
|
|
|
Select(A
|
Explanation:
Detailed explanation-1: -The correct answer is option 3. Concept: Non-recursive descent parser or table-driven is also known as LL(1) parser.
Detailed explanation-2: -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-3: -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.
There is 1 question to complete.