6. G (10,1,S),10,1),S,S0S1,S-X)is a phrase-structure grammar, where 0,1 are term

Question

6. G (10,1,S),10,1),S,S0S1,S-X)is a phrase-structure grammar, where 0,1 are terminals, S is the starting symbol, A is the empty string 1) L(G) is the language generated by G. L(G) is finite 2) 000111 is derivable from 0S1 3) 0000S1111 00001111 4) 0000Sll110000000 S1111111 5) 00S11 00S111 6) Let P1 S-0S1. P2S-X. Then the derivation of 000S111000000111111 is PiP2 7) L(G) is a context-free language 8) L(G) is a regular language 9) L(G) is a Type 1 language. 10) There are more than one derivation tree for the sentence 0000011111 11) A derivation tree is also called a parse tree 12) The Backus-Naur form of this grammar is: + 0.3Ks % + 34.6K Please answer all parts of the question.

Explanation / Answer

Solution:

1)

False

Explanation:

There are infinitely many strings for the given grammar.

2)

000111 is derivable from 0S1

Explanation:

The language is of the definition of 0^n1^n, which means a number of 0's and 1's are going to be same and number of consecutive 1's will appear only after a number of consecutive 0's

3)

True

4)

True

5)

False

6)

True

7)

True

8)

False

9)

True

10)

False

11)

True

12)

True

13)

True

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse 6
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.