0 0 votes Theory of Computation regular-expression theory-of-computation + – Mojo-Jojo 1.3k views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
Best answer 0 0 votes non of these since all grammar are left linear! (grammar is ambiguous only if it is left and right linear both). there is only one derivation tree for each production. Umang Raman answered Sep 29, 2015 Umang Raman comment Share Follow See all 8 Comments 8 8 Comments reply Show 5 previous comments Umang Raman commented Sep 29, 2015 reply Follow flag yup!! 0 0 replyShare Mojo-Jojo commented Oct 4, 2015 reply Follow flag Hey, why is S → aA/a A → aA/ε ambiguous ? Is there any link which can clear my doubts about ambiguous grammers ? Thanks :) 0 0 replyShare Umang Raman commented Oct 4, 2015 reply Follow flag Defination of ambiguous grammar : if for any string there is more than 1 derivation tree then it is ambiguous. 0 0 replyShare Please log in or register to add a comment.