Question:
Grammar to be parsed by SLR parser {a, b, c, d, #, @
S'\(→\)S
S \(→\) SS |Aa| bAc | Bc | bAb
A \(→\) d#
B \(→\) @
(Closure { S'\(→\).S})
The number of items in goto Io on input S.
Grammar to be parsed by SLR parser {a, b, c, d, #, @
S'\(→\)S
S \(→\) SS |Aa| bAc | Bc | bAb
A \(→\) d#
B \(→\) @
(Closure { S'\(→\).S})
The number of items in goto Io on input S.
S'\(→\)S
S \(→\) SS |Aa| bAc | Bc | bAb
A \(→\) d#
B \(→\) @
(Closure { S'\(→\).S})
The number of items in goto Io on input S.
Updated On: Feb 18, 2024
Hide Solution
Verified By Collegedunia
Correct Answer: 9
Solution and Explanation
The correct answer is 9.
Was this answer helpful?
1
0
Questions Asked in GATE CS exam
- With respect to a TCP connection between a client and a server, which of the following is true?
- GATE CS - 2026
- Computer Networks
- Let $P, Q, R, S$ be relational schemas. Let ``$\rightarrow$'' indicate a functional dependency (FD) in this context. Which of the following best describes the meaning of a functional dependency?
- GATE CS - 2026
- Database Management Systems
- Let a Non-deterministic Finite Automaton (NFA) have 6 states over a finite alphabet. Which of the following cannot be the number of states in a minimal Deterministic Finite Automaton (DFA) that is equivalent to this NFA?
- GATE CS - 2026
- Theory of Computations
- A certain processor uses a fully associative cache of size 16 kB. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor?
- GATE CS - 2026
- Computer Organization and Architecture
- Consider $Z = X - Y$, where $X$, $Y$ and $Z$ are all in sign-magnitude form. $X$ and $Y$ are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of:
- GATE CS - 2026
- Computer Organization and Architecture
View More Questions