The Gateway to Computer Science Excellence
0 votes
77 views

in Theory of Computation by Loyal (8.6k points) | 77 views
0
Is it CFG???
0
yeah it is i got it ...it's clearly not regular bcoz production D->aDD but for rest, it's follow all and we know that

CFL subset of CSL then again RE
0
is this not a right linear regular grammer?
0
Ya RG is a subset of CFG which is a subset of CSG and so on but the question asks which option accurately describes the grammer? what was the answer?
0
Is it not RG because D -> ADD is right recursive?
0
two non-terminal can not come along in regular grammar here DD coming so can not
0
oh ok thanks.. But can regular grammers have recursion?
0
yeah regular grammar could be either left recursion or right recursion

Please log in or register to answer this question.

No related questions found

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,646 questions
56,505 answers
195,539 comments
100,977 users