1,029 views

2 Answers

1 votes
1 votes

L = {ai bj ck | i = k or j = k}

No it's NCFL I guess. We would have one CFL D1 to check i==k(say CFL1) and another CFL to check j==k(say CFL2), and then the final one (say CFL3) to connect CFL1 and CFL2, hence there is a non-determinism. 

0 votes
0 votes
Yes.its DCFL.

Related questions

0 votes
0 votes
0 answers
1
2019_Aspirant asked Dec 9, 2018
247 views
Operator precedence parser even parses ambiguous grammars that are in form of operator grammars. I am inquiring about the nature of the ambiguous grammar. Could the langu...
1 votes
1 votes
1 answer
2
1 votes
1 votes
2 answers
3
ggwon asked Dec 29, 2022
729 views
L = {$a^{n+m}b^{n}a^{m} | n,m \geq 0$}Is the above language DCFL or CFL ?