retagged by
983 views
3 votes
3 votes

Which one of the following can be handled by predictive parsers?

  1. Left recursion
  2. Left factors
  3. Ambiguity
  4. Non-determinism
retagged by

1 Answer

Best answer
3 votes
3 votes
No grammar except operator precdence grammar can parse ambiguous grammars .

Predictive parser means LL(1)  and LL(1) grammars should not be ambiguous,no left recursion and can perform left factoring .

Left factored grammar means non determinism is not there...if it also means that grammar was originally ambiguous and not left recursive then B can be a answer.
selected by
Answer:

Related questions

2 votes
2 votes
0 answers
1
Bikram asked Nov 25, 2016
448 views
$\textbf{goto}$ function of LR class of grammar is represented as:Deterministic Finite Automata transitionsNon-deterministic Finite Automata transitionsPDA transitionsPar...
3 votes
3 votes
1 answer
2
Bikram asked Nov 25, 2016
449 views
Consider the following grammar:$E \rightarrow E + T \mid T$$T \rightarrow T ^* F \mid F$$F \rightarrow (E) \mid id$What are the productions for E, T and F after convertin...
2 votes
2 votes
1 answer
3
Bikram asked Nov 25, 2016
300 views
Which one of the following statements is TRUE?SLR parser has more states than LALR parser.LALR parser has more states than Canonical LR.Canonical LR has fewer states than...