The grammars G = ( { s }, { 0, 1 }, p , s)
where p = (s —> 0S1, S —> OS, S —> S1, S —>0} is a
| A. | recursively enumerable language |
| B. | regular language |
| C. | context-sensitive language |
| D. | context-free language |
Answer : B Explanation : |
|
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |
