Register

How does ambiguity affect top down predictive parsing?

727 views
1 votes
1 votes

A predictive tp down parsing with parsing table must avoid three anomalies:

Ambiguity, left factoring, left recursion.

  • Left factoring causes multiple entires for same input-stack pair in parsing table.
  • Left recursion causes infinite loops in parsing process.

How ambiguity practically affects top down parsing?

User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
bunty choudhary asked Feb 9, 2018
456 views
top down parsing
why top down parser uses left most derivation? is it mandatory or we can change it by modifying the algo?
why top down parser uses left most derivation? is it mandatory or we can change it by modifying the algo?
User Avatar
1 votes
1 votes
1 answer
2
vishal chugh asked Jan 23, 2018
1,061 views
Top Down Parsing
Since it is a Bottom Up Parser do we need to evaluate expressions following Right Hand Derivations or Left Hand Derivations,i.e. should we evaluate D -> d first or B -> B first?
Since it is a Bottom Up Parser do we need to evaluate expressions following Right Hand Derivations or Left Hand Derivations,i.e. should we evaluate D - d first or B - B f...
User Avatar
1 votes
1 votes
1 answer
3
durgesh94 asked Jun 15, 2016
1,761 views
features that needed to implement top down parsing
Which of the following feature(s) is/are needed to implement top down parsing Source string marker Prediction making mechanism Matching and Backtracking mechanism All of the above
Which of the following feature(s) is/are needed to implement top down parsingSource string marker Prediction making mechanismMatching and Backtracking me...
User Avatar
2 votes
2 votes
1 answer
4
Prakash059 asked May 3, 2016
2,012 views
CFG is ambiguous is it possible to make top down and bottom up parsing?
If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct???
If a grammer(CFG) is ambiguous then we can construct the topdown and bottomup parsing is possible directly???or we will make them into unambiguous then we will construct?...
User Avatar
Link Copied!