UGC NET CS 2014 June-paper-2
October 10, 2023UGC NET CS 2009 Dec-Paper-2
October 10, 2023Compiler-Design
|
Question 293
|
Top-down parsers are predictive parsers, because :
|
next tokens are predicted.
|
|
|
length of the parse tree is predicted beforehand
|
|
|
lowest node in the parse tree is predicted.
|
|
|
next lower level of the parse tree is predicted.
|
Question 293 Explanation:
→ Top-down parsers are predictive parsers, because next tokens are predicted.
→ Predictive parser is a recursive descent parser, which has the capability to predict which production is to be used to replace the input string.
→ The predictive parser does not suffer from backtracking.
→ Predictive parsing uses a stack and a parsing table to parse the input and generate a parse tree.
→ Predictive parser is a recursive descent parser, which has the capability to predict which production is to be used to replace the input string.
→ The predictive parser does not suffer from backtracking.
→ Predictive parsing uses a stack and a parsing table to parse the input and generate a parse tree.
Correct Answer: A
Question 293 Explanation:
→ Top-down parsers are predictive parsers, because next tokens are predicted.
→ Predictive parser is a recursive descent parser, which has the capability to predict which production is to be used to replace the input string.
→ The predictive parser does not suffer from backtracking.
→ Predictive parsing uses a stack and a parsing table to parse the input and generate a parse tree.
→ Predictive parser is a recursive descent parser, which has the capability to predict which production is to be used to replace the input string.
→ The predictive parser does not suffer from backtracking.
→ Predictive parsing uses a stack and a parsing table to parse the input and generate a parse tree.