The Gateway to Computer Science Excellence
0 votes
36 views
Give LL grammars for the following languages, assuming $Σ =$ {$a,b, c$}.

(i) $L=$ {$a^nb^mc^{n+m}:n\geq0,m\geq0$} .

(ii) $L=$ {$a^{n+2}b^mc^{n+m}:n\geq0,m\geq0$} .

(iii) $L=$ {$a^nb^{n+2}c^{m}:n\geq0,m\gt1$} .

(iv) $L=$ {$w:n_a(w)\lt n_b(w)$} .

(v) $L=$ {$w:n_a(w)+n_b(w)\neq n_c(w)$} .
in Theory of Computation by Boss (15.4k points) | 36 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,382 answers
198,530 comments
105,323 users