Bihar STET – TOC Practice Test | Set 1

Questions 26-30 of 100

0% completed (0/100 answered)
Your score 0/100 0 answered
Correct 0 Incorrect 0 Unanswered 100 Accuracy 0%

Question 26

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 12.09.2023 (Shift-I) PYQ

A Context-Free Grammar (CFG) is defined as a 4-tuple $G = (V$, T, P, S). What constraint is placed on production rules in P?

Answers for question 26

Question 27

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 18.09.2023 (Shift-I) PYQ

A grammar that produces more than one distinct parse tree for the exact same input sentence is called -

Answers for question 27

Question 28

MCQ · Single Correct 1 mark

A Context-Free Grammar is unambiguous if and only if every valid sentence in the language has -

Answers for question 28

Question 29

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 12.09.2023 (Shift-II) PYQ

What language is generated by the Context-Free Grammar S → 0S1 | 1S0 | SS | $\epsilon$?

Answers for question 29

Question 30

MCQ · Single Correct 1 mark
Previous Year Question Bihar STET C.S. 12.06.2024 (Shift-II) PYQ

A Context-Free Grammar is in Chomsky Normal Form (CNF) if every production rule is of the form -

Answers for question 30
Scroll to Top