Question
Download Solution PDFWhich of the following statements is/are TRUE?
(a) The grammar S → SS | a is ambiguous. (Where S is the start symbol)
(b) The grammar S → 0S1 | 01S |e is ambiguous. (The special symbol e represents the empty string) (Where S is the start symbol)
(c) The grammar (Where S is the start symbol)
S → T / U
T → x S y | xy | ϵ
U → yT
generates a language consisting of the string yxxyy.
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFThe correct answer is option 4.
CONCEPT:
For grammar to be ambiguous, a string needs to have
More than one parse tree
More than two leftmost derivative
More than two rightmost derivative
Key Points
The grammar S → SS | a is ambiguous grammar. It generates two parse trees with string aaa.
The grammar S → 0S1 | 01S |e is ambiguous. It generates two parse trees with string 01.
The grammar S → T / U, T → x S y | xy | ϵ, U → yT generates a language consisting of the string yxxyy.
∴ Hence the correct answer is All of (a), (b) and (c) are TRUE.
Last updated on Jun 12, 2025
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.