The Gateway to Computer Science Excellence
+2 votes
309 views
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???
in Compiler Design by (247 points) | 309 views

1 Answer

+4 votes
Best answer
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 !
by Boss (38.7k points)
edited by
+1
Thank u bro
+1
Only Operator precedence parser can work with ambigious Grammar !
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,365 answers
198,495 comments
105,263 users