Computer Sciences > GATE 2024 Set-2 > Grammars
Consider a context-free grammar G with the following 3 rules.
S → aS,
S → aSbS,
S → c
Let w ∈ L(G). Let na(w), nb(w), nc(w) denote the number of times a, b, c occur in w, respectively. Which of the following statements is/are TRUE?
S → aS,
S → aSbS,
S → c
Let w ∈ L(G). Let na(w), nb(w), nc(w) denote the number of times a, b, c occur in w, respectively. Which of the following statements is/are TRUE?
Correct : a,b,c
Similar Questions
Consider the following grammar G, with S as the start symbol. The grammar G has three incomplete productions denoted by (1), (2), and (3).
The set of termin...
Consider the following grammar G, with S as the start symbol. The grammar G has three incomplete productions denoted by (1), (2), and (3).
The set of termin...
Consider the following grammar G, with S as the start symbol. The grammar G has three incomplete productions denoted by (1), (2), and (3).
The set of termin...
Total Unique Visitors
Loading......