264 views
0 votes
0 votes
my doubt is if some grammer contain both left recursive and right recursive grammer then it's ambigious grammer. is this stmt is true for all such type of grammer???

1 Answer

Related questions

3 votes
3 votes
1 answer
1
logan1x asked May 10, 2019
1,105 views
Why is ambiguity in regular language is decidable and not decidable in CFL ? Can you give Example?
0 votes
0 votes
0 answers
2
OneZero asked Dec 7, 2018
578 views
Why is Regular grammar obtained from DFA always unambiguous?Why Regular grammar obtained from NFA may or may not be ambiguous?
0 votes
0 votes
1 answer
3
0 votes
0 votes
2 answers
4