CFG is ambiguous is it possible to make top down and bottom up parsing?

Question

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???

Comments

Check out this article : https://www.geeksforgeeks.org/parsing-ambiguos-grammars-using-lr-parser/

Answer 1

No parser can parse the ambiguous grammar .So first convert them  unambiguous grammar.Then check whether they are parsable or not by the specific parser.

PS:Only Operator precedence parser can work with ambiguous Grammar !

Comments

Thank u bro

---

Only Operator precedence parser can work with ambigious Grammar !

---

Backtracking parser(Top Down) can also work with Ambiguous Grammar, since it is basically a Breadth first search for the string.

---

Disambiguation can be done using 2 properties: associativity and precedence. Using that, any of the LR(0)/ LR(1) parsers can be used to parse ambiguous Grammars. And since if a Grammar is ambiguous or not is a undecidable problem, people already use tools like YACC to disambiguate grammars. Check this : https://www.geeksforgeeks.org/parsing-ambiguos-grammars-using-lr-parser/