Computer Sciences > GATE 2021 SET-2 > Automata
Consider the following augmented grammar with {#, ā, <, >, a, b, c} as the set of terminals.
S' → S
S → S # c S
S → SS
S → S ā
S → < S >
S → a
S → b
S → c
Let I0 = CLOSURE({S' → • S}). The number of items in the set GOTO(GOTO(I0, <), <) is _______.
S' → S
S → S # c S
S → SS
S → S ā
S → < S >
S → a
S → b
S → c
Let I0 = CLOSURE({S' → • S}). The number of items in the set GOTO(GOTO(I0, <), <) is _______.
Correct : 8 to 8
Similar Questions
Which of the following is/are undecidable?
Consider the 5-state DFA M accepting the language L(M) ⊂ (0 + 1)* shown below. For any string w ∈ (0 + 1)* let n0(w) be the number of 0′s in w and n1(w) be the...
Which one of the following regular expressions is equivalent to the language accepted by the DFA given below?
Total Unique Visitors
Loading......