0 votes 0 votes What type of grammar is this most accurately described as? S->b/ aD D->a/ aDD A. A regular grammar B. CFG C. CSG D. Type-0 Theory of Computation theory-of-computation finite-automata regular-language regular-expression + – Shashi Shekhar 1 asked Sep 2, 2017 Shashi Shekhar 1 439 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes (B) Context Free Grammar In CFG, if there is a production as $X\rightarrow Y $ then $X \epsilon V$ and $Y \epsilon (V +T)^*$ Manu Thakur answered Sep 2, 2017 edited Sep 2, 2017 Manu Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.