COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Builds parse tree from root to leaves
|
|
|
Two symbols can be scanned at a time
|
|
|
Input is scanned from left to right
|
|
|
One symbol can be scanned at a time
|
Detailed explanation-1: -Detailed Solution. The correct answer is option 4. Concept: Option 1: Top-down parsers are equipped to handle left recursive grammar.
Detailed explanation-2: -Which one of the following is a top-down parser? Explanation: Recursive Descent also known as top down parsing also known to be LL(1).
Detailed explanation-3: -Detailed Solution. Concept: A top down parser starts with the start symbol and generate the output. It tries to parse a string using the left most derivation.
Detailed explanation-4: -Top-down parsing in computer science is a parsing strategy where one first looks at the highest level of the parse tree and works down the parse tree by using the rewriting rules of a formal grammar. LL parsers are a type of parser that uses a top-down parsing strategy.