engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Context Free Languages and Pushdown Automata Pushdown Automata
The grammar
G: S → SS | a | b is ambiguous.
This indicates that at least some of the strings in its language have more than just the leftmost derivation. However, it's possible that certain language strings have just one source.
i. bbbba (has x leftmost derivation).
ii. aaaa (has y leftmost derivation).
iii. aab (has z leftmost derivation).
What is the value of x+y+z?
Enter numerical value using the virtual keypad. Round off where necessary.