Compiler Design Lanuage


#1

For the Language
D = { bn an bk ck| n ≥ 0, k ≥ 0 }.
is it REG CFL DEC


#2

The given language is DCFL. It can be accepted by a DPDA by this logic - push b, pop b for every occurence of ‘a’ … we will get to know wether no of a and b are equal or not… if equal then stack will be empty… for part of input push b, and pop b for every occurence of c… by this we get to know if b and c are equal. This can be achieved using discrete PDA. Hence DCFL