0 votes 0 votes Q- the Grammer S-> aSb | bSa |SS |Ɛ a) unambiguous CFG b) ambiguous CFG c) not a CFG d) deterministic CFG Theory of Computation theory-of-computation grammar parsing + – shashank joshi asked Nov 18, 2018 • retagged Jun 18, 2019 by Cristine shashank joshi 415 views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Hemanth_13 commented Nov 18, 2018 reply Follow Share You can generate the string bb in 2 ways( two diff parse tree's) One by S-> bSb |Ɛ and other by S-> bSb |SS |Ɛ 1 votes 1 votes Mk Utkarsh commented Nov 20, 2018 reply Follow Share There exist no algorithm to find out that CFG is ambiguous or not. So hit and trial. 1 votes 1 votes Gurdeep Saini commented Nov 22, 2018 reply Follow Share To determine if a context free grammar is ambiguous is undecidable 0 votes 0 votes Please log in or register to add a comment.
